About the Execution of ITS-Tools for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.336 | 3600000.00 | 12469001.00 | 174562.00 | F?FFFFFFFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017200796.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S10J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200796
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 04:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J60-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652950795782
Running Version 202205111006
[2022-05-19 08:59:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 08:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:59:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 08:59:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 08:59:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2022-05-19 08:59:57] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 08:59:57] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 10 ms.
[2022-05-19 08:59:57] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 569 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 244 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 213 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 08:59:58] [INFO ] Computed 13 place invariants in 10 ms
[2022-05-19 08:59:58] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-19 08:59:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 08:59:58] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:59:58] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 08:59:58] [INFO ] Flatten gal took : 33 ms
FORMULA PolyORBNT-COL-S10J60-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:59:58] [INFO ] Flatten gal took : 12 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 08:59:59] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 277 ms.
[2022-05-19 08:59:59] [INFO ] Unfolded 10 HLPN properties in 4 ms.
[2022-05-19 08:59:59] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-19 08:59:59] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-19 08:59:59] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-19 08:59:59] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 31 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 145 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Applied a total of 10 rules in 183 ms. Remains 1224 /1234 variables (removed 10) and now considering 2810/2810 (removed 0) transitions.
[2022-05-19 08:59:59] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1224 cols
[2022-05-19 08:59:59] [INFO ] Computed 142 place invariants in 205 ms
[2022-05-19 09:00:01] [INFO ] Dead Transitions using invariants and state equation in 2249 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 09:00:01] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:00:01] [INFO ] Computed 142 place invariants in 78 ms
[2022-05-19 09:00:02] [INFO ] Implicit Places using invariants in 988 ms returned []
[2022-05-19 09:00:02] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:00:02] [INFO ] Computed 142 place invariants in 71 ms
[2022-05-19 09:00:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:00:08] [INFO ] Implicit Places using invariants and state equation in 6011 ms returned []
Implicit Place search using SMT with State Equation took 7002 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1224/1234 places, 2195/2810 transitions.
Applied a total of 0 rules in 88 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1234 places, 2195/2810 transitions.
Support contains 145 out of 1224 places after structural reductions.
[2022-05-19 09:00:09] [INFO ] Flatten gal took : 223 ms
[2022-05-19 09:00:09] [INFO ] Flatten gal took : 160 ms
[2022-05-19 09:00:09] [INFO ] Input system was already deterministic with 2195 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 09:00:10] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:00:10] [INFO ] Computed 142 place invariants in 59 ms
[2022-05-19 09:00:11] [INFO ] [Real]Absence check using 136 positive place invariants in 42 ms returned sat
[2022-05-19 09:00:11] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 21 ms returned sat
[2022-05-19 09:00:12] [INFO ] After 1623ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 09:00:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:00:13] [INFO ] After 280ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-19 09:00:13] [INFO ] After 499ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2022-05-19 09:00:13] [INFO ] After 2584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-19 09:00:13] [INFO ] [Nat]Absence check using 136 positive place invariants in 46 ms returned sat
[2022-05-19 09:00:13] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 26 ms returned sat
[2022-05-19 09:00:15] [INFO ] After 1569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 09:00:15] [INFO ] After 230ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 09:00:16] [INFO ] Deduced a trap composed of 589 places in 573 ms of which 2 ms to minimize.
[2022-05-19 09:00:17] [INFO ] Deduced a trap composed of 574 places in 570 ms of which 2 ms to minimize.
[2022-05-19 09:00:17] [INFO ] Deduced a trap composed of 557 places in 567 ms of which 2 ms to minimize.
[2022-05-19 09:00:18] [INFO ] Deduced a trap composed of 600 places in 617 ms of which 1 ms to minimize.
[2022-05-19 09:00:19] [INFO ] Deduced a trap composed of 552 places in 561 ms of which 2 ms to minimize.
[2022-05-19 09:00:19] [INFO ] Deduced a trap composed of 547 places in 564 ms of which 2 ms to minimize.
[2022-05-19 09:00:20] [INFO ] Deduced a trap composed of 592 places in 558 ms of which 1 ms to minimize.
[2022-05-19 09:00:21] [INFO ] Deduced a trap composed of 580 places in 543 ms of which 2 ms to minimize.
[2022-05-19 09:00:21] [INFO ] Deduced a trap composed of 534 places in 601 ms of which 1 ms to minimize.
[2022-05-19 09:00:22] [INFO ] Deduced a trap composed of 606 places in 608 ms of which 1 ms to minimize.
[2022-05-19 09:00:23] [INFO ] Deduced a trap composed of 529 places in 600 ms of which 2 ms to minimize.
[2022-05-19 09:00:23] [INFO ] Deduced a trap composed of 585 places in 584 ms of which 1 ms to minimize.
[2022-05-19 09:00:24] [INFO ] Deduced a trap composed of 544 places in 549 ms of which 1 ms to minimize.
[2022-05-19 09:00:25] [INFO ] Deduced a trap composed of 539 places in 631 ms of which 1 ms to minimize.
[2022-05-19 09:00:25] [INFO ] Deduced a trap composed of 542 places in 600 ms of which 2 ms to minimize.
[2022-05-19 09:00:26] [INFO ] Deduced a trap composed of 597 places in 572 ms of which 1 ms to minimize.
[2022-05-19 09:00:27] [INFO ] Deduced a trap composed of 580 places in 565 ms of which 1 ms to minimize.
[2022-05-19 09:00:28] [INFO ] Deduced a trap composed of 585 places in 569 ms of which 1 ms to minimize.
[2022-05-19 09:00:28] [INFO ] Deduced a trap composed of 583 places in 591 ms of which 1 ms to minimize.
[2022-05-19 09:00:29] [INFO ] Deduced a trap composed of 598 places in 560 ms of which 1 ms to minimize.
[2022-05-19 09:00:30] [INFO ] Deduced a trap composed of 562 places in 600 ms of which 1 ms to minimize.
[2022-05-19 09:00:30] [INFO ] Deduced a trap composed of 542 places in 567 ms of which 1 ms to minimize.
[2022-05-19 09:00:31] [INFO ] Deduced a trap composed of 552 places in 545 ms of which 1 ms to minimize.
[2022-05-19 09:00:31] [INFO ] Deduced a trap composed of 517 places in 563 ms of which 1 ms to minimize.
[2022-05-19 09:00:32] [INFO ] Deduced a trap composed of 539 places in 540 ms of which 1 ms to minimize.
[2022-05-19 09:00:33] [INFO ] Deduced a trap composed of 589 places in 537 ms of which 1 ms to minimize.
[2022-05-19 09:00:33] [INFO ] Deduced a trap composed of 552 places in 511 ms of which 1 ms to minimize.
[2022-05-19 09:00:38] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 22666 ms
[2022-05-19 09:00:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 09:00:38] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:1
Parikh walk visited 0 properties in 9 ms.
Support contains 13 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 1159 transition count 2130
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 1159 transition count 2066
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 1095 transition count 2066
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 259 place count 1094 transition count 2065
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 1094 transition count 2065
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 1092 transition count 2063
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 1092 transition count 2062
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 1091 transition count 2062
Applied a total of 266 rules in 508 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 09:00:39] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:39] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:00:40] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Finished random walk after 773 steps, including 54 resets, run visited all 2 properties in 11 ms. (steps per millisecond=70 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 1091 transition count 2062
Applied a total of 266 rules in 314 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 09:00:40] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:41] [INFO ] Computed 142 place invariants in 65 ms
[2022-05-19 09:00:42] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
[2022-05-19 09:00:42] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:42] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:00:43] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2022-05-19 09:00:43] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:43] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 09:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:00:49] [INFO ] Implicit Places using invariants and state equation in 6387 ms returned []
Implicit Place search using SMT with State Equation took 7407 ms to find 0 implicit places.
[2022-05-19 09:00:49] [INFO ] Redundant transitions in 126 ms returned []
[2022-05-19 09:00:49] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:49] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:00:50] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2062/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1087 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 59 steps with 6 reset in 5 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-00 finished in 10402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 1093 transition count 2064
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 1093 transition count 2064
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 1091 transition count 2062
Applied a total of 266 rules in 332 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 09:00:51] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:51] [INFO ] Computed 142 place invariants in 54 ms
[2022-05-19 09:00:52] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
[2022-05-19 09:00:52] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:52] [INFO ] Computed 142 place invariants in 73 ms
[2022-05-19 09:00:53] [INFO ] Implicit Places using invariants in 991 ms returned []
[2022-05-19 09:00:53] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:00:53] [INFO ] Computed 142 place invariants in 74 ms
[2022-05-19 09:00:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:01] [INFO ] Implicit Places using invariants and state equation in 8216 ms returned []
Implicit Place search using SMT with State Equation took 9214 ms to find 0 implicit places.
[2022-05-19 09:01:01] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-19 09:01:01] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:01] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:01:03] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2062/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7164 reset in 1186 ms.
Product exploration explored 100000 steps with 7151 reset in 1159 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 54 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 54 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 09:01:05] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:05] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:01:06] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
[2022-05-19 09:01:06] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:07] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:01:07] [INFO ] Implicit Places using invariants in 936 ms returned []
[2022-05-19 09:01:07] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:07] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:01:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:18] [INFO ] Implicit Places using invariants and state equation in 10962 ms returned []
Implicit Place search using SMT with State Equation took 11899 ms to find 0 implicit places.
[2022-05-19 09:01:18] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-19 09:01:18] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:18] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:01:20] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 212 steps, including 18 resets, run visited all 1 properties in 4 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7219 reset in 1066 ms.
Product exploration explored 100000 steps with 7113 reset in 1091 ms.
Built C files in :
/tmp/ltsmin13269126542422697399
[2022-05-19 09:01:22] [INFO ] Too many transitions (2062) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:01:22] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13269126542422697399
Running compilation step : cd /tmp/ltsmin13269126542422697399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13269126542422697399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13269126542422697399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 51 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 09:01:25] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:25] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:01:26] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
[2022-05-19 09:01:26] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:26] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:01:27] [INFO ] Implicit Places using invariants in 891 ms returned []
[2022-05-19 09:01:27] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:27] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:01:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:36] [INFO ] Implicit Places using invariants and state equation in 8369 ms returned []
Implicit Place search using SMT with State Equation took 9269 ms to find 0 implicit places.
[2022-05-19 09:01:36] [INFO ] Redundant transitions in 51 ms returned []
[2022-05-19 09:01:36] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 09:01:36] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:01:37] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Built C files in :
/tmp/ltsmin1667436097076044907
[2022-05-19 09:01:37] [INFO ] Too many transitions (2062) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:01:37] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1667436097076044907
Running compilation step : cd /tmp/ltsmin1667436097076044907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1667436097076044907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1667436097076044907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 09:01:40] [INFO ] Flatten gal took : 120 ms
[2022-05-19 09:01:40] [INFO ] Flatten gal took : 113 ms
[2022-05-19 09:01:40] [INFO ] Time to serialize gal into /tmp/LTL10460582240379427880.gal : 25 ms
[2022-05-19 09:01:40] [INFO ] Time to serialize properties into /tmp/LTL16779116685075180304.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10460582240379427880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16779116685075180304.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1046058...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(QueueJobE_0<1)"))))
Formula 0 simplified : !FG"(QueueJobE_0<1)"
Detected timeout of ITS tools.
[2022-05-19 09:01:56] [INFO ] Flatten gal took : 100 ms
[2022-05-19 09:01:56] [INFO ] Applying decomposition
[2022-05-19 09:01:56] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15097770478979196209.txt' '-o' '/tmp/graph15097770478979196209.bin' '-w' '/tmp/graph15097770478979196209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15097770478979196209.bin' '-l' '-1' '-v' '-w' '/tmp/graph15097770478979196209.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:01:56] [INFO ] Decomposing Gal with order
[2022-05-19 09:01:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:01:57] [INFO ] Removed a total of 4056 redundant transitions.
[2022-05-19 09:01:57] [INFO ] Flatten gal took : 670 ms
[2022-05-19 09:01:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 554 labels/synchronizations in 100 ms.
[2022-05-19 09:01:57] [INFO ] Time to serialize gal into /tmp/LTL300634970453615119.gal : 21 ms
[2022-05-19 09:01:57] [INFO ] Time to serialize properties into /tmp/LTL8580664064851601404.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL300634970453615119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8580664064851601404.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3006349...244
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u1.QueueJobE_0<1)"))))
Formula 0 simplified : !FG"(i0.u1.QueueJobE_0<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2688792095234010028
[2022-05-19 09:02:12] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2688792095234010028
Running compilation step : cd /tmp/ltsmin2688792095234010028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2688792095234010028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2688792095234010028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-01 finished in 84474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F((p1||G(!p0)))))))'
Support contains 75 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 86 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:02:15] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:15] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 09:02:17] [INFO ] Dead Transitions using invariants and state equation in 1695 ms found 0 transitions.
[2022-05-19 09:02:17] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:17] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:02:18] [INFO ] Implicit Places using invariants in 921 ms returned []
[2022-05-19 09:02:18] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:18] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:02:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:02:27] [INFO ] Implicit Places using invariants and state equation in 9748 ms returned []
Implicit Place search using SMT with State Equation took 10679 ms to find 0 implicit places.
[2022-05-19 09:02:27] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:28] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:02:29] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s100 1) (GEQ s313 1)) (AND (GEQ s0 1) (GEQ s71 1) (GEQ s313 1)) (AND (GEQ s0 1) (GEQ s120 1) (GEQ s313 1)) (AND (GEQ s0 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-02 finished in 14676 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 71 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:02:30] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:30] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 09:02:31] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
[2022-05-19 09:02:31] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:31] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:02:33] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2022-05-19 09:02:33] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:33] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:02:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:02:46] [INFO ] Implicit Places using invariants and state equation in 13679 ms returned []
Implicit Place search using SMT with State Equation took 14851 ms to find 0 implicit places.
[2022-05-19 09:02:46] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:46] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:02:48] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s376 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-03 finished in 18327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(X(F(p0)))))&&X(p1)))'
Support contains 13 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 67 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:02:48] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:48] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:02:50] [INFO ] Dead Transitions using invariants and state equation in 1642 ms found 0 transitions.
[2022-05-19 09:02:50] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:50] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 09:02:51] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2022-05-19 09:02:51] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:51] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:02:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:02:59] [INFO ] Implicit Places using invariants and state equation in 8536 ms returned []
Implicit Place search using SMT with State Equation took 9561 ms to find 0 implicit places.
[2022-05-19 09:02:59] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:02:59] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:03:01] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s380 2), p0:(OR (AND (GEQ s383 1) (GEQ s386 1) (GEQ s388 1) (GEQ s394 8)) (AND (GEQ s383 1) (GEQ s385 2) (GEQ s394 8)) (AND (GEQ s383 1) (GEQ s388...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-05 finished in 13084 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(p1)||p0)))&&G(X(!p1))))'
Support contains 73 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 56 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:03:01] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:01] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:03:03] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
[2022-05-19 09:03:03] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:03] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:03:04] [INFO ] Implicit Places using invariants in 998 ms returned []
[2022-05-19 09:03:04] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:04] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:03:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:03:12] [INFO ] Implicit Places using invariants and state equation in 7935 ms returned []
Implicit Place search using SMT with State Equation took 8942 ms to find 0 implicit places.
[2022-05-19 09:03:12] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:12] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:03:13] [INFO ] Dead Transitions using invariants and state equation in 1649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 137 ms :[p1, (OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s383 1) (GEQ s386 1) (GEQ s388 1) (GEQ s394 8)) (AND (GEQ s383 1) (GEQ s385 2) (GEQ s394 8)) (AND (GEQ s383 1) (GEQ s388 1) (GEQ s392 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 7 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-08 finished in 12515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(F(X(X(p0)))))||G(p1)))'
Support contains 2 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 59 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:03:14] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:14] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:03:15] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
[2022-05-19 09:03:15] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:15] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:03:17] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2022-05-19 09:03:17] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:17] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:03:24] [INFO ] Implicit Places using invariants and state equation in 7162 ms returned []
Implicit Place search using SMT with State Equation took 8324 ms to find 0 implicit places.
[2022-05-19 09:03:24] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:24] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:03:25] [INFO ] Dead Transitions using invariants and state equation in 1703 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 1}, { cond=(NOT p1), acceptance={} source=6 dest: 3}]], initial=5, aps=[p0:(LT s377 1), p1:(GEQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 975 ms.
Product exploration explored 100000 steps with 25000 reset in 939 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 195665 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195665 steps, saw 58776 distinct states, run finished after 3006 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 09:03:31] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:31] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:03:31] [INFO ] [Real]Absence check using 136 positive place invariants in 42 ms returned sat
[2022-05-19 09:03:31] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 24 ms returned sat
[2022-05-19 09:03:32] [INFO ] After 682ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 09:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:03:32] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:03:32] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:03:32] [INFO ] [Nat]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-19 09:03:32] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 24 ms returned sat
[2022-05-19 09:03:33] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:03:33] [INFO ] After 389ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:03:33] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-19 09:03:34] [INFO ] After 1463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 130 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 260 place count 1093 transition count 2064
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 262 place count 1092 transition count 2063
Applied a total of 262 rules in 137 ms. Remains 1092 /1223 variables (removed 131) and now considering 2063/2194 (removed 131) transitions.
[2022-05-19 09:03:34] [INFO ] Flow matrix only has 2054 transitions (discarded 9 similar events)
// Phase 1: matrix 2054 rows 1092 cols
[2022-05-19 09:03:34] [INFO ] Computed 142 place invariants in 51 ms
[2022-05-19 09:03:35] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1092/1223 places, 2063/2194 transitions.
Finished random walk after 193 steps, including 15 resets, run visited all 1 properties in 7 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1223 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 31 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2022-05-19 09:03:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:35] [INFO ] Computed 142 place invariants in 33 ms
[2022-05-19 09:03:37] [INFO ] Dead Transitions using invariants and state equation in 1657 ms found 0 transitions.
[2022-05-19 09:03:37] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:37] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:03:38] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2022-05-19 09:03:38] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:38] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:03:46] [INFO ] Implicit Places using invariants and state equation in 7674 ms returned []
Implicit Place search using SMT with State Equation took 8913 ms to find 0 implicit places.
[2022-05-19 09:03:46] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:46] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:03:48] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1223 places, 2194/2194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203355 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203355 steps, saw 61051 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 09:03:51] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:03:51] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:03:51] [INFO ] [Real]Absence check using 136 positive place invariants in 40 ms returned sat
[2022-05-19 09:03:51] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 23 ms returned sat
[2022-05-19 09:03:52] [INFO ] After 652ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 09:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:03:52] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:03:52] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:03:52] [INFO ] [Nat]Absence check using 136 positive place invariants in 44 ms returned sat
[2022-05-19 09:03:52] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 22 ms returned sat
[2022-05-19 09:03:53] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:03:53] [INFO ] After 395ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:03:53] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-19 09:03:53] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 130 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 260 place count 1093 transition count 2064
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 262 place count 1092 transition count 2063
Applied a total of 262 rules in 112 ms. Remains 1092 /1223 variables (removed 131) and now considering 2063/2194 (removed 131) transitions.
[2022-05-19 09:03:54] [INFO ] Flow matrix only has 2054 transitions (discarded 9 similar events)
// Phase 1: matrix 2054 rows 1092 cols
[2022-05-19 09:03:54] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:03:55] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1092/1223 places, 2063/2194 transitions.
Finished random walk after 245 steps, including 19 resets, run visited all 1 properties in 3 ms. (steps per millisecond=81 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 912 ms.
Product exploration explored 100000 steps with 25000 reset in 931 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 64 place count 1223 transition count 2195
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 1223 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1222 transition count 2194
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1222 transition count 2194
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 133 place count 1222 transition count 2194
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 196 place count 1159 transition count 2131
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 259 place count 1159 transition count 2131
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 259 rules in 462 ms. Remains 1159 /1223 variables (removed 64) and now considering 2131/2194 (removed 63) transitions.
[2022-05-19 09:03:58] [INFO ] Flow matrix only has 2122 transitions (discarded 9 similar events)
// Phase 1: matrix 2122 rows 1159 cols
[2022-05-19 09:03:58] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:04:00] [INFO ] Dead Transitions using invariants and state equation in 1983 ms found 0 transitions.
[2022-05-19 09:04:00] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-19 09:04:00] [INFO ] Flow matrix only has 2122 transitions (discarded 9 similar events)
// Phase 1: matrix 2122 rows 1159 cols
[2022-05-19 09:04:00] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:04:01] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1159/1223 places, 2131/2194 transitions.
Finished structural reductions, in 1 iterations. Remains : 1159/1223 places, 2131/2194 transitions.
Product exploration explored 100000 steps with 25000 reset in 3290 ms.
Product exploration explored 100000 steps with 25000 reset in 3275 ms.
Built C files in :
/tmp/ltsmin8398782524747699022
[2022-05-19 09:04:08] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8398782524747699022
Running compilation step : cd /tmp/ltsmin8398782524747699022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8398782524747699022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8398782524747699022;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 38 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2022-05-19 09:04:11] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:04:11] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:04:13] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
[2022-05-19 09:04:13] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:04:13] [INFO ] Computed 142 place invariants in 51 ms
[2022-05-19 09:04:14] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2022-05-19 09:04:14] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:04:14] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:04:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:04:21] [INFO ] Implicit Places using invariants and state equation in 7417 ms returned []
Implicit Place search using SMT with State Equation took 8597 ms to find 0 implicit places.
[2022-05-19 09:04:21] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:04:21] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:04:23] [INFO ] Dead Transitions using invariants and state equation in 1616 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1223 places, 2194/2194 transitions.
Built C files in :
/tmp/ltsmin8857546430232175058
[2022-05-19 09:04:23] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8857546430232175058
Running compilation step : cd /tmp/ltsmin8857546430232175058;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8857546430232175058;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8857546430232175058;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 09:04:26] [INFO ] Flatten gal took : 101 ms
[2022-05-19 09:04:26] [INFO ] Flatten gal took : 98 ms
[2022-05-19 09:04:26] [INFO ] Time to serialize gal into /tmp/LTL11726064096293702265.gal : 11 ms
[2022-05-19 09:04:26] [INFO ] Time to serialize properties into /tmp/LTL15726095491301481165.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11726064096293702265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15726095491301481165.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1172606...268
Read 1 LTL properties
Checking formula 0 : !(((X(F(F(X(X("(NotifyEventEndOfCheckSourcesB_0<1)"))))))||(G("(QueueJobE_0>=1)"))))
Formula 0 simplified : !(XFXX"(NotifyEventEndOfCheckSourcesB_0<1)" | G"(QueueJobE_0>=1)")
Detected timeout of ITS tools.
[2022-05-19 09:04:41] [INFO ] Flatten gal took : 97 ms
[2022-05-19 09:04:41] [INFO ] Applying decomposition
[2022-05-19 09:04:42] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4542151508431701876.txt' '-o' '/tmp/graph4542151508431701876.bin' '-w' '/tmp/graph4542151508431701876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4542151508431701876.bin' '-l' '-1' '-v' '-w' '/tmp/graph4542151508431701876.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:04:42] [INFO ] Decomposing Gal with order
[2022-05-19 09:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:04:42] [INFO ] Removed a total of 2171 redundant transitions.
[2022-05-19 09:04:42] [INFO ] Flatten gal took : 342 ms
[2022-05-19 09:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 50 ms.
[2022-05-19 09:04:42] [INFO ] Time to serialize gal into /tmp/LTL15647452254345631330.gal : 19 ms
[2022-05-19 09:04:42] [INFO ] Time to serialize properties into /tmp/LTL3913714300013480835.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15647452254345631330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3913714300013480835.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1564745...246
Read 1 LTL properties
Checking formula 0 : !(((X(F(F(X(X("(i30.i5.u52.NotifyEventEndOfCheckSourcesB_0<1)"))))))||(G("(i0.u27.QueueJobE_0>=1)"))))
Formula 0 simplified : !(XFXX"(i30.i5.u52.NotifyEventEndOfCheckSourcesB_0<1)" | G"(i0.u27.QueueJobE_0>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10314400947945299148
[2022-05-19 09:04:57] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10314400947945299148
Running compilation step : cd /tmp/ltsmin10314400947945299148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10314400947945299148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10314400947945299148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-10 finished in 106838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1))) U (p2||G(!p0))))'
Support contains 65 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1224 transition count 2131
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1160 transition count 2130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1159 transition count 2130
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 130 place count 1159 transition count 2065
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 260 place count 1094 transition count 2065
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 262 place count 1093 transition count 2064
Applied a total of 262 rules in 276 ms. Remains 1093 /1224 variables (removed 131) and now considering 2064/2195 (removed 131) transitions.
[2022-05-19 09:05:01] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:01] [INFO ] Computed 142 place invariants in 84 ms
[2022-05-19 09:05:02] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
[2022-05-19 09:05:02] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:02] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:05:03] [INFO ] Implicit Places using invariants in 834 ms returned []
[2022-05-19 09:05:03] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:03] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:05:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:05:08] [INFO ] Implicit Places using invariants and state equation in 5450 ms returned []
Implicit Place search using SMT with State Equation took 6285 ms to find 0 implicit places.
[2022-05-19 09:05:08] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-19 09:05:08] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:08] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:05:10] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1224 places, 2064/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1224 places, 2064/2195 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p2)), (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s380 1), p0:(GEQ s375 1), p1:(OR (AND (GEQ s0 1) (GEQ s80 1) (GEQ s311 1)) (AND (GEQ s0 1) (GEQ s100 1) (GEQ s311 1)) (AND (GEQ s0 1) (GEQ s70 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 55 steps with 3 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-11 finished in 9436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(!p0) U (p1 U !X(F(p2)))))&&F(p1))))'
Support contains 14 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Applied a total of 0 rules in 29 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
[2022-05-19 09:05:10] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:05:10] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:05:12] [INFO ] Dead Transitions using invariants and state equation in 1731 ms found 0 transitions.
[2022-05-19 09:05:12] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:05:12] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 09:05:13] [INFO ] Implicit Places using invariants in 987 ms returned []
[2022-05-19 09:05:13] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:05:13] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:05:21] [INFO ] Implicit Places using invariants and state equation in 8194 ms returned []
Implicit Place search using SMT with State Equation took 9191 ms to find 0 implicit places.
[2022-05-19 09:05:21] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 09:05:21] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:05:23] [INFO ] Dead Transitions using invariants and state equation in 1699 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1224 places, 2195/2195 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) p2), (NOT p1), (AND p2 p0), p2, (AND p0 p2), true, p2, p2]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s1222 1), p0:(OR (AND (GEQ s383 1) (GEQ s390 1) (GEQ s394 9)) (AND (GEQ s383 1) (GEQ s385 1) (GEQ s394 9)) (AND (GEQ s383 1) (GEQ s384 1) (GEQ s39...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 5 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-13 finished in 12942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 66 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:05:23] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:05:23] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:05:25] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
[2022-05-19 09:05:25] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:05:25] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:05:26] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2022-05-19 09:05:26] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:05:26] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:05:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:05:32] [INFO ] Implicit Places using invariants and state equation in 6799 ms returned []
Implicit Place search using SMT with State Equation took 7937 ms to find 0 implicit places.
[2022-05-19 09:05:32] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:05:33] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:05:34] [INFO ] Dead Transitions using invariants and state equation in 1714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-15 automaton TGBA Formula[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:(LT s379 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 16043 steps with 896 reset in 130 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-15 finished in 11646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(F(X(X(p0)))))||G(p1)))'
Found a CL insensitive property : PolyORBNT-COL-S10J60-LTLFireability-10
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 1158 transition count 2065
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 1094 transition count 2065
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 262 place count 1093 transition count 2064
Applied a total of 262 rules in 103 ms. Remains 1093 /1224 variables (removed 131) and now considering 2064/2195 (removed 131) transitions.
[2022-05-19 09:05:35] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:35] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 09:05:36] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
[2022-05-19 09:05:36] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:36] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:05:37] [INFO ] Implicit Places using invariants in 929 ms returned []
[2022-05-19 09:05:37] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:37] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:05:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:05:45] [INFO ] Implicit Places using invariants and state equation in 7994 ms returned []
Implicit Place search using SMT with State Equation took 8925 ms to find 0 implicit places.
[2022-05-19 09:05:45] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:45] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:05:46] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1093/1224 places, 2064/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1224 places, 2064/2195 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 1}, { cond=(NOT p1), acceptance={} source=6 dest: 3}]], initial=5, aps=[p0:(LT s376 1), p1:(GEQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 890 ms.
Product exploration explored 100000 steps with 25000 reset in 921 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 38 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1093 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 29 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2022-05-19 09:05:49] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:49] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:05:50] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
[2022-05-19 09:05:50] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:50] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:05:51] [INFO ] Implicit Places using invariants in 920 ms returned []
[2022-05-19 09:05:51] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:05:51] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:05:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:06:00] [INFO ] Implicit Places using invariants and state equation in 9222 ms returned []
Implicit Place search using SMT with State Equation took 10144 ms to find 0 implicit places.
[2022-05-19 09:06:00] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:00] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:06:01] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 2064/2064 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 904 ms.
Product exploration explored 100000 steps with 25000 reset in 935 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1093 transition count 2064
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 82 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2022-05-19 09:06:05] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:05] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 09:06:06] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
[2022-05-19 09:06:06] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-19 09:06:06] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:06] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:06:07] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1093 places, 2064/2064 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 2064/2064 transitions.
Product exploration explored 100000 steps with 25000 reset in 3095 ms.
Product exploration explored 100000 steps with 25000 reset in 3145 ms.
Built C files in :
/tmp/ltsmin2716753781837349207
[2022-05-19 09:06:13] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2716753781837349207
Running compilation step : cd /tmp/ltsmin2716753781837349207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2716753781837349207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2716753781837349207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Applied a total of 0 rules in 29 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
[2022-05-19 09:06:16] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:16] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 09:06:18] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
[2022-05-19 09:06:18] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:18] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:06:18] [INFO ] Implicit Places using invariants in 922 ms returned []
[2022-05-19 09:06:18] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:19] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 09:06:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:06:27] [INFO ] Implicit Places using invariants and state equation in 8378 ms returned []
Implicit Place search using SMT with State Equation took 9313 ms to find 0 implicit places.
[2022-05-19 09:06:27] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2022-05-19 09:06:27] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:06:28] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1093 places, 2064/2064 transitions.
Built C files in :
/tmp/ltsmin14400232321844659696
[2022-05-19 09:06:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14400232321844659696
Running compilation step : cd /tmp/ltsmin14400232321844659696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14400232321844659696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14400232321844659696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 09:06:31] [INFO ] Flatten gal took : 90 ms
[2022-05-19 09:06:31] [INFO ] Flatten gal took : 124 ms
[2022-05-19 09:06:31] [INFO ] Time to serialize gal into /tmp/LTL8885287949799970253.gal : 10 ms
[2022-05-19 09:06:31] [INFO ] Time to serialize properties into /tmp/LTL16843121227171835333.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8885287949799970253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16843121227171835333.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8885287...267
Read 1 LTL properties
Checking formula 0 : !(((X(F(F(X(X("(NotifyEventEndOfCheckSourcesB_0<1)"))))))||(G("(QueueJobE_0>=1)"))))
Formula 0 simplified : !(XFXX"(NotifyEventEndOfCheckSourcesB_0<1)" | G"(QueueJobE_0>=1)")
Detected timeout of ITS tools.
[2022-05-19 09:06:47] [INFO ] Flatten gal took : 91 ms
[2022-05-19 09:06:47] [INFO ] Applying decomposition
[2022-05-19 09:06:47] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5691672188114499549.txt' '-o' '/tmp/graph5691672188114499549.bin' '-w' '/tmp/graph5691672188114499549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5691672188114499549.bin' '-l' '-1' '-v' '-w' '/tmp/graph5691672188114499549.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:06:47] [INFO ] Decomposing Gal with order
[2022-05-19 09:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:06:47] [INFO ] Removed a total of 1972 redundant transitions.
[2022-05-19 09:06:47] [INFO ] Flatten gal took : 219 ms
[2022-05-19 09:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 27 ms.
[2022-05-19 09:06:47] [INFO ] Time to serialize gal into /tmp/LTL3746086646243761938.gal : 14 ms
[2022-05-19 09:06:47] [INFO ] Time to serialize properties into /tmp/LTL8511320302540407824.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3746086646243761938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8511320302540407824.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3746086...245
Read 1 LTL properties
Checking formula 0 : !(((X(F(F(X(X("(i20.u37.NotifyEventEndOfCheckSourcesB_0<1)"))))))||(G("(i0.u0.QueueJobE_0>=1)"))))
Formula 0 simplified : !(XFXX"(i20.u37.NotifyEventEndOfCheckSourcesB_0<1)" | G"(i0.u0.QueueJobE_0>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4551135680453267809
[2022-05-19 09:07:02] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4551135680453267809
Running compilation step : cd /tmp/ltsmin4551135680453267809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4551135680453267809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4551135680453267809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBNT-COL-S10J60-LTLFireability-10 finished in 90830 ms.
[2022-05-19 09:07:06] [INFO ] Flatten gal took : 120 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5545882903234021111
[2022-05-19 09:07:06] [INFO ] Too many transitions (2195) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:07:06] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5545882903234021111
Running compilation step : cd /tmp/ltsmin5545882903234021111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 09:07:06] [INFO ] Applying decomposition
[2022-05-19 09:07:06] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7556803920028687294.txt' '-o' '/tmp/graph7556803920028687294.bin' '-w' '/tmp/graph7556803920028687294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7556803920028687294.bin' '-l' '-1' '-v' '-w' '/tmp/graph7556803920028687294.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:07:06] [INFO ] Decomposing Gal with order
[2022-05-19 09:07:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:07:06] [INFO ] Removed a total of 1991 redundant transitions.
[2022-05-19 09:07:06] [INFO ] Flatten gal took : 230 ms
[2022-05-19 09:07:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 626 labels/synchronizations in 42 ms.
[2022-05-19 09:07:06] [INFO ] Time to serialize gal into /tmp/LTLFireability5202070774116668162.gal : 36 ms
[2022-05-19 09:07:06] [INFO ] Time to serialize properties into /tmp/LTLFireability12684834924503029757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5202070774116668162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12684834924503029757.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((F(G("(i10.u24.QueueJobE_0<1)"))))
Formula 0 simplified : !FG"(i10.u24.QueueJobE_0<1)"
Compilation finished in 5229 ms.
Running link step : cd /tmp/ltsmin5545882903234021111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5545882903234021111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 09:29:31] [INFO ] Applying decomposition
[2022-05-19 09:29:31] [INFO ] Flatten gal took : 201 ms
[2022-05-19 09:29:31] [INFO ] Decomposing Gal with order
[2022-05-19 09:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:29:32] [INFO ] Removed a total of 9596 redundant transitions.
[2022-05-19 09:29:32] [INFO ] Flatten gal took : 513 ms
[2022-05-19 09:29:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2022-05-19 09:29:32] [INFO ] Time to serialize gal into /tmp/LTLFireability3895154278008857157.gal : 59 ms
[2022-05-19 09:29:32] [INFO ] Time to serialize properties into /tmp/LTLFireability2837344420932485535.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3895154278008857157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2837344420932485535.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((F(G("(QueueJobE.QueueJobE_0<1)"))))
Formula 0 simplified : !FG"(QueueJobE.QueueJobE_0<1)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5545882903234021111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5545882903234021111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(<>(X(X((LTLAPp1==true))))))||[](!(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 2385 ms.
FORMULA PolyORBNT-COL-S10J60-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5545882903234021111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 09:52:04] [INFO ] Flatten gal took : 1474 ms
[2022-05-19 09:52:07] [INFO ] Input system was already deterministic with 2195 transitions.
[2022-05-19 09:52:07] [INFO ] Transformed 1224 places.
[2022-05-19 09:52:07] [INFO ] Transformed 2195 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 09:52:38] [INFO ] Time to serialize gal into /tmp/LTLFireability12787307633399845227.gal : 32 ms
[2022-05-19 09:52:38] [INFO ] Time to serialize properties into /tmp/LTLFireability2483258727914786171.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12787307633399845227.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2483258727914786171.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(QueueJobE_0<1)"))))
Formula 0 simplified : !FG"(QueueJobE_0<1)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J60, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017200796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;