About the Execution of ITS-Tools for ShieldIIPt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
983.048 | 120866.00 | 130433.00 | 11812.80 | TFFFFFFTTTTTFFFT | 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.r216-tall-162098205100428.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 ShieldIIPt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100428
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 167K May 5 16:52 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 ShieldIIPt-PT-010B-00
FORMULA_NAME ShieldIIPt-PT-010B-01
FORMULA_NAME ShieldIIPt-PT-010B-02
FORMULA_NAME ShieldIIPt-PT-010B-03
FORMULA_NAME ShieldIIPt-PT-010B-04
FORMULA_NAME ShieldIIPt-PT-010B-05
FORMULA_NAME ShieldIIPt-PT-010B-06
FORMULA_NAME ShieldIIPt-PT-010B-07
FORMULA_NAME ShieldIIPt-PT-010B-08
FORMULA_NAME ShieldIIPt-PT-010B-09
FORMULA_NAME ShieldIIPt-PT-010B-10
FORMULA_NAME ShieldIIPt-PT-010B-11
FORMULA_NAME ShieldIIPt-PT-010B-12
FORMULA_NAME ShieldIIPt-PT-010B-13
FORMULA_NAME ShieldIIPt-PT-010B-14
FORMULA_NAME ShieldIIPt-PT-010B-15
=== Now, execution of the tool begins
BK_START 1621100825133
Running Version 0
[2021-05-15 17:47:15] [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-15 17:47:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 17:47:15] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-15 17:47:15] [INFO ] Transformed 703 places.
[2021-05-15 17:47:15] [INFO ] Transformed 653 transitions.
[2021-05-15 17:47:15] [INFO ] Found NUPN structural information;
[2021-05-15 17:47:15] [INFO ] Parsed PT model containing 703 places and 653 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 17:47:15] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldIIPt-PT-010B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 604 transition count 554
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 604 transition count 554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 603 transition count 553
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 603 transition count 553
Applied a total of 200 rules in 139 ms. Remains 603 /703 variables (removed 100) and now considering 553/653 (removed 100) transitions.
// Phase 1: matrix 553 rows 603 cols
[2021-05-15 17:47:16] [INFO ] Computed 91 place invariants in 27 ms
[2021-05-15 17:47:16] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 553 rows 603 cols
[2021-05-15 17:47:16] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 17:47:16] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
// Phase 1: matrix 553 rows 603 cols
[2021-05-15 17:47:16] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-15 17:47:17] [INFO ] Dead Transitions using invariants and state equation in 261 ms returned []
Finished structural reductions, in 1 iterations. Remains : 603/703 places, 553/653 transitions.
[2021-05-15 17:47:17] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-15 17:47:17] [INFO ] Flatten gal took : 77 ms
FORMULA ShieldIIPt-PT-010B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 17:47:17] [INFO ] Flatten gal took : 34 ms
[2021-05-15 17:47:17] [INFO ] Input system was already deterministic with 553 transitions.
Finished random walk after 25255 steps, including 0 resets, run visited all 16 properties in 162 ms. (steps per millisecond=155 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 591 transition count 541
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 591 transition count 541
Applied a total of 24 rules in 51 ms. Remains 591 /603 variables (removed 12) and now considering 541/553 (removed 12) transitions.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:47:17] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 17:47:17] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:47:17] [INFO ] Computed 91 place invariants in 7 ms
[2021-05-15 17:47:18] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:47:18] [INFO ] Computed 91 place invariants in 11 ms
[2021-05-15 17:47:18] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Finished structural reductions, in 1 iterations. Remains : 591/603 places, 541/553 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s536 0), p1:(NEQ s282 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-01 finished in 1036 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 592 transition count 542
Applied a total of 22 rules in 31 ms. Remains 592 /603 variables (removed 11) and now considering 542/553 (removed 11) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:47:18] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:47:18] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:47:18] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:47:19] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:47:19] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:47:19] [INFO ] Dead Transitions using invariants and state equation in 276 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/603 places, 542/553 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s513 1), p1:(AND (NEQ s236 0) (NEQ s109 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][false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 461 ms.
Stack based approach found an accepted trace after 3325 steps with 5 reset with depth 260 and stack size 23 in 16 ms.
FORMULA ShieldIIPt-PT-010B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-02 finished in 1421 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 602 transition count 434
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 484 transition count 434
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 236 place count 484 transition count 358
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 388 place count 408 transition count 358
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 395 place count 401 transition count 351
Iterating global reduction 2 with 7 rules applied. Total rules applied 402 place count 401 transition count 351
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 402 place count 401 transition count 346
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 412 place count 396 transition count 346
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 752 place count 226 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 753 place count 226 transition count 175
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 3 with 2 rules applied. Total rules applied 755 place count 225 transition count 174
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 813 place count 196 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 195 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 816 place count 193 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 816 place count 193 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 818 place count 192 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 819 place count 191 transition count 189
Applied a total of 819 rules in 7410 ms. Remains 191 /603 variables (removed 412) and now considering 189/553 (removed 364) transitions.
// Phase 1: matrix 189 rows 191 cols
[2021-05-15 17:47:27] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:47:27] [INFO ] Implicit Places using invariants in 119 ms returned [179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
[2021-05-15 17:47:27] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 189 rows 190 cols
[2021-05-15 17:47:27] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:47:27] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 190/603 places, 189/553 transitions.
Applied a total of 0 rules in 7 ms. Remains 190 /190 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2021-05-15 17:47:27] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 189 rows 190 cols
[2021-05-15 17:47:27] [INFO ] Computed 88 place invariants in 3 ms
[2021-05-15 17:47:27] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 2 iterations. Remains : 190/603 places, 189/553 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-03 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 s89 0) (EQ s178 1) (EQ s188 0) (EQ s172 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 76 reset in 477 ms.
Product exploration explored 100000 steps with 72 reset in 481 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 64 reset in 330 ms.
Product exploration explored 100000 steps with 70 reset in 357 ms.
[2021-05-15 17:47:29] [INFO ] Flatten gal took : 14 ms
[2021-05-15 17:47:29] [INFO ] Flatten gal took : 14 ms
[2021-05-15 17:47:29] [INFO ] Time to serialize gal into /tmp/LTL6595783724891361603.gal : 20 ms
[2021-05-15 17:47:29] [INFO ] Time to serialize properties into /tmp/LTL14079584988209786342.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/LTL6595783724891361603.gal, -t, CGAL, -LTL, /tmp/LTL14079584988209786342.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/LTL6595783724891361603.gal -t CGAL -LTL /tmp/LTL14079584988209786342.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((p316==0)||(p646==1))||(p696==0))||(p624==1))"))))
Formula 0 simplified : !GF"((((p316==0)||(p646==1))||(p696==0))||(p624==1))"
Reverse transition relation is NOT exact ! Due to transitions t63.t58.t59.t60, t63.t58.t61, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/187/2/189
Computing Next relation with stutter on 2.73368e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
61 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.652993,38040,1,0,327,137790,407,123,6615,87075,465
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-010B-03 finished in 10370 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 602 transition count 433
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 483 transition count 433
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 238 place count 483 transition count 358
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 388 place count 408 transition count 358
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 395 place count 401 transition count 351
Iterating global reduction 2 with 7 rules applied. Total rules applied 402 place count 401 transition count 351
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 402 place count 401 transition count 345
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 414 place count 395 transition count 345
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 750 place count 227 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 751 place count 227 transition count 176
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 3 with 2 rules applied. Total rules applied 753 place count 226 transition count 175
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 811 place count 197 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 812 place count 196 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 814 place count 194 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 814 place count 194 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 816 place count 193 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 817 place count 192 transition count 191
Applied a total of 817 rules in 65 ms. Remains 192 /603 variables (removed 411) and now considering 191/553 (removed 362) transitions.
// Phase 1: matrix 191 rows 192 cols
[2021-05-15 17:47:30] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:47:30] [INFO ] Implicit Places using invariants in 168 ms returned [181]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
[2021-05-15 17:47:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 191 rows 191 cols
[2021-05-15 17:47:30] [INFO ] Computed 88 place invariants in 4 ms
[2021-05-15 17:47:30] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 191/603 places, 191/553 transitions.
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 2 place count 190 transition count 190
Applied a total of 2 rules in 7 ms. Remains 190 /191 variables (removed 1) and now considering 190/191 (removed 1) transitions.
// Phase 1: matrix 190 rows 190 cols
[2021-05-15 17:47:30] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:47:31] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 190 rows 190 cols
[2021-05-15 17:47:31] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 17:47:31] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 190/603 places, 190/553 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010B-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s55 0) (EQ s92 1)), p1:(OR (EQ s37 0) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1054 steps with 0 reset in 4 ms.
FORMULA ShieldIIPt-PT-010B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-04 finished in 717 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 592 transition count 542
Applied a total of 22 rules in 26 ms. Remains 592 /603 variables (removed 11) and now considering 542/553 (removed 11) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:47:31] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 17:47:31] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:47:31] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:47:31] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:47:31] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:47:32] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/603 places, 542/553 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s432 0) (NEQ s103 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]]
Product exploration explored 100000 steps with 50000 reset in 541 ms.
Product exploration explored 100000 steps with 50000 reset in 560 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 539 ms.
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 592 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 592/592 places, 542/542 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 592 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 117 place count 592 transition count 603
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 168 place count 592 transition count 603
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 358 places in 0 ms
Iterating global reduction 1 with 190 rules applied. Total rules applied 358 place count 592 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 359 place count 592 transition count 602
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 428 place count 523 transition count 533
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 497 place count 523 transition count 533
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 523 transition count 533
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 500 place count 521 transition count 531
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 502 place count 521 transition count 531
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -167
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 532 place count 521 transition count 698
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 562 place count 491 transition count 638
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 592 place count 491 transition count 638
Deduced a syphon composed of 288 places in 0 ms
Applied a total of 592 rules in 151 ms. Remains 491 /592 variables (removed 101) and now considering 638/542 (removed -96) transitions.
[2021-05-15 17:47:34] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 638 rows 491 cols
[2021-05-15 17:47:34] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:47:35] [INFO ] Dead Transitions using invariants and state equation in 327 ms returned []
Finished structural reductions, in 1 iterations. Remains : 491/592 places, 638/542 transitions.
Product exploration explored 100000 steps with 50000 reset in 2298 ms.
Product exploration explored 100000 steps with 50000 reset in 2091 ms.
[2021-05-15 17:47:39] [INFO ] Flatten gal took : 24 ms
[2021-05-15 17:47:39] [INFO ] Flatten gal took : 21 ms
[2021-05-15 17:47:39] [INFO ] Time to serialize gal into /tmp/LTL9247173440149801778.gal : 9 ms
[2021-05-15 17:47:39] [INFO ] Time to serialize properties into /tmp/LTL10758460312881982638.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/LTL9247173440149801778.gal, -t, CGAL, -LTL, /tmp/LTL10758460312881982638.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/LTL9247173440149801778.gal -t CGAL -LTL /tmp/LTL10758460312881982638.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p508!=0)||(p116!=1))"))))
Formula 0 simplified : !XF"((p508!=0)||(p116!=1))"
Detected timeout of ITS tools.
[2021-05-15 17:47:54] [INFO ] Flatten gal took : 22 ms
[2021-05-15 17:47:54] [INFO ] Applying decomposition
[2021-05-15 17:47:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8994568513535762140.txt, -o, /tmp/graph8994568513535762140.bin, -w, /tmp/graph8994568513535762140.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8994568513535762140.bin, -l, -1, -v, -w, /tmp/graph8994568513535762140.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:47:54] [INFO ] Decomposing Gal with order
[2021-05-15 17:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:47:54] [INFO ] Removed a total of 103 redundant transitions.
[2021-05-15 17:47:54] [INFO ] Flatten gal took : 73 ms
[2021-05-15 17:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-15 17:47:54] [INFO ] Time to serialize gal into /tmp/LTL5576644398697114652.gal : 10 ms
[2021-05-15 17:47:54] [INFO ] Time to serialize properties into /tmp/LTL9914637492101018006.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/LTL5576644398697114652.gal, -t, CGAL, -LTL, /tmp/LTL9914637492101018006.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5576644398697114652.gal -t CGAL -LTL /tmp/LTL9914637492101018006.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i14.u161.p508!=0)||(i4.u38.p116!=1))"))))
Formula 0 simplified : !XF"((i14.u161.p508!=0)||(i4.u38.p116!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12849357307373253424
[2021-05-15 17:48:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12849357307373253424
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12849357307373253424]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12849357307373253424] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12849357307373253424] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-010B-10 finished in 39668 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 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 592 transition count 542
Applied a total of 22 rules in 19 ms. Remains 592 /603 variables (removed 11) and now considering 542/553 (removed 11) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:10] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:48:11] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:11] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:11] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:11] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:11] [INFO ] Dead Transitions using invariants and state equation in 282 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/603 places, 542/553 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s38 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]]
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 541 ms.
Product exploration explored 100000 steps with 50000 reset in 552 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 592 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 592/592 places, 542/542 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 592 transition count 542
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 118 place count 592 transition count 606
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 170 place count 592 transition count 606
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 360 places in 0 ms
Iterating global reduction 1 with 190 rules applied. Total rules applied 360 place count 592 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 361 place count 592 transition count 605
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 430 place count 523 transition count 536
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 499 place count 523 transition count 536
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 523 transition count 536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 502 place count 521 transition count 534
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 504 place count 521 transition count 534
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -156
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 533 place count 521 transition count 690
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 563 place count 491 transition count 630
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 593 place count 491 transition count 630
Deduced a syphon composed of 289 places in 0 ms
Applied a total of 593 rules in 77 ms. Remains 491 /592 variables (removed 101) and now considering 630/542 (removed -88) transitions.
[2021-05-15 17:48:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 630 rows 491 cols
[2021-05-15 17:48:14] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:14] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 491/592 places, 630/542 transitions.
Product exploration explored 100000 steps with 50000 reset in 2146 ms.
Product exploration explored 100000 steps with 50000 reset in 2095 ms.
[2021-05-15 17:48:18] [INFO ] Flatten gal took : 20 ms
[2021-05-15 17:48:18] [INFO ] Flatten gal took : 17 ms
[2021-05-15 17:48:18] [INFO ] Time to serialize gal into /tmp/LTL12009268645196926381.gal : 2 ms
[2021-05-15 17:48:18] [INFO ] Time to serialize properties into /tmp/LTL6497865147013216810.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/LTL12009268645196926381.gal, -t, CGAL, -LTL, /tmp/LTL6497865147013216810.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/LTL12009268645196926381.gal -t CGAL -LTL /tmp/LTL6497865147013216810.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p38!=1)"))))
Formula 0 simplified : !XF"(p38!=1)"
Detected timeout of ITS tools.
[2021-05-15 17:48:33] [INFO ] Flatten gal took : 16 ms
[2021-05-15 17:48:33] [INFO ] Applying decomposition
[2021-05-15 17:48:33] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15839307550357383014.txt, -o, /tmp/graph15839307550357383014.bin, -w, /tmp/graph15839307550357383014.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15839307550357383014.bin, -l, -1, -v, -w, /tmp/graph15839307550357383014.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:48:33] [INFO ] Decomposing Gal with order
[2021-05-15 17:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:48:33] [INFO ] Removed a total of 101 redundant transitions.
[2021-05-15 17:48:33] [INFO ] Flatten gal took : 34 ms
[2021-05-15 17:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-15 17:48:33] [INFO ] Time to serialize gal into /tmp/LTL10233971290258374112.gal : 5 ms
[2021-05-15 17:48:33] [INFO ] Time to serialize properties into /tmp/LTL5325565087434431636.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/LTL10233971290258374112.gal, -t, CGAL, -LTL, /tmp/LTL5325565087434431636.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10233971290258374112.gal -t CGAL -LTL /tmp/LTL5325565087434431636.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i0.i1.i1.u15.p38!=1)"))))
Formula 0 simplified : !XF"(i0.i1.i1.u15.p38!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13875484288214763363
[2021-05-15 17:48:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13875484288214763363
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13875484288214763363]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13875484288214763363] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13875484288214763363] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-010B-11 finished in 39103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 592 transition count 542
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 592 transition count 542
Applied a total of 22 rules in 16 ms. Remains 592 /603 variables (removed 11) and now considering 542/553 (removed 11) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:50] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:50] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:50] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:50] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:50] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-15 17:48:50] [INFO ] Dead Transitions using invariants and state equation in 240 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/603 places, 542/553 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (AND (EQ s456 0) (EQ s361 1)) (AND (EQ s461 0) (EQ s37 1))), p1:(EQ s128 1), p0:(OR (EQ s361 0) (EQ s456 1) (EQ s128 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-12 finished in 880 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 602 transition count 433
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 483 transition count 433
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 238 place count 483 transition count 357
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 390 place count 407 transition count 357
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 399 place count 398 transition count 348
Iterating global reduction 2 with 9 rules applied. Total rules applied 408 place count 398 transition count 348
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 408 place count 398 transition count 341
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 422 place count 391 transition count 341
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 2 with 332 rules applied. Total rules applied 754 place count 225 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 755 place count 225 transition count 174
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 3 with 2 rules applied. Total rules applied 757 place count 224 transition count 173
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 815 place count 195 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 816 place count 194 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 818 place count 192 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 818 place count 192 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 820 place count 191 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 821 place count 190 transition count 189
Applied a total of 821 rules in 80 ms. Remains 190 /603 variables (removed 413) and now considering 189/553 (removed 364) transitions.
// Phase 1: matrix 189 rows 190 cols
[2021-05-15 17:48:51] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:48:51] [INFO ] Implicit Places using invariants in 127 ms returned [179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
[2021-05-15 17:48:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 189 rows 189 cols
[2021-05-15 17:48:51] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:48:51] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 189/603 places, 189/553 transitions.
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 2 place count 188 transition count 188
Applied a total of 2 rules in 4 ms. Remains 188 /189 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 188 cols
[2021-05-15 17:48:51] [INFO ] Computed 88 place invariants in 0 ms
[2021-05-15 17:48:51] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 188 rows 188 cols
[2021-05-15 17:48:51] [INFO ] Computed 88 place invariants in 0 ms
[2021-05-15 17:48:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-15 17:48:51] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 188/603 places, 188/553 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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 p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s79 0) (EQ s115 1)), p0:(OR (EQ s115 0) (EQ s79 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-13 finished in 763 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((!p0 U ((G(p2)&&p1)||G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 553/553 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 602 transition count 436
Reduce places removed 116 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 117 rules applied. Total rules applied 233 place count 486 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 485 transition count 435
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 234 place count 485 transition count 358
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 388 place count 408 transition count 358
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 398 place count 398 transition count 348
Iterating global reduction 3 with 10 rules applied. Total rules applied 408 place count 398 transition count 348
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 408 place count 398 transition count 341
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 422 place count 391 transition count 341
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 750 place count 227 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 751 place count 227 transition count 176
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 4 with 2 rules applied. Total rules applied 753 place count 226 transition count 175
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 811 place count 197 transition count 194
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 812 place count 197 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 813 place count 196 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 814 place count 195 transition count 192
Applied a total of 814 rules in 42 ms. Remains 195 /603 variables (removed 408) and now considering 192/553 (removed 361) transitions.
// Phase 1: matrix 192 rows 195 cols
[2021-05-15 17:48:51] [INFO ] Computed 91 place invariants in 0 ms
[2021-05-15 17:48:51] [INFO ] Implicit Places using invariants in 92 ms returned [187]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
[2021-05-15 17:48:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 192 rows 194 cols
[2021-05-15 17:48:51] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 17:48:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 194/603 places, 192/553 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 194 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 191
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 193 cols
[2021-05-15 17:48:51] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 17:48:52] [INFO ] Implicit Places using invariants in 99 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 192/603 places, 191/553 transitions.
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 2 place count 191 transition count 190
Applied a total of 2 rules in 4 ms. Remains 191 /192 variables (removed 1) and now considering 190/191 (removed 1) transitions.
// Phase 1: matrix 190 rows 191 cols
[2021-05-15 17:48:52] [INFO ] Computed 89 place invariants in 0 ms
[2021-05-15 17:48:52] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 190 rows 191 cols
[2021-05-15 17:48:52] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:48:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-15 17:48:52] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 191/603 places, 190/553 transitions.
Stuttering acceptance computed with spot in 1767 ms :[false, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), false, (AND p0 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-010B-14 automaton TGBA [mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s184 0) (EQ s34 1)), p1:(AND (NEQ s184 0) (NEQ s34 1)), p2:(NEQ s73 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 617 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-010B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-14 finished in 2392 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15690366916964316450
[2021-05-15 17:48:54] [INFO ] Computing symmetric may disable matrix : 553 transitions.
[2021-05-15 17:48:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 17:48:54] [INFO ] Computing symmetric may enable matrix : 553 transitions.
[2021-05-15 17:48:54] [INFO ] Applying decomposition
[2021-05-15 17:48:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 17:48:54] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13619863148262502405.txt, -o, /tmp/graph13619863148262502405.bin, -w, /tmp/graph13619863148262502405.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13619863148262502405.bin, -l, -1, -v, -w, /tmp/graph13619863148262502405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:48:54] [INFO ] Decomposing Gal with order
[2021-05-15 17:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:48:54] [INFO ] Computing Do-Not-Accords matrix : 553 transitions.
[2021-05-15 17:48:54] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 17:48:54] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15690366916964316450
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15690366916964316450]
[2021-05-15 17:48:54] [INFO ] Removed a total of 93 redundant transitions.
[2021-05-15 17:48:54] [INFO ] Flatten gal took : 33 ms
[2021-05-15 17:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 17:48:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality14347753937486370010.gal : 10 ms
[2021-05-15 17:48:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality499943369548343211.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/LTLCardinality14347753937486370010.gal, -t, CGAL, -LTL, /tmp/LTLCardinality499943369548343211.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality14347753937486370010.gal -t CGAL -LTL /tmp/LTLCardinality499943369548343211.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(F(!("((i12.i1.i1.u166.p508==0)&&(i2.u40.p116==1))")))))
Formula 0 simplified : !XF!"((i12.i1.i1.u166.p508==0)&&(i2.u40.p116==1))"
Compilation finished in 3277 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15690366916964316450]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15690366916964316450]
LTSmin run took 465 ms.
FORMULA ShieldIIPt-PT-010B-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15690366916964316450]
LTSmin run took 435 ms.
FORMULA ShieldIIPt-PT-010B-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1621100945999
--------------------
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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 r216-tall-162098205100428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 ;