About the Execution of ITS-Tools for ShieldRVs-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15959.560 | 3600000.00 | 13316026.00 | 1247.40 | T?FFFFFTFFFTFFTT | 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.r235-smll-162106564500124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564500124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:45 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 370K 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 ShieldRVs-PT-030B-00
FORMULA_NAME ShieldRVs-PT-030B-01
FORMULA_NAME ShieldRVs-PT-030B-02
FORMULA_NAME ShieldRVs-PT-030B-03
FORMULA_NAME ShieldRVs-PT-030B-04
FORMULA_NAME ShieldRVs-PT-030B-05
FORMULA_NAME ShieldRVs-PT-030B-06
FORMULA_NAME ShieldRVs-PT-030B-07
FORMULA_NAME ShieldRVs-PT-030B-08
FORMULA_NAME ShieldRVs-PT-030B-09
FORMULA_NAME ShieldRVs-PT-030B-10
FORMULA_NAME ShieldRVs-PT-030B-11
FORMULA_NAME ShieldRVs-PT-030B-12
FORMULA_NAME ShieldRVs-PT-030B-13
FORMULA_NAME ShieldRVs-PT-030B-14
FORMULA_NAME ShieldRVs-PT-030B-15
=== Now, execution of the tool begins
BK_START 1621174749569
Running Version 0
[2021-05-16 14:19:12] [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-16 14:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:19:12] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2021-05-16 14:19:12] [INFO ] Transformed 1203 places.
[2021-05-16 14:19:12] [INFO ] Transformed 1353 transitions.
[2021-05-16 14:19:12] [INFO ] Found NUPN structural information;
[2021-05-16 14:19:12] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 14:19:12] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldRVs-PT-030B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 1001 transition count 1151
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 1001 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 405 place count 1000 transition count 1150
Iterating global reduction 0 with 1 rules applied. Total rules applied 406 place count 1000 transition count 1150
Applied a total of 406 rules in 435 ms. Remains 1000 /1203 variables (removed 203) and now considering 1150/1353 (removed 203) transitions.
// Phase 1: matrix 1150 rows 1000 cols
[2021-05-16 14:19:13] [INFO ] Computed 121 place invariants in 41 ms
[2021-05-16 14:19:14] [INFO ] Implicit Places using invariants in 932 ms returned []
// Phase 1: matrix 1150 rows 1000 cols
[2021-05-16 14:19:14] [INFO ] Computed 121 place invariants in 21 ms
[2021-05-16 14:19:16] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
// Phase 1: matrix 1150 rows 1000 cols
[2021-05-16 14:19:16] [INFO ] Computed 121 place invariants in 7 ms
[2021-05-16 14:19:17] [INFO ] Dead Transitions using invariants and state equation in 1021 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1203 places, 1150/1353 transitions.
[2021-05-16 14:19:17] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 14:19:17] [INFO ] Flatten gal took : 279 ms
FORMULA ShieldRVs-PT-030B-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:19:18] [INFO ] Flatten gal took : 154 ms
[2021-05-16 14:19:18] [INFO ] Input system was already deterministic with 1150 transitions.
Incomplete random walk after 100000 steps, including 77 resets, run finished after 872 ms. (steps per millisecond=114 ) properties (out of 11) seen :10
Running SMT prover for 1 properties.
// Phase 1: matrix 1150 rows 1000 cols
[2021-05-16 14:19:19] [INFO ] Computed 121 place invariants in 6 ms
[2021-05-16 14:19:19] [INFO ] [Real]Absence check using 121 positive place invariants in 63 ms returned sat
[2021-05-16 14:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:19:20] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2021-05-16 14:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:19:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 86 ms returned sat
[2021-05-16 14:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:19:21] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2021-05-16 14:19:22] [INFO ] Deduced a trap composed of 24 places in 691 ms of which 8 ms to minimize.
[2021-05-16 14:19:22] [INFO ] Deduced a trap composed of 21 places in 702 ms of which 5 ms to minimize.
[2021-05-16 14:19:23] [INFO ] Deduced a trap composed of 51 places in 432 ms of which 3 ms to minimize.
[2021-05-16 14:19:24] [INFO ] Deduced a trap composed of 24 places in 510 ms of which 4 ms to minimize.
[2021-05-16 14:19:24] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 2 ms to minimize.
[2021-05-16 14:19:25] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 1 ms to minimize.
[2021-05-16 14:19:25] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 1 ms to minimize.
[2021-05-16 14:19:25] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 1 ms to minimize.
[2021-05-16 14:19:26] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2021-05-16 14:19:26] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 1 ms to minimize.
[2021-05-16 14:19:26] [INFO ] Deduced a trap composed of 46 places in 365 ms of which 1 ms to minimize.
[2021-05-16 14:19:27] [INFO ] Deduced a trap composed of 26 places in 478 ms of which 1 ms to minimize.
[2021-05-16 14:19:27] [INFO ] Deduced a trap composed of 21 places in 429 ms of which 2 ms to minimize.
[2021-05-16 14:19:28] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 1 ms to minimize.
[2021-05-16 14:19:28] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 1 ms to minimize.
[2021-05-16 14:19:29] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 1 ms to minimize.
[2021-05-16 14:19:29] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 1 ms to minimize.
[2021-05-16 14:19:30] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 7 ms to minimize.
[2021-05-16 14:19:30] [INFO ] Deduced a trap composed of 14 places in 448 ms of which 1 ms to minimize.
[2021-05-16 14:19:31] [INFO ] Deduced a trap composed of 41 places in 450 ms of which 1 ms to minimize.
[2021-05-16 14:19:31] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 1 ms to minimize.
[2021-05-16 14:19:32] [INFO ] Deduced a trap composed of 30 places in 411 ms of which 1 ms to minimize.
[2021-05-16 14:19:32] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 1 ms to minimize.
[2021-05-16 14:19:32] [INFO ] Deduced a trap composed of 41 places in 392 ms of which 1 ms to minimize.
[2021-05-16 14:19:33] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 2 ms to minimize.
[2021-05-16 14:19:33] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 1 ms to minimize.
[2021-05-16 14:19:33] [INFO ] Deduced a trap composed of 49 places in 327 ms of which 1 ms to minimize.
[2021-05-16 14:19:34] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 1 ms to minimize.
[2021-05-16 14:19:34] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 1 ms to minimize.
[2021-05-16 14:19:35] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 1 ms to minimize.
[2021-05-16 14:19:35] [INFO ] Deduced a trap composed of 55 places in 292 ms of which 2 ms to minimize.
[2021-05-16 14:19:35] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 1 ms to minimize.
[2021-05-16 14:19:36] [INFO ] Deduced a trap composed of 63 places in 296 ms of which 1 ms to minimize.
[2021-05-16 14:19:36] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 2 ms to minimize.
[2021-05-16 14:19:36] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 10 ms to minimize.
[2021-05-16 14:19:37] [INFO ] Deduced a trap composed of 62 places in 287 ms of which 1 ms to minimize.
[2021-05-16 14:19:37] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 1 ms to minimize.
[2021-05-16 14:19:37] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 1 ms to minimize.
[2021-05-16 14:19:38] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 1 ms to minimize.
[2021-05-16 14:19:38] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 2 ms to minimize.
[2021-05-16 14:19:38] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 1 ms to minimize.
[2021-05-16 14:19:39] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 1 ms to minimize.
[2021-05-16 14:19:39] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2021-05-16 14:19:39] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 1 ms to minimize.
[2021-05-16 14:19:39] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 18367 ms
[2021-05-16 14:19:39] [INFO ] Computed and/alt/rep : 1149/3631/1149 causal constraints (skipped 0 transitions) in 121 ms.
[2021-05-16 14:19:40] [INFO ] Deduced a trap composed of 9 places in 700 ms of which 1 ms to minimize.
[2021-05-16 14:19:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 999 transition count 1029
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 879 transition count 1029
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 879 transition count 880
Deduced a syphon composed of 149 places in 9 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 730 transition count 880
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 545 place count 723 transition count 873
Iterating global reduction 2 with 7 rules applied. Total rules applied 552 place count 723 transition count 873
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 552 place count 723 transition count 871
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 556 place count 721 transition count 871
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 8 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1142 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1143 place count 427 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1144 place count 426 transition count 576
Applied a total of 1144 rules in 327 ms. Remains 426 /1000 variables (removed 574) and now considering 576/1150 (removed 574) transitions.
// Phase 1: matrix 576 rows 426 cols
[2021-05-16 14:19:41] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-16 14:19:41] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 576 rows 426 cols
[2021-05-16 14:19:41] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-16 14:19:42] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2021-05-16 14:19:42] [INFO ] Redundant transitions in 243 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[575]
// Phase 1: matrix 575 rows 426 cols
[2021-05-16 14:19:42] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:19:43] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
Starting structural reductions, iteration 1 : 426/1000 places, 575/1150 transitions.
Applied a total of 0 rules in 36 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2021-05-16 14:19:43] [INFO ] Redundant transitions in 172 ms returned []
// Phase 1: matrix 575 rows 426 cols
[2021-05-16 14:19:43] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-16 14:19:43] [INFO ] Dead Transitions using invariants and state equation in 367 ms returned []
Finished structural reductions, in 2 iterations. Remains : 426/1000 places, 575/1150 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-030B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s277 0) (NEQ s91 1) (NEQ s311 1)), p0:(NEQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 776 reset in 896 ms.
Product exploration explored 100000 steps with 779 reset in 582 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 782 reset in 500 ms.
Product exploration explored 100000 steps with 780 reset in 711 ms.
[2021-05-16 14:19:47] [INFO ] Flatten gal took : 71 ms
[2021-05-16 14:19:47] [INFO ] Flatten gal took : 40 ms
[2021-05-16 14:19:47] [INFO ] Time to serialize gal into /tmp/LTL8688375446667318690.gal : 25 ms
[2021-05-16 14:19:47] [INFO ] Time to serialize properties into /tmp/LTL14867757749419963113.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/LTL8688375446667318690.gal, -t, CGAL, -LTL, /tmp/LTL14867757749419963113.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/LTL8688375446667318690.gal -t CGAL -LTL /tmp/LTL14867757749419963113.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p883!=1)")U((G("(p883!=1)"))||("(((p794!=0)&&(p280!=1))&&(p883!=1))"))))))
Formula 0 simplified : !GF("(p883!=1)" U ("(((p794!=0)&&(p280!=1))&&(p883!=1))" | G"(p883!=1)"))
Detected timeout of ITS tools.
[2021-05-16 14:20:02] [INFO ] Flatten gal took : 57 ms
[2021-05-16 14:20:02] [INFO ] Applying decomposition
[2021-05-16 14:20:02] [INFO ] Flatten gal took : 36 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/graph5988046775973282651.txt, -o, /tmp/graph5988046775973282651.bin, -w, /tmp/graph5988046775973282651.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/graph5988046775973282651.bin, -l, -1, -v, -w, /tmp/graph5988046775973282651.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:20:02] [INFO ] Decomposing Gal with order
[2021-05-16 14:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:20:02] [INFO ] Removed a total of 631 redundant transitions.
[2021-05-16 14:20:03] [INFO ] Flatten gal took : 144 ms
[2021-05-16 14:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 662 labels/synchronizations in 51 ms.
[2021-05-16 14:20:03] [INFO ] Time to serialize gal into /tmp/LTL3075478171399351037.gal : 17 ms
[2021-05-16 14:20:03] [INFO ] Time to serialize properties into /tmp/LTL2460472704991514935.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/LTL3075478171399351037.gal, -t, CGAL, -LTL, /tmp/LTL2460472704991514935.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/LTL3075478171399351037.gal -t CGAL -LTL /tmp/LTL2460472704991514935.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i8.i1.u89.p883!=1)")U((G("(i8.i1.u89.p883!=1)"))||("(((i7.i1.u80.p794!=0)&&(i2.i1.u25.p280!=1))&&(i8.i1.u89.p883!=1))"))))))
Formula 0 simplified : !GF("(i8.i1.u89.p883!=1)" U ("(((i7.i1.u80.p794!=0)&&(i2.i1.u25.p280!=1))&&(i8.i1.u89.p883!=1))" | G"(i8.i1.u89.p883!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6478925102894884989
[2021-05-16 14:20:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6478925102894884989
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/ltsmin6478925102894884989]
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/ltsmin6478925102894884989] 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/ltsmin6478925102894884989] 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 ShieldRVs-PT-030B-01 finished in 38249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 992 transition count 1142
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 992 transition count 1142
Applied a total of 16 rules in 60 ms. Remains 992 /1000 variables (removed 8) and now considering 1142/1150 (removed 8) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2021-05-16 14:20:19] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-16 14:20:19] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2021-05-16 14:20:19] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-16 14:20:20] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2021-05-16 14:20:21] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-16 14:20:22] [INFO ] Dead Transitions using invariants and state equation in 1266 ms returned []
Finished structural reductions, in 1 iterations. Remains : 992/1000 places, 1142/1150 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-030B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s600 1), p1:(OR (EQ s246 0) (EQ s481 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-030B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-03 finished in 3276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 994 transition count 1144
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 994 transition count 1144
Applied a total of 12 rules in 67 ms. Remains 994 /1000 variables (removed 6) and now considering 1144/1150 (removed 6) transitions.
// Phase 1: matrix 1144 rows 994 cols
[2021-05-16 14:20:22] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-16 14:20:23] [INFO ] Implicit Places using invariants in 762 ms returned []
// Phase 1: matrix 1144 rows 994 cols
[2021-05-16 14:20:23] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-16 14:20:25] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2496 ms to find 0 implicit places.
// Phase 1: matrix 1144 rows 994 cols
[2021-05-16 14:20:25] [INFO ] Computed 121 place invariants in 6 ms
[2021-05-16 14:20:26] [INFO ] Dead Transitions using invariants and state equation in 1482 ms returned []
Finished structural reductions, in 1 iterations. Remains : 994/1000 places, 1144/1150 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (NEQ s92 0) (NEQ s848 1)), p1:(OR (EQ s619 0) (EQ s668 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]]
Stuttering criterion allowed to conclude after 53125 steps with 40 reset in 271 ms.
FORMULA ShieldRVs-PT-030B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-04 finished in 4492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 999 transition count 1029
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 879 transition count 1029
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 879 transition count 879
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 729 transition count 879
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 547 place count 722 transition count 872
Iterating global reduction 2 with 7 rules applied. Total rules applied 554 place count 722 transition count 872
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 554 place count 722 transition count 870
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 558 place count 720 transition count 870
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1146 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1147 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1148 place count 424 transition count 574
Applied a total of 1148 rules in 256 ms. Remains 424 /1000 variables (removed 576) and now considering 574/1150 (removed 576) transitions.
// Phase 1: matrix 574 rows 424 cols
[2021-05-16 14:20:27] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-16 14:20:27] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 574 rows 424 cols
[2021-05-16 14:20:27] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:20:28] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2021-05-16 14:20:28] [INFO ] Redundant transitions in 172 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[573]
// Phase 1: matrix 573 rows 424 cols
[2021-05-16 14:20:28] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:20:29] [INFO ] Dead Transitions using invariants and state equation in 975 ms returned []
Starting structural reductions, iteration 1 : 424/1000 places, 573/1150 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2021-05-16 14:20:29] [INFO ] Redundant transitions in 125 ms returned []
// Phase 1: matrix 573 rows 424 cols
[2021-05-16 14:20:29] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-16 14:20:30] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Finished structural reductions, in 2 iterations. Remains : 424/1000 places, 573/1150 transitions.
Stuttering acceptance computed with spot in 130 ms :[false, p0, p0]
Running random walk in product with property : ShieldRVs-PT-030B-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s203 0) (EQ s235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 381 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-030B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-05 finished in 3484 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 992 transition count 1142
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 992 transition count 1142
Applied a total of 16 rules in 66 ms. Remains 992 /1000 variables (removed 8) and now considering 1142/1150 (removed 8) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2021-05-16 14:20:30] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-16 14:20:31] [INFO ] Implicit Places using invariants in 635 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2021-05-16 14:20:31] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-16 14:20:32] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2021-05-16 14:20:32] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-16 14:20:34] [INFO ] Dead Transitions using invariants and state equation in 1354 ms returned []
Finished structural reductions, in 1 iterations. Remains : 992/1000 places, 1142/1150 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s526 0) (EQ s724 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 781 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-030B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-06 finished in 3648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 999 transition count 1028
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 878 transition count 1028
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 878 transition count 878
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 728 transition count 878
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 549 place count 721 transition count 871
Iterating global reduction 2 with 7 rules applied. Total rules applied 556 place count 721 transition count 871
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 556 place count 721 transition count 868
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 562 place count 718 transition count 868
Performed 292 Post agglomeration using F-continuation condition.Transition count delta: 292
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 2 with 584 rules applied. Total rules applied 1146 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1147 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1148 place count 424 transition count 574
Applied a total of 1148 rules in 123 ms. Remains 424 /1000 variables (removed 576) and now considering 574/1150 (removed 576) transitions.
// Phase 1: matrix 574 rows 424 cols
[2021-05-16 14:20:34] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:20:34] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 574 rows 424 cols
[2021-05-16 14:20:34] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:20:35] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2021-05-16 14:20:35] [INFO ] Redundant transitions in 145 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[573]
// Phase 1: matrix 573 rows 424 cols
[2021-05-16 14:20:35] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-16 14:20:36] [INFO ] Dead Transitions using invariants and state equation in 793 ms returned []
Starting structural reductions, iteration 1 : 424/1000 places, 573/1150 transitions.
Applied a total of 0 rules in 19 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2021-05-16 14:20:36] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 573 rows 424 cols
[2021-05-16 14:20:36] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-16 14:20:36] [INFO ] Dead Transitions using invariants and state equation in 484 ms returned []
Finished structural reductions, in 2 iterations. Remains : 424/1000 places, 573/1150 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s217 0) (NEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 622 steps with 1 reset in 3 ms.
FORMULA ShieldRVs-PT-030B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-09 finished in 2715 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 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 999 transition count 1029
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 879 transition count 1029
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 879 transition count 880
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 730 transition count 880
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 545 place count 723 transition count 873
Iterating global reduction 2 with 7 rules applied. Total rules applied 552 place count 723 transition count 873
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 552 place count 723 transition count 870
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 558 place count 720 transition count 870
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1146 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1147 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1148 place count 424 transition count 574
Applied a total of 1148 rules in 109 ms. Remains 424 /1000 variables (removed 576) and now considering 574/1150 (removed 576) transitions.
// Phase 1: matrix 574 rows 424 cols
[2021-05-16 14:20:36] [INFO ] Computed 121 place invariants in 1 ms
[2021-05-16 14:20:37] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 574 rows 424 cols
[2021-05-16 14:20:37] [INFO ] Computed 121 place invariants in 14 ms
[2021-05-16 14:20:38] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2021-05-16 14:20:38] [INFO ] Redundant transitions in 183 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[573]
// Phase 1: matrix 573 rows 424 cols
[2021-05-16 14:20:38] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:20:39] [INFO ] Dead Transitions using invariants and state equation in 629 ms returned []
Starting structural reductions, iteration 1 : 424/1000 places, 573/1150 transitions.
Applied a total of 0 rules in 35 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2021-05-16 14:20:39] [INFO ] Redundant transitions in 170 ms returned []
// Phase 1: matrix 573 rows 424 cols
[2021-05-16 14:20:39] [INFO ] Computed 121 place invariants in 2 ms
[2021-05-16 14:20:39] [INFO ] Dead Transitions using invariants and state equation in 693 ms returned []
Finished structural reductions, in 2 iterations. Remains : 424/1000 places, 573/1150 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s396 0) (NEQ s365 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 409 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-030B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-10 finished in 3153 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 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1150/1150 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 993 transition count 1143
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 993 transition count 1143
Applied a total of 14 rules in 58 ms. Remains 993 /1000 variables (removed 7) and now considering 1143/1150 (removed 7) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2021-05-16 14:20:40] [INFO ] Computed 121 place invariants in 7 ms
[2021-05-16 14:20:40] [INFO ] Implicit Places using invariants in 567 ms returned []
// Phase 1: matrix 1143 rows 993 cols
[2021-05-16 14:20:40] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-16 14:20:42] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
// Phase 1: matrix 1143 rows 993 cols
[2021-05-16 14:20:42] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-16 14:20:43] [INFO ] Dead Transitions using invariants and state equation in 1357 ms returned []
Finished structural reductions, in 1 iterations. Remains : 993/1000 places, 1143/1150 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s640 0) (NEQ s166 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 ShieldRVs-PT-030B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-13 finished in 3668 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8598000652080139772
[2021-05-16 14:20:43] [INFO ] Computing symmetric may disable matrix : 1150 transitions.
[2021-05-16 14:20:43] [INFO ] Applying decomposition
[2021-05-16 14:20:43] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:20:43] [INFO ] Computing symmetric may enable matrix : 1150 transitions.
[2021-05-16 14:20:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:20:43] [INFO ] Flatten gal took : 70 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/graph10030221868983410365.txt, -o, /tmp/graph10030221868983410365.bin, -w, /tmp/graph10030221868983410365.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/graph10030221868983410365.bin, -l, -1, -v, -w, /tmp/graph10030221868983410365.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:20:44] [INFO ] Decomposing Gal with order
[2021-05-16 14:20:44] [INFO ] Computing Do-Not-Accords matrix : 1150 transitions.
[2021-05-16 14:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:20:44] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:20:44] [INFO ] Built C files in 383ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8598000652080139772
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/ltsmin8598000652080139772]
[2021-05-16 14:20:44] [INFO ] Removed a total of 1071 redundant transitions.
[2021-05-16 14:20:44] [INFO ] Flatten gal took : 126 ms
[2021-05-16 14:20:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-16 14:20:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality4899088079802806049.gal : 21 ms
[2021-05-16 14:20:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality1168796223840629975.ltl : 12 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/LTLCardinality4899088079802806049.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1168796223840629975.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/LTLCardinality4899088079802806049.gal -t CGAL -LTL /tmp/LTLCardinality1168796223840629975.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i12.i0.i1.u276.p883!=1)")U(("((!((i11.u249.p794==0)||(i3.u90.p280==1)))&&(i12.i0.i1.u276.p883!=1))")||(G("(i12.i0.i1.u276.p883!=1)")))))))
Formula 0 simplified : !GF("(i12.i0.i1.u276.p883!=1)" U ("((!((i11.u249.p794==0)||(i3.u90.p280==1)))&&(i12.i0.i1.u276.p883!=1))" | G"(i12.i0.i1.u276.p883!=1)"))
Compilation finished in 14993 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8598000652080139772]
Link finished in 92 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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8598000652080139772]
WARNING : LTSmin timed out (>450 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8598000652080139772]
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8598000652080139772]
Detected timeout of ITS tools.
[2021-05-16 14:41:15] [INFO ] Applying decomposition
[2021-05-16 14:41:15] [INFO ] Flatten gal took : 155 ms
[2021-05-16 14:41:15] [INFO ] Decomposing Gal with order
[2021-05-16 14:41:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:41:16] [INFO ] Removed a total of 627 redundant transitions.
[2021-05-16 14:41:16] [INFO ] Flatten gal took : 285 ms
[2021-05-16 14:41:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 83 ms.
[2021-05-16 14:41:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality3289797988351917279.gal : 45 ms
[2021-05-16 14:41:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality15448351742944993242.ltl : 99 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/LTLCardinality3289797988351917279.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15448351742944993242.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/LTLCardinality3289797988351917279.gal -t CGAL -LTL /tmp/LTLCardinality15448351742944993242.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.p883!=1)")U(("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u169.p794==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u76.p280==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.p883!=1))")||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.p883!=1)")))))))
Formula 0 simplified : !GF("(i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.p883!=1)" U ("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u169.p794==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u76.p280==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.p883!=1))" | G"(i0.i0.i0.i0.i0.i0.i0.i0.i1.u184.p883!=1)"))
Detected timeout of ITS tools.
[2021-05-16 15:01:47] [INFO ] Flatten gal took : 147 ms
[2021-05-16 15:01:48] [INFO ] Input system was already deterministic with 1150 transitions.
[2021-05-16 15:01:48] [INFO ] Transformed 1000 places.
[2021-05-16 15:01:48] [INFO ] Transformed 1150 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 15:01:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality6147261318912708420.gal : 24 ms
[2021-05-16 15:01:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality17081068305444340337.ltl : 14 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/LTLCardinality6147261318912708420.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17081068305444340337.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality6147261318912708420.gal -t CGAL -LTL /tmp/LTLCardinality17081068305444340337.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(p883!=1)")U(("((!((p794==0)||(p280==1)))&&(p883!=1))")||(G("(p883!=1)")))))))
Formula 0 simplified : !GF("(p883!=1)" U ("((!((p794==0)||(p280==1)))&&(p883!=1))" | G"(p883!=1)"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.149: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.164: Initializing POR dependencies: labels 1152, guards 1150
pins2lts-mc-linux64( 5/ 8), 0.166: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.194: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.210: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 14.058: LTL layer: formula: [](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))
pins2lts-mc-linux64( 7/ 8), 14.058: "[](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 14.059: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 15.248: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 15.310: There are 1153 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 15.310: State length is 1001, there are 1156 groups
pins2lts-mc-linux64( 0/ 8), 15.310: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 15.310: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 15.310: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 15.310: Visible groups: 13 / 1156, labels: 2 / 1153
pins2lts-mc-linux64( 0/ 8), 15.310: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 15.310: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 15.464: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 15.562: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 6/ 8), 15.742: [Blue] ~480 levels ~3840 states ~4176 transitions
pins2lts-mc-linux64( 5/ 8), 16.075: [Blue] ~809 levels ~7680 states ~12336 transitions
pins2lts-mc-linux64( 5/ 8), 16.690: [Blue] ~809 levels ~15360 states ~23736 transitions
pins2lts-mc-linux64( 7/ 8), 17.801: [Blue] ~1345 levels ~30720 states ~54400 transitions
pins2lts-mc-linux64( 7/ 8), 20.059: [Blue] ~1347 levels ~61440 states ~99600 transitions
pins2lts-mc-linux64( 7/ 8), 24.819: [Blue] ~1350 levels ~122880 states ~196248 transitions
pins2lts-mc-linux64( 3/ 8), 34.417: [Blue] ~1473 levels ~245760 states ~398368 transitions
pins2lts-mc-linux64( 3/ 8), 53.351: [Blue] ~1526 levels ~491520 states ~767072 transitions
pins2lts-mc-linux64( 3/ 8), 89.964: [Blue] ~1530 levels ~983040 states ~1509616 transitions
pins2lts-mc-linux64( 3/ 8), 171.659: [Blue] ~1534 levels ~1966080 states ~3035728 transitions
pins2lts-mc-linux64( 3/ 8), 334.230: [Blue] ~1544 levels ~3932160 states ~6210696 transitions
pins2lts-mc-linux64( 7/ 8), 653.413: [Blue] ~1368 levels ~7864320 states ~12391848 transitions
pins2lts-mc-linux64( 7/ 8), 1300.102: [Blue] ~1373 levels ~15728640 states ~24874448 transitions
pins2lts-mc-linux64( 7/ 8), 2594.259: [Blue] ~1373 levels ~31457280 states ~49462040 transitions
pins2lts-mc-linux64( 4/ 8), 2768.542: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2768.817:
pins2lts-mc-linux64( 0/ 8), 2768.817: Explored 29912054 states 45670490 transitions, fanout: 1.527
pins2lts-mc-linux64( 0/ 8), 2768.817: Total exploration time 2753.470 sec (2753.210 sec minimum, 2753.295 sec on average)
pins2lts-mc-linux64( 0/ 8), 2768.817: States per second: 10863, Transitions per second: 16587
pins2lts-mc-linux64( 0/ 8), 2768.817:
pins2lts-mc-linux64( 0/ 8), 2768.817: State space has 29926544 states, 3717500 are accepting
pins2lts-mc-linux64( 0/ 8), 2768.817: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2768.817: blue states: 29912054 (99.95%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2768.817: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2768.817: all-red states: 21584861 (72.13%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2768.817:
pins2lts-mc-linux64( 0/ 8), 2768.817: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 2768.817:
pins2lts-mc-linux64( 0/ 8), 2768.817: Queue width: 8B, total height: 11538, memory: 0.09MB
pins2lts-mc-linux64( 0/ 8), 2768.817: Tree memory: 484.3MB, 17.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 2768.817: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2768.817: Stored 1177 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2768.817: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2768.817: Est. total memory use: 484.4MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8598000652080139772]
255
java.lang.RuntimeException: Unexpected exception when executing 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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8598000652080139772]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldRVs-PT-030B"
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 ShieldRVs-PT-030B, 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 r235-smll-162106564500124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B 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 ;