About the Execution of ITS-Tools for PolyORBNT-PT-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.779 | 3600000.00 | 5275949.00 | 389965.70 | FF?TT?TFTFTFTTFF | 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-165277017300851.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-PT-S10J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300851
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 21K Apr 30 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 30 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 66K Apr 30 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 293K Apr 30 03:44 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 7.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13M 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-PT-S10J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652968977485
Running Version 202205111006
[2022-05-19 14:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 14:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:02:59] [INFO ] Load time of PNML (sax parser for PT used): 791 ms
[2022-05-19 14:02:59] [INFO ] Transformed 474 places.
[2022-05-19 14:02:59] [INFO ] Transformed 11760 transitions.
[2022-05-19 14:02:59] [INFO ] Parsed PT model containing 474 places and 11760 transitions in 989 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Applied a total of 10 rules in 113 ms. Remains 464 /474 variables (removed 10) and now considering 1650/1650 (removed 0) transitions.
[2022-05-19 14:02:59] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 464 cols
[2022-05-19 14:03:00] [INFO ] Computed 62 place invariants in 85 ms
[2022-05-19 14:03:01] [INFO ] Dead Transitions using invariants and state equation in 1192 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 14:03:01] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:01] [INFO ] Computed 62 place invariants in 31 ms
[2022-05-19 14:03:01] [INFO ] Implicit Places using invariants in 472 ms returned []
[2022-05-19 14:03:01] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:01] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:03:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:03:04] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 3427 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 21 ms. Remains 464 /464 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 464/474 places, 1035/1650 transitions.
Support contains 39 out of 464 places after structural reductions.
[2022-05-19 14:03:04] [INFO ] Flatten gal took : 153 ms
[2022-05-19 14:03:05] [INFO ] Flatten gal took : 105 ms
[2022-05-19 14:03:05] [INFO ] Input system was already deterministic with 1035 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2022-05-19 14:03:06] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:06] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-19 14:03:06] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 14:03:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2022-05-19 14:03:06] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 22 ms returned sat
[2022-05-19 14:03:08] [INFO ] After 2105ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2022-05-19 14:03:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:03:10] [INFO ] After 1249ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :10
[2022-05-19 14:03:19] [INFO ] Deduced a trap composed of 229 places in 279 ms of which 3 ms to minimize.
[2022-05-19 14:03:19] [INFO ] Deduced a trap composed of 225 places in 281 ms of which 1 ms to minimize.
[2022-05-19 14:03:20] [INFO ] Deduced a trap composed of 219 places in 292 ms of which 2 ms to minimize.
[2022-05-19 14:03:20] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 2 ms to minimize.
[2022-05-19 14:03:20] [INFO ] Deduced a trap composed of 213 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:03:21] [INFO ] Deduced a trap composed of 207 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:03:21] [INFO ] Deduced a trap composed of 221 places in 224 ms of which 0 ms to minimize.
[2022-05-19 14:03:21] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:03:21] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:03:22] [INFO ] Deduced a trap composed of 221 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:03:22] [INFO ] Deduced a trap composed of 219 places in 250 ms of which 0 ms to minimize.
[2022-05-19 14:03:22] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:03:23] [INFO ] Deduced a trap composed of 223 places in 251 ms of which 1 ms to minimize.
[2022-05-19 14:03:23] [INFO ] Deduced a trap composed of 223 places in 253 ms of which 1 ms to minimize.
[2022-05-19 14:03:23] [INFO ] Deduced a trap composed of 223 places in 251 ms of which 1 ms to minimize.
[2022-05-19 14:03:24] [INFO ] Deduced a trap composed of 223 places in 253 ms of which 1 ms to minimize.
[2022-05-19 14:03:24] [INFO ] Deduced a trap composed of 215 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:03:24] [INFO ] Deduced a trap composed of 225 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:03:25] [INFO ] Deduced a trap composed of 225 places in 228 ms of which 2 ms to minimize.
[2022-05-19 14:03:25] [INFO ] Deduced a trap composed of 225 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:03:25] [INFO ] Deduced a trap composed of 225 places in 265 ms of which 1 ms to minimize.
[2022-05-19 14:03:25] [INFO ] Deduced a trap composed of 215 places in 225 ms of which 1 ms to minimize.
[2022-05-19 14:03:26] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:03:26] [INFO ] Deduced a trap composed of 216 places in 253 ms of which 0 ms to minimize.
[2022-05-19 14:03:26] [INFO ] Deduced a trap composed of 219 places in 226 ms of which 0 ms to minimize.
[2022-05-19 14:03:27] [INFO ] Deduced a trap composed of 215 places in 255 ms of which 0 ms to minimize.
[2022-05-19 14:03:27] [INFO ] Deduced a trap composed of 209 places in 250 ms of which 0 ms to minimize.
[2022-05-19 14:03:27] [INFO ] Deduced a trap composed of 217 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:03:28] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:03:28] [INFO ] Deduced a trap composed of 225 places in 248 ms of which 0 ms to minimize.
[2022-05-19 14:03:28] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2022-05-19 14:03:29] [INFO ] Deduced a trap composed of 217 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:03:29] [INFO ] Deduced a trap composed of 225 places in 224 ms of which 1 ms to minimize.
[2022-05-19 14:03:29] [INFO ] Deduced a trap composed of 215 places in 251 ms of which 1 ms to minimize.
[2022-05-19 14:03:29] [INFO ] Deduced a trap composed of 219 places in 261 ms of which 1 ms to minimize.
[2022-05-19 14:03:30] [INFO ] Deduced a trap composed of 227 places in 248 ms of which 0 ms to minimize.
[2022-05-19 14:03:30] [INFO ] Deduced a trap composed of 219 places in 246 ms of which 1 ms to minimize.
[2022-05-19 14:03:30] [INFO ] Deduced a trap composed of 205 places in 250 ms of which 1 ms to minimize.
[2022-05-19 14:03:31] [INFO ] Deduced a trap composed of 217 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:03:31] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 12121 ms
[2022-05-19 14:03:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:03:31] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 20 out of 464 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 50 place count 439 transition count 987
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 96 place count 416 transition count 987
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 415 transition count 986
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 415 transition count 986
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 102 place count 413 transition count 984
Applied a total of 102 rules in 154 ms. Remains 413 /464 variables (removed 51) and now considering 984/1035 (removed 51) transitions.
[2022-05-19 14:03:31] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 14:03:31] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:03:32] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/464 places, 984/1035 transitions.
Finished random walk after 1412 steps, including 104 resets, run visited all 10 properties in 33 ms. (steps per millisecond=42 )
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(p0)||F((X(p1)||p2)))))'
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Applied a total of 0 rules in 19 ms. Remains 464 /464 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 14:03:32] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:32] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:03:33] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2022-05-19 14:03:33] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:33] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:03:33] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-05-19 14:03:33] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:33] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:03:37] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 4099 ms to find 0 implicit places.
[2022-05-19 14:03:37] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 14:03:37] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:03:38] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/464 places, 1035/1035 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GT s426 s23) (GT s66 s158)), p0:(GT s215 s66), p1:(GT s66 s158)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 200 steps with 16 reset in 8 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-00 finished in 5740 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 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 30 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:03:38] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:03:38] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:03:38] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
[2022-05-19 14:03:38] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:03:38] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:03:39] [INFO ] Implicit Places using invariants in 440 ms returned []
[2022-05-19 14:03:39] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:03:39] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:03:41] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
[2022-05-19 14:03:41] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:03:41] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:03:42] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-01 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:(LEQ 3 s281)], 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 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-01 finished in 3840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 985
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
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 106 place count 411 transition count 982
Applied a total of 106 rules in 94 ms. Remains 411 /464 variables (removed 53) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 14:03:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:42] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:03:42] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
[2022-05-19 14:03:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:42] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:03:43] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-05-19 14:03:43] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:43] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:03:45] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
[2022-05-19 14:03:45] [INFO ] Redundant transitions in 74 ms returned []
[2022-05-19 14:03:45] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:45] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:03:45] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/464 places, 982/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/464 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s270 s397)], 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 7119 reset in 985 ms.
Product exploration explored 100000 steps with 7159 reset in 922 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 109 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 38 ms :[(NOT p0)]
Finished random walk after 41 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 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 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 78 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 14:03:48] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:48] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:03:49] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
[2022-05-19 14:03:49] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:49] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:03:49] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-19 14:03:49] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:49] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:03:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:03:51] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned []
Implicit Place search using SMT with State Equation took 2709 ms to find 0 implicit places.
[2022-05-19 14:03:51] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-19 14:03:51] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:51] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:03:52] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 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 97 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 25 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7167 reset in 811 ms.
Product exploration explored 100000 steps with 7069 reset in 831 ms.
Built C files in :
/tmp/ltsmin6108279943043812603
[2022-05-19 14:03:54] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 14:03:54] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:03:54] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 14:03:54] [INFO ] Computation of Complete enable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:03:54] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 14:03:54] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:03:54] [INFO ] Built C files in 354ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6108279943043812603
Running compilation step : cd /tmp/ltsmin6108279943043812603;'/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/ltsmin6108279943043812603;'/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/ltsmin6108279943043812603;'/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 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 24 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 14:03:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:57] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:03:58] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
[2022-05-19 14:03:58] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:58] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:03:58] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-05-19 14:03:58] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:03:58] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:03:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:04:00] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2022-05-19 14:04:00] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-19 14:04:00] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:04:00] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 14:04:01] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Built C files in :
/tmp/ltsmin15136737250561901241
[2022-05-19 14:04:01] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 14:04:01] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:04:01] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 14:04:01] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:04:01] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 14:04:01] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:04:01] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15136737250561901241
Running compilation step : cd /tmp/ltsmin15136737250561901241;'/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/ltsmin15136737250561901241;'/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/ltsmin15136737250561901241;'/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 14:04:04] [INFO ] Flatten gal took : 94 ms
[2022-05-19 14:04:04] [INFO ] Flatten gal took : 68 ms
[2022-05-19 14:04:04] [INFO ] Time to serialize gal into /tmp/LTL16754680438548912650.gal : 27 ms
[2022-05-19 14:04:05] [INFO ] Time to serialize properties into /tmp/LTL12601395659189538668.ltl : 252 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/LTL16754680438548912650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12601395659189538668.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/LTL1675468...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G("(NotifyEventJobQueuedE_1<=mo3)")))))
Formula 0 simplified : !XFG"(NotifyEventJobQueuedE_1<=mo3)"
Detected timeout of ITS tools.
[2022-05-19 14:04:20] [INFO ] Flatten gal took : 86 ms
[2022-05-19 14:04:20] [INFO ] Applying decomposition
[2022-05-19 14:04:20] [INFO ] Flatten gal took : 62 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/graph4166386813212059851.txt' '-o' '/tmp/graph4166386813212059851.bin' '-w' '/tmp/graph4166386813212059851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4166386813212059851.bin' '-l' '-1' '-v' '-w' '/tmp/graph4166386813212059851.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:04:20] [INFO ] Decomposing Gal with order
[2022-05-19 14:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:04:20] [INFO ] Removed a total of 699 redundant transitions.
[2022-05-19 14:04:21] [INFO ] Flatten gal took : 186 ms
[2022-05-19 14:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 19 ms.
[2022-05-19 14:04:21] [INFO ] Time to serialize gal into /tmp/LTL9564186653804720494.gal : 13 ms
[2022-05-19 14:04:21] [INFO ] Time to serialize properties into /tmp/LTL12877465283143637166.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/LTL9564186653804720494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12877465283143637166.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/LTL9564186...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G("(gu16.NotifyEventJobQueuedE_1<=gu16.mo3)")))))
Formula 0 simplified : !XFG"(gu16.NotifyEventJobQueuedE_1<=gu16.mo3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10943201790784771352
[2022-05-19 14:04:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10943201790784771352
Running compilation step : cd /tmp/ltsmin10943201790784771352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1864 ms.
Running link step : cd /tmp/ltsmin10943201790784771352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10943201790784771352;'/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(<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-02 finished in 69299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 12 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 33 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:04:51] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:04:51] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:04:52] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2022-05-19 14:04:52] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:04:52] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:04:52] [INFO ] Implicit Places using invariants in 457 ms returned []
[2022-05-19 14:04:52] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:04:52] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:04:54] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
[2022-05-19 14:04:54] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:04:54] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:04:55] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s38 s73 s131 s171 s185 s261 s328 s369 s373 s436) s114), p0:(LEQ s114 s448)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 836 ms.
Product exploration explored 100000 steps with 33333 reset in 796 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 (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-04 finished in 5649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 985
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
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 2 with 4 rules applied. Total rules applied 106 place count 411 transition count 982
Applied a total of 106 rules in 80 ms. Remains 411 /464 variables (removed 53) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 14:04:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:04:57] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:04:57] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
[2022-05-19 14:04:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:04:57] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:04:58] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-05-19 14:04:58] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:04:58] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:05:00] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2022-05-19 14:05:00] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-19 14:05:00] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:00] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:05:00] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/464 places, 982/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/464 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-05 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:(LEQ s259 (ADD s40 s44 s106 s115 s183 s199 s256 s311 s391 s407))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7374 reset in 906 ms.
Product exploration explored 100000 steps with 7400 reset in 894 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 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=11 )
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 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 25 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 14:05:03] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:03] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:05:03] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
[2022-05-19 14:05:03] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:03] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:05:04] [INFO ] Implicit Places using invariants in 418 ms returned []
[2022-05-19 14:05:04] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:04] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 14:05:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:05:06] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2022-05-19 14:05:06] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 14:05:06] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:06] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:05:06] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 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 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7359 reset in 863 ms.
Product exploration explored 100000 steps with 7349 reset in 874 ms.
Built C files in :
/tmp/ltsmin17540313752860086845
[2022-05-19 14:05:09] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 14:05:09] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:05:09] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 14:05:09] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:05:09] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 14:05:09] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:05:09] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17540313752860086845
Running compilation step : cd /tmp/ltsmin17540313752860086845;'/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/ltsmin17540313752860086845;'/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/ltsmin17540313752860086845;'/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 11 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 28 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 14:05:12] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:12] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:05:12] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
[2022-05-19 14:05:12] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:12] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:05:13] [INFO ] Implicit Places using invariants in 422 ms returned []
[2022-05-19 14:05:13] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:13] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:05:15] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2469 ms to find 0 implicit places.
[2022-05-19 14:05:15] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-19 14:05:15] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 14:05:15] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:05:15] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Built C files in :
/tmp/ltsmin4638098393965672553
[2022-05-19 14:05:15] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 14:05:15] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:05:15] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 14:05:15] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:05:15] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 14:05:15] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:05:15] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4638098393965672553
Running compilation step : cd /tmp/ltsmin4638098393965672553;'/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/ltsmin4638098393965672553;'/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/ltsmin4638098393965672553;'/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 14:05:19] [INFO ] Flatten gal took : 65 ms
[2022-05-19 14:05:19] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:05:19] [INFO ] Time to serialize gal into /tmp/LTL4400021559939785281.gal : 8 ms
[2022-05-19 14:05:19] [INFO ] Time to serialize properties into /tmp/LTL9858702560027219867.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/LTL4400021559939785281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9858702560027219867.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/LTL4400021...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(Check_Sources_B_1<=((((DataOnSrc_2+DataOnSrc_4)+(DataOnSrc_3+DataOnSrc_10))+((DataOnSrc_9+DataOnSrc_8)+(DataOnSrc_7+DataOnSrc...193
Formula 0 simplified : !GF"(Check_Sources_B_1<=((((DataOnSrc_2+DataOnSrc_4)+(DataOnSrc_3+DataOnSrc_10))+((DataOnSrc_9+DataOnSrc_8)+(DataOnSrc_7+DataOnSrc_6...187
Detected timeout of ITS tools.
[2022-05-19 14:05:34] [INFO ] Flatten gal took : 54 ms
[2022-05-19 14:05:34] [INFO ] Applying decomposition
[2022-05-19 14:05:34] [INFO ] Flatten gal took : 53 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/graph9871240993239843955.txt' '-o' '/tmp/graph9871240993239843955.bin' '-w' '/tmp/graph9871240993239843955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9871240993239843955.bin' '-l' '-1' '-v' '-w' '/tmp/graph9871240993239843955.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:05:34] [INFO ] Decomposing Gal with order
[2022-05-19 14:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:05:34] [INFO ] Removed a total of 738 redundant transitions.
[2022-05-19 14:05:34] [INFO ] Flatten gal took : 136 ms
[2022-05-19 14:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 439 labels/synchronizations in 24 ms.
[2022-05-19 14:05:34] [INFO ] Time to serialize gal into /tmp/LTL1014887833827872658.gal : 166 ms
[2022-05-19 14:05:34] [INFO ] Time to serialize properties into /tmp/LTL7407359311001270256.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/LTL1014887833827872658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7407359311001270256.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/LTL1014887...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu17.Check_Sources_B_1<=((((gu17.DataOnSrc_2+gu17.DataOnSrc_4)+(gu17.DataOnSrc_3+gu17.DataOnSrc_10))+((gu17.DataOnSrc_9+gu17....248
Formula 0 simplified : !GF"(gu17.Check_Sources_B_1<=((((gu17.DataOnSrc_2+gu17.DataOnSrc_4)+(gu17.DataOnSrc_3+gu17.DataOnSrc_10))+((gu17.DataOnSrc_9+gu17.Da...242
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18165836342644785801
[2022-05-19 14:05:49] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18165836342644785801
Running compilation step : cd /tmp/ltsmin18165836342644785801;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1873 ms.
Running link step : cd /tmp/ltsmin18165836342644785801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18165836342644785801;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-05 finished in 67975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(X(G(p0))))))))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 983
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 2 with 4 rules applied. Total rules applied 108 place count 410 transition count 981
Applied a total of 108 rules in 85 ms. Remains 410 /464 variables (removed 54) and now considering 981/1035 (removed 54) transitions.
[2022-05-19 14:06:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:05] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:06:05] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
[2022-05-19 14:06:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:05] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:06:06] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-05-19 14:06:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:06] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:06:09] [INFO ] Implicit Places using invariants and state equation in 3345 ms returned []
Implicit Place search using SMT with State Equation took 3791 ms to find 0 implicit places.
[2022-05-19 14:06:09] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-19 14:06:09] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:09] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:06:09] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/464 places, 981/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/464 places, 981/1035 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s127)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-07 finished in 4884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((false U true)))))'
Support contains 0 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 983
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 2 with 4 rules applied. Total rules applied 108 place count 410 transition count 981
Applied a total of 108 rules in 81 ms. Remains 410 /464 variables (removed 54) and now considering 981/1035 (removed 54) transitions.
[2022-05-19 14:06:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:10] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 14:06:10] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
[2022-05-19 14:06:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:10] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:06:10] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-05-19 14:06:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:10] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:06:14] [INFO ] Implicit Places using invariants and state equation in 3505 ms returned []
Implicit Place search using SMT with State Equation took 3931 ms to find 0 implicit places.
[2022-05-19 14:06:14] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-19 14:06:14] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 14:06:14] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:06:14] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/464 places, 981/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/464 places, 981/1035 transitions.
Stuttering acceptance computed with spot in 14 ms :[false]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-08 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-08 finished in 5026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))||G((p2 U false))))'
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 33 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:06:14] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:15] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 14:06:15] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2022-05-19 14:06:15] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:15] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 14:06:16] [INFO ] Implicit Places using invariants in 447 ms returned []
[2022-05-19 14:06:16] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:16] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 14:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:06:19] [INFO ] Implicit Places using invariants and state equation in 3048 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
[2022-05-19 14:06:19] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:19] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 14:06:19] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ s214 s401) (LEQ 2 s66)), p1:(LEQ s114 s448)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 762 ms.
Product exploration explored 100000 steps with 50000 reset in 786 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 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-13 finished in 6689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(X(p0))&&(X(X(!p0))||p1))))))'
Support contains 3 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 20 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 14:06:21] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:21] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:06:22] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
[2022-05-19 14:06:22] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:22] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 14:06:22] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-05-19 14:06:22] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:22] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 14:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:06:25] [INFO ] Implicit Places using invariants and state equation in 2481 ms returned []
Implicit Place search using SMT with State Equation took 2939 ms to find 0 implicit places.
[2022-05-19 14:06:25] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 14:06:25] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 14:06:25] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s352), p0:(LEQ s145 s214)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-14 finished in 4507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-19 14:06:26] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8425914933445552024
[2022-05-19 14:06:26] [INFO ] Computing symmetric may disable matrix : 1035 transitions.
[2022-05-19 14:06:26] [INFO ] Applying decomposition
[2022-05-19 14:06:26] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:06:26] [INFO ] Computing symmetric may enable matrix : 1035 transitions.
[2022-05-19 14:06:26] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:06:26] [INFO ] Flatten gal took : 49 ms
[2022-05-19 14:06:26] [INFO ] Computing Do-Not-Accords matrix : 1035 transitions.
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/graph12050864327655555420.txt' '-o' '/tmp/graph12050864327655555420.bin' '-w' '/tmp/graph12050864327655555420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12050864327655555420.bin' '-l' '-1' '-v' '-w' '/tmp/graph12050864327655555420.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:06:26] [INFO ] Decomposing Gal with order
[2022-05-19 14:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:06:26] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:06:26] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8425914933445552024
Running compilation step : cd /tmp/ltsmin8425914933445552024;'/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 14:06:26] [INFO ] Removed a total of 735 redundant transitions.
[2022-05-19 14:06:26] [INFO ] Flatten gal took : 108 ms
[2022-05-19 14:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 652 labels/synchronizations in 29 ms.
[2022-05-19 14:06:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality10661476691815966094.gal : 7 ms
[2022-05-19 14:06:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality3815130065047979590.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/LTLCardinality10661476691815966094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3815130065047979590.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((X(F(G("(gi0.gi0.gu35.NotifyEventJobQueuedE_1<=gi0.gi0.gu35.mo3)")))))
Formula 0 simplified : !XFG"(gi0.gi0.gu35.NotifyEventJobQueuedE_1<=gi0.gi0.gu35.mo3)"
Compilation finished in 3721 ms.
Running link step : cd /tmp/ltsmin8425914933445552024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin8425914933445552024;'/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(<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.068: LTL layer: formula: X(<>([]((LTLAPp0==true))))
pins2lts-mc-linux64( 5/ 8), 0.068: "X(<>([]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.068: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.164: There are 1038 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.164: State length is 465, there are 1039 groups
pins2lts-mc-linux64( 0/ 8), 0.164: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.164: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.164: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.164: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.199: [Blue] ~18 levels ~960 states ~4056 transitions
pins2lts-mc-linux64( 2/ 8), 0.230: [Blue] ~17 levels ~1920 states ~7992 transitions
pins2lts-mc-linux64( 7/ 8), 0.330: [Blue] ~31 levels ~3840 states ~15752 transitions
pins2lts-mc-linux64( 4/ 8), 0.458: [Blue] ~31 levels ~7680 states ~22504 transitions
pins2lts-mc-linux64( 0/ 8), 0.730: [Blue] ~31 levels ~15360 states ~39960 transitions
pins2lts-mc-linux64( 7/ 8), 1.230: [Blue] ~31 levels ~30720 states ~79304 transitions
pins2lts-mc-linux64( 7/ 8), 2.191: [Blue] ~31 levels ~61440 states ~150576 transitions
pins2lts-mc-linux64( 2/ 8), 3.942: [Blue] ~31 levels ~122880 states ~306680 transitions
pins2lts-mc-linux64( 0/ 8), 7.217: [Blue] ~31 levels ~245760 states ~635128 transitions
pins2lts-mc-linux64( 0/ 8), 13.409: [Blue] ~31 levels ~491520 states ~1276328 transitions
pins2lts-mc-linux64( 4/ 8), 24.959: [Blue] ~31 levels ~983040 states ~2547200 transitions
pins2lts-mc-linux64( 7/ 8), 48.265: [Blue] ~31 levels ~1966080 states ~5120424 transitions
pins2lts-mc-linux64( 0/ 8), 93.722: [Blue] ~31 levels ~3932160 states ~10846960 transitions
pins2lts-mc-linux64( 0/ 8), 185.056: [Blue] ~31 levels ~7864320 states ~21820304 transitions
pins2lts-mc-linux64( 0/ 8), 369.410: [Blue] ~31 levels ~15728640 states ~43732288 transitions
pins2lts-mc-linux64( 0/ 8), 722.467: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 722.504:
pins2lts-mc-linux64( 0/ 8), 722.504: Explored 30397724 states 85588026 transitions, fanout: 2.816
pins2lts-mc-linux64( 0/ 8), 722.504: Total exploration time 722.320 sec (722.280 sec minimum, 722.301 sec on average)
pins2lts-mc-linux64( 0/ 8), 722.505: States per second: 42083, Transitions per second: 118490
pins2lts-mc-linux64( 0/ 8), 722.505:
pins2lts-mc-linux64( 0/ 8), 722.505: State space has 30399079 states, 8846413 are accepting
pins2lts-mc-linux64( 0/ 8), 722.505: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 722.505: blue states: 30397724 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 722.505: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 722.505: all-red states: 11831075 (38.92%), bogus 24 (0.00%)
pins2lts-mc-linux64( 0/ 8), 722.505:
pins2lts-mc-linux64( 0/ 8), 722.505: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 722.505:
pins2lts-mc-linux64( 0/ 8), 722.505: Queue width: 8B, total height: 248, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 722.505: Tree memory: 487.9MB, 16.8 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 722.505: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 722.505: Stored 1207 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 722.505: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 722.505: Est. total memory use: 487.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8425914933445552024;'/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(<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8425914933445552024;'/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(<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 14:27:40] [INFO ] Flatten gal took : 446 ms
[2022-05-19 14:27:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality13076290295416938931.gal : 41 ms
[2022-05-19 14:27:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality11840573585941784908.ltl : 5 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/LTLCardinality13076290295416938931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11840573585941784908.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/LTLCardina...290
Read 2 LTL properties
Checking formula 0 : !((X(F(G("(NotifyEventJobQueuedE_1<=mo3)")))))
Formula 0 simplified : !XFG"(NotifyEventJobQueuedE_1<=mo3)"
Detected timeout of ITS tools.
[2022-05-19 14:49:28] [INFO ] Flatten gal took : 282 ms
[2022-05-19 14:49:29] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 14:49:29] [INFO ] Transformed 464 places.
[2022-05-19 14:49:29] [INFO ] Transformed 1035 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 14:49:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality4405261192948745866.gal : 9 ms
[2022-05-19 14:49:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality9073194376611844231.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/LTLCardinality4405261192948745866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9073194376611844231.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/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G("(NotifyEventJobQueuedE_1<=mo3)")))))
Formula 0 simplified : !XFG"(NotifyEventJobQueuedE_1<=mo3)"
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-PT-S10J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017300851"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;