About the Execution of ITS-Tools for Parking-PT-208
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
577.504 | 24408.00 | 37614.00 | 308.10 | TFTFFTTTFTFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127800420.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-208, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800420
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 49K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-208-00
FORMULA_NAME Parking-PT-208-01
FORMULA_NAME Parking-PT-208-02
FORMULA_NAME Parking-PT-208-03
FORMULA_NAME Parking-PT-208-04
FORMULA_NAME Parking-PT-208-05
FORMULA_NAME Parking-PT-208-06
FORMULA_NAME Parking-PT-208-07
FORMULA_NAME Parking-PT-208-08
FORMULA_NAME Parking-PT-208-09
FORMULA_NAME Parking-PT-208-10
FORMULA_NAME Parking-PT-208-11
FORMULA_NAME Parking-PT-208-12
FORMULA_NAME Parking-PT-208-13
FORMULA_NAME Parking-PT-208-14
FORMULA_NAME Parking-PT-208-15
=== Now, execution of the tool begins
BK_START 1620980392156
Running Version 0
[2021-05-14 08:19:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 08:19:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:19:53] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-14 08:19:53] [INFO ] Transformed 137 places.
[2021-05-14 08:19:53] [INFO ] Transformed 201 transitions.
[2021-05-14 08:19:53] [INFO ] Found NUPN structural information;
[2021-05-14 08:19:53] [INFO ] Parsed PT model containing 137 places and 201 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:19:53] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 135 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 135 transition count 115
Applied a total of 4 rules in 24 ms. Remains 135 /137 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 135 cols
[2021-05-14 08:19:53] [INFO ] Computed 34 place invariants in 15 ms
[2021-05-14 08:19:53] [INFO ] Implicit Places using invariants in 166 ms returned [28, 44, 66, 101, 109, 117, 129]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 191 ms to find 7 implicit places.
// Phase 1: matrix 115 rows 128 cols
[2021-05-14 08:19:54] [INFO ] Computed 27 place invariants in 5 ms
[2021-05-14 08:19:54] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 128/137 places, 115/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 111
Applied a total of 8 rules in 9 ms. Remains 124 /128 variables (removed 4) and now considering 111/115 (removed 4) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:19:54] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-14 08:19:54] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:19:54] [INFO ] Computed 27 place invariants in 2 ms
[2021-05-14 08:19:54] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:19:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 124/137 places, 111/117 transitions.
[2021-05-14 08:19:54] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 08:19:54] [INFO ] Flatten gal took : 36 ms
FORMULA Parking-PT-208-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:19:54] [INFO ] Flatten gal took : 12 ms
[2021-05-14 08:19:54] [INFO ] Input system was already deterministic with 111 transitions.
Finished random walk after 1439 steps, including 41 resets, run visited all 16 properties in 19 ms. (steps per millisecond=75 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:19:54] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:19:54] [INFO ] Implicit Places using invariants in 54 ms returned [35, 49, 61, 89, 120]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
// Phase 1: matrix 111 rows 119 cols
[2021-05-14 08:19:54] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:19:54] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 119/124 places, 111/111 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 107
Applied a total of 8 rules in 10 ms. Remains 115 /119 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:54] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:19:54] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:54] [INFO ] Computed 22 place invariants in 9 ms
[2021-05-14 08:19:54] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:19:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/124 places, 107/111 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Parking-PT-208-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s31 0) (NEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-03 finished in 472 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&G((X(p3)||p2))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:19:55] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:19:55] [INFO ] Implicit Places using invariants in 45 ms returned [35, 61, 89, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 45 ms to find 4 implicit places.
// Phase 1: matrix 111 rows 120 cols
[2021-05-14 08:19:55] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-14 08:19:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 120/124 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 117 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 117 transition count 108
Applied a total of 6 rules in 5 ms. Remains 117 /120 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 117 cols
[2021-05-14 08:19:55] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:19:55] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2021-05-14 08:19:55] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-14 08:19:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:19:55] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 117/124 places, 108/111 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Parking-PT-208-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s33 0) (EQ s88 1)), p1:(NEQ s112 1), p2:(OR (NEQ s33 0) (NEQ s88 1)), p3:(OR (EQ s47 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-04 finished in 447 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&(G(p1)||X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:19:55] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:19:55] [INFO ] Implicit Places using invariants in 44 ms returned [35, 49, 61, 89, 120]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 45 ms to find 5 implicit places.
// Phase 1: matrix 111 rows 119 cols
[2021-05-14 08:19:55] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:19:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 119/124 places, 111/111 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 107
Applied a total of 8 rules in 4 ms. Remains 115 /119 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:55] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:19:55] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:55] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:19:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:19:55] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/124 places, 107/111 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : Parking-PT-208-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(OR (EQ s36 0) (EQ s91 1)), p0:(AND (OR (EQ s58 0) (EQ s19 1)) (OR (EQ s36 0) (EQ s91 1))), p2:(OR (EQ s58 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Knowledge obtained : [p1, p0, p2]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 68 ms :[true, false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:56] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:19:56] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:56] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:19:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:19:56] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:19:56] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:19:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 107/107 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 71 ms :[true, false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 115/115 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 115 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 113 transition count 105
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 113 transition count 105
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 113 transition count 109
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 16 rules in 18 ms. Remains 113 /115 variables (removed 2) and now considering 109/107 (removed -2) transitions.
[2021-05-14 08:19:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 109 rows 113 cols
[2021-05-14 08:19:57] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:19:57] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/115 places, 109/107 transitions.
Product exploration explored 100000 steps with 50000 reset in 575 ms.
Product exploration explored 100000 steps with 50000 reset in 534 ms.
[2021-05-14 08:19:58] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:19:58] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:19:58] [INFO ] Time to serialize gal into /tmp/LTL10955747189079132182.gal : 102 ms
[2021-05-14 08:19:58] [INFO ] Time to serialize properties into /tmp/LTL12157360752565946524.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10955747189079132182.gal, -t, CGAL, -LTL, /tmp/LTL12157360752565946524.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10955747189079132182.gal -t CGAL -LTL /tmp/LTL12157360752565946524.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(((p69==0)||(p19==1))&&((p40==0)||(p106==1)))")U("((p40==0)||(p106==1))"))&&((G("((p40==0)||(p106==1))"))||(X("((p69==0)||(p19==1))")))))
Formula 0 simplified : !(("(((p69==0)||(p19==1))&&((p40==0)||(p106==1)))" U "((p40==0)||(p106==1))") & (G"((p40==0)||(p106==1))" | X"((p69==0)||(p19==1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/2/107
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
37 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.386657,31708,1,0,201,92363,250,100,3389,50203,233
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-208-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-208-05 finished in 3887 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 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 124 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 120 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 120 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 116 transition count 103
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 106 transition count 93
Applied a total of 36 rules in 15 ms. Remains 106 /124 variables (removed 18) and now considering 93/111 (removed 18) transitions.
// Phase 1: matrix 93 rows 106 cols
[2021-05-14 08:19:59] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:19:59] [INFO ] Implicit Places using invariants in 54 ms returned [31, 40, 51, 77, 103]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 55 ms to find 5 implicit places.
[2021-05-14 08:19:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 93 rows 101 cols
[2021-05-14 08:19:59] [INFO ] Computed 22 place invariants in 9 ms
[2021-05-14 08:19:59] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 101/124 places, 93/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 92
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 91
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 0 with 2 rules applied. Total rules applied 6 place count 98 transition count 110
Applied a total of 6 rules in 10 ms. Remains 98 /101 variables (removed 3) and now considering 110/93 (removed -17) transitions.
// Phase 1: matrix 110 rows 98 cols
[2021-05-14 08:19:59] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:19:59] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 110 rows 98 cols
[2021-05-14 08:19:59] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:19:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:19:59] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 98/124 places, 110/111 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s43 1) (EQ s28 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 5860 reset in 207 ms.
Product exploration explored 100000 steps with 5656 reset in 225 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5813 reset in 166 ms.
Product exploration explored 100000 steps with 5772 reset in 186 ms.
[2021-05-14 08:20:00] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:20:00] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:20:00] [INFO ] Time to serialize gal into /tmp/LTL8617631566946018619.gal : 2 ms
[2021-05-14 08:20:00] [INFO ] Time to serialize properties into /tmp/LTL14920121788014614376.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8617631566946018619.gal, -t, CGAL, -LTL, /tmp/LTL14920121788014614376.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8617631566946018619.gal -t CGAL -LTL /tmp/LTL14920121788014614376.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p0==0)||(p58==1))||(p33==1))"))))
Formula 0 simplified : !GF"(((p0==0)||(p58==1))||(p33==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
121 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.23546,62056,1,0,9,264076,24,7,2726,47042,27
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-208-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-208-07 finished in 2536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:20:01] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:20:01] [INFO ] Implicit Places using invariants in 44 ms returned [35, 49, 61, 89, 120]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 45 ms to find 5 implicit places.
// Phase 1: matrix 111 rows 119 cols
[2021-05-14 08:20:01] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 119/124 places, 111/111 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 107
Applied a total of 8 rules in 4 ms. Remains 115 /119 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-14 08:20:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/124 places, 107/111 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-08 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 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 123 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 119 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 119 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 115 transition count 102
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 105 transition count 92
Applied a total of 36 rules in 9 ms. Remains 105 /124 variables (removed 19) and now considering 92/111 (removed 19) transitions.
// Phase 1: matrix 92 rows 105 cols
[2021-05-14 08:20:02] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 46 ms returned [30, 39, 50, 76, 102]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 53 ms to find 5 implicit places.
[2021-05-14 08:20:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 100 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 100/124 places, 92/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 91
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 98 transition count 90
Applied a total of 4 rules in 13 ms. Remains 98 /100 variables (removed 2) and now considering 90/92 (removed 2) transitions.
// Phase 1: matrix 90 rows 98 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 90 rows 98 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 98/124 places, 90/111 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-10 finished in 250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:20:02] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 43 ms returned [35, 49, 61, 89, 120]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
// Phase 1: matrix 111 rows 119 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 119/124 places, 111/111 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 107
Applied a total of 8 rules in 3 ms. Remains 115 /119 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2021-05-14 08:20:02] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 115/124 places, 107/111 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s56 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-11 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:20:02] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 42 ms returned [35, 49, 89, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
// Phase 1: matrix 111 rows 120 cols
[2021-05-14 08:20:02] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 120/124 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 117 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 117 transition count 108
Applied a total of 6 rules in 3 ms. Remains 117 /120 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 117 cols
[2021-05-14 08:20:02] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2021-05-14 08:20:02] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 117/124 places, 108/111 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s57 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-12 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2021-05-14 08:20:03] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-14 08:20:03] [INFO ] Implicit Places using invariants in 50 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
// Phase 1: matrix 111 rows 121 cols
[2021-05-14 08:20:03] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:03] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 121/124 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 108
Applied a total of 6 rules in 2 ms. Remains 118 /121 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:03] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:03] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 108 rows 118 cols
[2021-05-14 08:20:03] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:03] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 118/124 places, 108/111 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-208-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s114 0) (EQ s17 1)), p1:(AND (OR (EQ s50 0) (EQ s83 1)) (OR (EQ s114 0) (EQ s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 118/118 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 118 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 118 transition count 108
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 118 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 114 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 114 transition count 104
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 114 transition count 108
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 23 rules in 9 ms. Remains 114 /118 variables (removed 4) and now considering 108/108 (removed 0) transitions.
[2021-05-14 08:20:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 114 cols
[2021-05-14 08:20:04] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-14 08:20:04] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/118 places, 108/108 transitions.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
[2021-05-14 08:20:05] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:20:05] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:20:05] [INFO ] Time to serialize gal into /tmp/LTL7360661500107747000.gal : 1 ms
[2021-05-14 08:20:05] [INFO ] Time to serialize properties into /tmp/LTL12615196748166969834.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7360661500107747000.gal, -t, CGAL, -LTL, /tmp/LTL12615196748166969834.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7360661500107747000.gal -t CGAL -LTL /tmp/LTL12615196748166969834.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p132==0)||(p17==1))")||(X(G("(((p58==0)||(p94==1))&&((p132==0)||(p17==1)))"))))))
Formula 0 simplified : !X("((p132==0)||(p17==1))" | XG"(((p58==0)||(p94==1))&&((p132==0)||(p17==1)))")
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/106/2/108
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
46 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.471508,34100,1,0,202,116214,236,101,3477,61852,227
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-208-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-208-13 finished in 2645 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 124/124 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 124 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 120 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 120 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 116 transition count 103
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 26 place count 111 transition count 98
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 111 transition count 98
Applied a total of 27 rules in 12 ms. Remains 111 /124 variables (removed 13) and now considering 98/111 (removed 13) transitions.
// Phase 1: matrix 98 rows 111 cols
[2021-05-14 08:20:05] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-14 08:20:05] [INFO ] Implicit Places using invariants in 43 ms returned [43, 55, 81, 108]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
[2021-05-14 08:20:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 107 cols
[2021-05-14 08:20:05] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-14 08:20:05] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 107/124 places, 98/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 95
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 8 place count 103 transition count 94
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 0 with 2 rules applied. Total rules applied 10 place count 102 transition count 113
Applied a total of 10 rules in 8 ms. Remains 102 /107 variables (removed 5) and now considering 113/98 (removed -15) transitions.
// Phase 1: matrix 113 rows 102 cols
[2021-05-14 08:20:05] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:05] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 113 rows 102 cols
[2021-05-14 08:20:05] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-14 08:20:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:20:05] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 102/124 places, 113/111 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s52 0) (EQ s33 1)) (OR (EQ s4 0) (EQ s76 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 3059 reset in 201 ms.
Product exploration explored 100000 steps with 3054 reset in 254 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3059 reset in 209 ms.
Product exploration explored 100000 steps with 3045 reset in 211 ms.
[2021-05-14 08:20:06] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:20:06] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:20:06] [INFO ] Time to serialize gal into /tmp/LTL11952607922158936029.gal : 4 ms
[2021-05-14 08:20:06] [INFO ] Time to serialize properties into /tmp/LTL8129294472241888460.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11952607922158936029.gal, -t, CGAL, -LTL, /tmp/LTL8129294472241888460.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11952607922158936029.gal -t CGAL -LTL /tmp/LTL8129294472241888460.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p65==0)||(p36==1))&&((p4==0)||(p96==1)))"))))
Formula 0 simplified : !FG"(((p65==0)||(p36==1))&&((p4==0)||(p96==1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
755 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,7.55809,240612,1,0,320,1.01305e+06,24,228,2672,1.35019e+06,510
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-208-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-208-14 finished in 9979 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620980416564
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-208"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127800420"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;