About the Execution of ITS-Tools for PolyORBNT-COL-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.632 | 3600000.00 | 11417473.00 | 290788.80 | FFF?TFFFFF?FFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945700668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S05J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945700668
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678932015092
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J80
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 02:00:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 02:00:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:00:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 02:00:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 02:00:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 491 ms
[2023-03-16 02:00:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 02:00:17] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-16 02:00:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 793 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 02:00:17] [INFO ] Computed 13 place invariants in 10 ms
[2023-03-16 02:00:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 02:00:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 02:00:17] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:00:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:00:17] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 02:00:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 5 ms to minimize.
[2023-03-16 02:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-16 02:00:17] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:00:17] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:00:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-16 02:00:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 02:00:17] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:00:17] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:00:18] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2023-03-16 02:00:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-16 02:00:18] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 02:00:18] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 39 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 36 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 35 transition count 27
Applied a total of 25 rules in 28 ms. Remains 35 /48 variables (removed 13) and now considering 27/38 (removed 11) transitions.
// Phase 1: matrix 27 rows 35 cols
[2023-03-16 02:00:18] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-16 02:00:18] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 35/48 places, 27/38 transitions.
Incomplete random walk after 10000 steps, including 1169 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 333 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 361 states, properties seen :0
Probabilistic random walk after 961 steps, saw 361 distinct states, run finished after 19 ms. (steps per millisecond=50 ) properties seen :0
Explored full state space saw : 361 states, properties seen :0
Exhaustive walk after 961 steps, saw 361 distinct states, run finished after 3 ms. (steps per millisecond=320 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2023-03-16 02:00:18] [INFO ] Flatten gal took : 19 ms
[2023-03-16 02:00:18] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-16 02:00:18] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 47 ms.
[2023-03-16 02:00:18] [INFO ] Unfolded 9 HLPN properties in 0 ms.
[2023-03-16 02:00:18] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-16 02:00:18] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-16 02:00:18] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-16 02:00:18] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 602 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1188 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1188 transition count 1694
Applied a total of 2 rules in 92 ms. Remains 1188 /1189 variables (removed 1) and now considering 1694/1695 (removed 1) transitions.
[2023-03-16 02:00:18] [INFO ] Flow matrix only has 1690 transitions (discarded 4 similar events)
// Phase 1: matrix 1690 rows 1188 cols
[2023-03-16 02:00:18] [INFO ] Computed 182 place invariants in 141 ms
[2023-03-16 02:00:20] [INFO ] Dead Transitions using invariants and state equation in 1660 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-16 02:00:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-16 02:00:20] [INFO ] Computed 182 place invariants in 92 ms
[2023-03-16 02:00:21] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-16 02:00:21] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:00:21] [INFO ] Invariant cache hit.
[2023-03-16 02:00:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:00:28] [INFO ] Implicit Places using invariants and state equation in 7436 ms returned []
Implicit Place search using SMT with State Equation took 8332 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1188/1189 places, 1599/1695 transitions.
Applied a total of 0 rules in 23 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10115 ms. Remains : 1188/1189 places, 1599/1695 transitions.
Support contains 602 out of 1188 places after structural reductions.
[2023-03-16 02:00:28] [INFO ] Flatten gal took : 165 ms
[2023-03-16 02:00:28] [INFO ] Flatten gal took : 127 ms
[2023-03-16 02:00:29] [INFO ] Input system was already deterministic with 1599 transitions.
Incomplete random walk after 10000 steps, including 680 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-16 02:00:29] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:00:29] [INFO ] Invariant cache hit.
[2023-03-16 02:00:29] [INFO ] [Real]Absence check using 175 positive place invariants in 72 ms returned sat
[2023-03-16 02:00:29] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 02:00:30] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:00:30] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-16 02:00:30] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 235 ms returned sat
[2023-03-16 02:00:31] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:00:31] [INFO ] After 264ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:00:32] [INFO ] Deduced a trap composed of 486 places in 426 ms of which 2 ms to minimize.
[2023-03-16 02:00:32] [INFO ] Deduced a trap composed of 501 places in 415 ms of which 1 ms to minimize.
[2023-03-16 02:00:33] [INFO ] Deduced a trap composed of 501 places in 433 ms of which 1 ms to minimize.
[2023-03-16 02:00:33] [INFO ] Deduced a trap composed of 492 places in 394 ms of which 1 ms to minimize.
[2023-03-16 02:00:34] [INFO ] Deduced a trap composed of 498 places in 441 ms of which 1 ms to minimize.
[2023-03-16 02:00:35] [INFO ] Deduced a trap composed of 495 places in 418 ms of which 1 ms to minimize.
[2023-03-16 02:00:35] [INFO ] Deduced a trap composed of 489 places in 440 ms of which 1 ms to minimize.
[2023-03-16 02:00:36] [INFO ] Deduced a trap composed of 492 places in 419 ms of which 1 ms to minimize.
[2023-03-16 02:00:36] [INFO ] Deduced a trap composed of 471 places in 414 ms of which 1 ms to minimize.
[2023-03-16 02:00:37] [INFO ] Deduced a trap composed of 495 places in 402 ms of which 1 ms to minimize.
[2023-03-16 02:00:37] [INFO ] Deduced a trap composed of 471 places in 391 ms of which 1 ms to minimize.
[2023-03-16 02:00:38] [INFO ] Deduced a trap composed of 489 places in 422 ms of which 1 ms to minimize.
[2023-03-16 02:00:39] [INFO ] Deduced a trap composed of 492 places in 392 ms of which 1 ms to minimize.
[2023-03-16 02:00:40] [INFO ] Deduced a trap composed of 498 places in 394 ms of which 0 ms to minimize.
[2023-03-16 02:00:41] [INFO ] Deduced a trap composed of 486 places in 418 ms of which 1 ms to minimize.
[2023-03-16 02:00:41] [INFO ] Deduced a trap composed of 513 places in 401 ms of which 1 ms to minimize.
[2023-03-16 02:00:41] [INFO ] Deduced a trap composed of 477 places in 375 ms of which 1 ms to minimize.
[2023-03-16 02:00:42] [INFO ] Deduced a trap composed of 504 places in 413 ms of which 1 ms to minimize.
[2023-03-16 02:00:42] [INFO ] Deduced a trap composed of 501 places in 379 ms of which 1 ms to minimize.
[2023-03-16 02:00:43] [INFO ] Deduced a trap composed of 498 places in 397 ms of which 1 ms to minimize.
[2023-03-16 02:00:43] [INFO ] Deduced a trap composed of 483 places in 389 ms of which 1 ms to minimize.
[2023-03-16 02:00:44] [INFO ] Deduced a trap composed of 492 places in 398 ms of which 0 ms to minimize.
[2023-03-16 02:00:46] [INFO ] Deduced a trap composed of 522 places in 399 ms of which 1 ms to minimize.
[2023-03-16 02:00:46] [INFO ] Deduced a trap composed of 492 places in 394 ms of which 1 ms to minimize.
[2023-03-16 02:00:47] [INFO ] Deduced a trap composed of 495 places in 408 ms of which 1 ms to minimize.
[2023-03-16 02:00:47] [INFO ] Deduced a trap composed of 492 places in 393 ms of which 1 ms to minimize.
[2023-03-16 02:00:48] [INFO ] Deduced a trap composed of 504 places in 401 ms of which 1 ms to minimize.
[2023-03-16 02:00:48] [INFO ] Deduced a trap composed of 492 places in 419 ms of which 1 ms to minimize.
[2023-03-16 02:00:49] [INFO ] Deduced a trap composed of 489 places in 402 ms of which 3 ms to minimize.
[2023-03-16 02:00:49] [INFO ] Deduced a trap composed of 486 places in 395 ms of which 1 ms to minimize.
[2023-03-16 02:00:50] [INFO ] Deduced a trap composed of 489 places in 403 ms of which 2 ms to minimize.
[2023-03-16 02:00:51] [INFO ] Deduced a trap composed of 489 places in 389 ms of which 4 ms to minimize.
[2023-03-16 02:00:51] [INFO ] Deduced a trap composed of 495 places in 412 ms of which 1 ms to minimize.
[2023-03-16 02:00:52] [INFO ] Deduced a trap composed of 486 places in 389 ms of which 1 ms to minimize.
[2023-03-16 02:00:53] [INFO ] Deduced a trap composed of 504 places in 399 ms of which 1 ms to minimize.
[2023-03-16 02:00:53] [INFO ] Deduced a trap composed of 480 places in 420 ms of which 1 ms to minimize.
[2023-03-16 02:00:54] [INFO ] Deduced a trap composed of 513 places in 389 ms of which 1 ms to minimize.
[2023-03-16 02:00:55] [INFO ] Deduced a trap composed of 507 places in 433 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:00:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:00:55] [INFO ] After 25203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 82 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1183 transition count 1595
Reduce places removed 4 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 85 rules applied. Total rules applied 94 place count 1179 transition count 1514
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 175 place count 1098 transition count 1514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 175 place count 1098 transition count 1510
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 1094 transition count 1510
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 1091 transition count 1507
Applied a total of 189 rules in 239 ms. Remains 1091 /1188 variables (removed 97) and now considering 1507/1599 (removed 92) transitions.
[2023-03-16 02:00:55] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
// Phase 1: matrix 1503 rows 1091 cols
[2023-03-16 02:00:55] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-16 02:00:56] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1588 ms. Remains : 1091/1188 places, 1507/1599 transitions.
Incomplete random walk after 10000 steps, including 534 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249176 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249176 steps, saw 73641 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:00:59] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 02:00:59] [INFO ] Invariant cache hit.
[2023-03-16 02:01:00] [INFO ] [Real]Absence check using 171 positive place invariants in 42 ms returned sat
[2023-03-16 02:01:00] [INFO ] [Real]Absence check using 171 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-16 02:01:00] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:01:00] [INFO ] [Nat]Absence check using 171 positive place invariants in 43 ms returned sat
[2023-03-16 02:01:00] [INFO ] [Nat]Absence check using 171 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-16 02:01:01] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:01:02] [INFO ] After 1198ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:01:03] [INFO ] Deduced a trap composed of 384 places in 350 ms of which 1 ms to minimize.
[2023-03-16 02:01:03] [INFO ] Deduced a trap composed of 393 places in 353 ms of which 1 ms to minimize.
[2023-03-16 02:01:04] [INFO ] Deduced a trap composed of 381 places in 382 ms of which 1 ms to minimize.
[2023-03-16 02:01:04] [INFO ] Deduced a trap composed of 402 places in 361 ms of which 1 ms to minimize.
[2023-03-16 02:01:05] [INFO ] Deduced a trap composed of 378 places in 372 ms of which 1 ms to minimize.
[2023-03-16 02:01:06] [INFO ] Deduced a trap composed of 402 places in 356 ms of which 1 ms to minimize.
[2023-03-16 02:01:06] [INFO ] Deduced a trap composed of 378 places in 367 ms of which 2 ms to minimize.
[2023-03-16 02:01:06] [INFO ] Deduced a trap composed of 396 places in 362 ms of which 1 ms to minimize.
[2023-03-16 02:01:07] [INFO ] Deduced a trap composed of 384 places in 370 ms of which 1 ms to minimize.
[2023-03-16 02:01:07] [INFO ] Deduced a trap composed of 381 places in 365 ms of which 2 ms to minimize.
[2023-03-16 02:01:08] [INFO ] Deduced a trap composed of 384 places in 379 ms of which 1 ms to minimize.
[2023-03-16 02:01:08] [INFO ] Deduced a trap composed of 372 places in 372 ms of which 1 ms to minimize.
[2023-03-16 02:01:09] [INFO ] Deduced a trap composed of 396 places in 371 ms of which 1 ms to minimize.
[2023-03-16 02:01:09] [INFO ] Deduced a trap composed of 375 places in 378 ms of which 0 ms to minimize.
[2023-03-16 02:01:10] [INFO ] Deduced a trap composed of 378 places in 376 ms of which 1 ms to minimize.
[2023-03-16 02:01:10] [INFO ] Deduced a trap composed of 384 places in 393 ms of which 5 ms to minimize.
[2023-03-16 02:01:11] [INFO ] Deduced a trap composed of 387 places in 365 ms of which 1 ms to minimize.
[2023-03-16 02:01:12] [INFO ] Deduced a trap composed of 402 places in 375 ms of which 1 ms to minimize.
[2023-03-16 02:01:12] [INFO ] Deduced a trap composed of 399 places in 361 ms of which 1 ms to minimize.
[2023-03-16 02:01:13] [INFO ] Deduced a trap composed of 396 places in 344 ms of which 0 ms to minimize.
[2023-03-16 02:01:16] [INFO ] Deduced a trap composed of 363 places in 348 ms of which 1 ms to minimize.
[2023-03-16 02:01:25] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 22061 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:01:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:01:25] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 82 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 50 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
[2023-03-16 02:01:25] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 02:01:25] [INFO ] Invariant cache hit.
[2023-03-16 02:01:26] [INFO ] Implicit Places using invariants in 1574 ms returned []
[2023-03-16 02:01:26] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 02:01:26] [INFO ] Invariant cache hit.
[2023-03-16 02:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:01:38] [INFO ] Implicit Places using invariants and state equation in 11956 ms returned []
Implicit Place search using SMT with State Equation took 13536 ms to find 0 implicit places.
[2023-03-16 02:01:38] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-16 02:01:38] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 02:01:38] [INFO ] Invariant cache hit.
[2023-03-16 02:01:40] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14988 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1091 transition count 1503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1091 transition count 1502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1090 transition count 1502
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1090 transition count 1501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1089 transition count 1501
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1089 transition count 1496
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1084 transition count 1496
Applied a total of 18 rules in 136 ms. Remains 1084 /1091 variables (removed 7) and now considering 1496/1507 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1496 rows 1084 cols
[2023-03-16 02:01:40] [INFO ] Computed 177 place invariants in 25 ms
[2023-03-16 02:01:40] [INFO ] [Real]Absence check using 171 positive place invariants in 39 ms returned sat
[2023-03-16 02:01:40] [INFO ] [Real]Absence check using 171 positive and 6 generalized place invariants in 20 ms returned sat
[2023-03-16 02:01:40] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:01:40] [INFO ] [Nat]Absence check using 171 positive place invariants in 38 ms returned sat
[2023-03-16 02:01:40] [INFO ] [Nat]Absence check using 171 positive and 6 generalized place invariants in 21 ms returned sat
[2023-03-16 02:01:47] [INFO ] After 6730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:01:48] [INFO ] Deduced a trap composed of 385 places in 396 ms of which 1 ms to minimize.
[2023-03-16 02:01:48] [INFO ] Deduced a trap composed of 385 places in 378 ms of which 2 ms to minimize.
[2023-03-16 02:01:49] [INFO ] Deduced a trap composed of 400 places in 383 ms of which 1 ms to minimize.
[2023-03-16 02:01:49] [INFO ] Deduced a trap composed of 376 places in 388 ms of which 3 ms to minimize.
[2023-03-16 02:01:50] [INFO ] Deduced a trap composed of 397 places in 381 ms of which 3 ms to minimize.
[2023-03-16 02:01:51] [INFO ] Deduced a trap composed of 385 places in 390 ms of which 6 ms to minimize.
[2023-03-16 02:02:00] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 13128 ms
[2023-03-16 02:02:00] [INFO ] After 20007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 02:02:00] [INFO ] After 20205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p1||X(p1)) U p2)||p0))))'
Support contains 82 out of 1188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 22 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 02:02:01] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 02:02:01] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 02:02:03] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
[2023-03-16 02:02:03] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:02:03] [INFO ] Invariant cache hit.
[2023-03-16 02:02:04] [INFO ] Implicit Places using invariants in 1479 ms returned []
[2023-03-16 02:02:04] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:02:04] [INFO ] Invariant cache hit.
[2023-03-16 02:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:02:11] [INFO ] Implicit Places using invariants and state equation in 6861 ms returned []
Implicit Place search using SMT with State Equation took 8341 ms to find 0 implicit places.
[2023-03-16 02:02:11] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:02:11] [INFO ] Invariant cache hit.
[2023-03-16 02:02:12] [INFO ] Dead Transitions using invariants and state equation in 1350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11186 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s64 1) (GEQ s3 1) (GEQ s66 1) (GEQ s5 1) (GEQ s68 1) (GEQ s7 1) (GEQ s70 1) (GEQ s9 1) (GEQ s72 1) (GEQ s11 1) (GEQ s74 1) (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-01 finished in 11991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1515
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1099 transition count 1515
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 168 place count 1099 transition count 1432
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 334 place count 1016 transition count 1432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 1014 transition count 1430
Applied a total of 338 rules in 112 ms. Remains 1014 /1188 variables (removed 174) and now considering 1430/1599 (removed 169) transitions.
[2023-03-16 02:02:13] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-16 02:02:13] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-16 02:02:14] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
[2023-03-16 02:02:14] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:14] [INFO ] Invariant cache hit.
[2023-03-16 02:02:15] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2023-03-16 02:02:15] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:15] [INFO ] Invariant cache hit.
[2023-03-16 02:02:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:02:21] [INFO ] Implicit Places using invariants and state equation in 6587 ms returned []
Implicit Place search using SMT with State Equation took 7717 ms to find 0 implicit places.
[2023-03-16 02:02:22] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-16 02:02:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:22] [INFO ] Invariant cache hit.
[2023-03-16 02:02:23] [INFO ] Dead Transitions using invariants and state equation in 1307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1188 places, 1430/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10297 ms. Remains : 1014/1188 places, 1430/1599 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1011 1) (OR (LT s499 1) (LT s502 1) (LT s505 9)) (OR (LT s499 1) (LT s503 1) (LT s505 9)) (OR (LT s499 1) (LT s504 1) (LT s505 9)) (OR (LT s4...], 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 5499 reset in 638 ms.
Product exploration explored 100000 steps with 5498 reset in 605 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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-16 02:02:25] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:25] [INFO ] Invariant cache hit.
[2023-03-16 02:02:26] [INFO ] [Real]Absence check using 170 positive place invariants in 142 ms returned sat
[2023-03-16 02:02:26] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 60 ms returned sat
[2023-03-16 02:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:02:29] [INFO ] [Real]Absence check using state equation in 2985 ms returned sat
[2023-03-16 02:02:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:02:30] [INFO ] [Nat]Absence check using 170 positive place invariants in 176 ms returned sat
[2023-03-16 02:02:30] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 134 ms returned sat
[2023-03-16 02:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:02:34] [INFO ] [Nat]Absence check using state equation in 4218 ms returned sat
[2023-03-16 02:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:02:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2023-03-16 02:02:35] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 110 ms.
[2023-03-16 02:02:35] [INFO ] Added : 25 causal constraints over 5 iterations in 720 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 40 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 02:02:35] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:35] [INFO ] Invariant cache hit.
[2023-03-16 02:02:36] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
[2023-03-16 02:02:36] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:36] [INFO ] Invariant cache hit.
[2023-03-16 02:02:38] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-16 02:02:38] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:38] [INFO ] Invariant cache hit.
[2023-03-16 02:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:02:46] [INFO ] Implicit Places using invariants and state equation in 8185 ms returned []
Implicit Place search using SMT with State Equation took 9351 ms to find 0 implicit places.
[2023-03-16 02:02:46] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-16 02:02:46] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:46] [INFO ] Invariant cache hit.
[2023-03-16 02:02:47] [INFO ] Dead Transitions using invariants and state equation in 1310 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12027 ms. Remains : 1014/1014 places, 1430/1430 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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-16 02:02:48] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:02:48] [INFO ] Invariant cache hit.
[2023-03-16 02:02:49] [INFO ] [Real]Absence check using 170 positive place invariants in 129 ms returned sat
[2023-03-16 02:02:49] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 57 ms returned sat
[2023-03-16 02:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:02:52] [INFO ] [Real]Absence check using state equation in 2911 ms returned sat
[2023-03-16 02:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:02:53] [INFO ] [Nat]Absence check using 170 positive place invariants in 173 ms returned sat
[2023-03-16 02:02:53] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 134 ms returned sat
[2023-03-16 02:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:02:57] [INFO ] [Nat]Absence check using state equation in 4105 ms returned sat
[2023-03-16 02:02:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:02:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 95 ms returned sat
[2023-03-16 02:02:57] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 74 ms.
[2023-03-16 02:02:58] [INFO ] Added : 25 causal constraints over 5 iterations in 623 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5427 reset in 529 ms.
Product exploration explored 100000 steps with 5581 reset in 575 ms.
Built C files in :
/tmp/ltsmin11181947738416715891
[2023-03-16 02:02:59] [INFO ] Computing symmetric may disable matrix : 1430 transitions.
[2023-03-16 02:02:59] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:02:59] [INFO ] Computing symmetric may enable matrix : 1430 transitions.
[2023-03-16 02:02:59] [INFO ] Computation of Complete enable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:02:59] [INFO ] Computing Do-Not-Accords matrix : 1430 transitions.
[2023-03-16 02:03:00] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:03:00] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11181947738416715891
Running compilation step : cd /tmp/ltsmin11181947738416715891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11181947738416715891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11181947738416715891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 43 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 02:03:03] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:03:03] [INFO ] Invariant cache hit.
[2023-03-16 02:03:04] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
[2023-03-16 02:03:04] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:03:04] [INFO ] Invariant cache hit.
[2023-03-16 02:03:05] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2023-03-16 02:03:05] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:03:05] [INFO ] Invariant cache hit.
[2023-03-16 02:03:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:03:13] [INFO ] Implicit Places using invariants and state equation in 7654 ms returned []
Implicit Place search using SMT with State Equation took 8755 ms to find 0 implicit places.
[2023-03-16 02:03:13] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 02:03:13] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:03:13] [INFO ] Invariant cache hit.
[2023-03-16 02:03:14] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11460 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Built C files in :
/tmp/ltsmin8475061727272997480
[2023-03-16 02:03:14] [INFO ] Computing symmetric may disable matrix : 1430 transitions.
[2023-03-16 02:03:14] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:03:14] [INFO ] Computing symmetric may enable matrix : 1430 transitions.
[2023-03-16 02:03:14] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:03:14] [INFO ] Computing Do-Not-Accords matrix : 1430 transitions.
[2023-03-16 02:03:14] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:03:14] [INFO ] Built C files in 398ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8475061727272997480
Running compilation step : cd /tmp/ltsmin8475061727272997480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8475061727272997480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8475061727272997480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 02:03:18] [INFO ] Flatten gal took : 82 ms
[2023-03-16 02:03:18] [INFO ] Flatten gal took : 61 ms
[2023-03-16 02:03:18] [INFO ] Time to serialize gal into /tmp/LTL7605854628180452107.gal : 34 ms
[2023-03-16 02:03:18] [INFO ] Time to serialize properties into /tmp/LTL2204617486500973867.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7605854628180452107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4428929295394980101.hoa' '-atoms' '/tmp/LTL2204617486500973867.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2204617486500973867.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4428929295394980101.hoa
Detected timeout of ITS tools.
[2023-03-16 02:03:33] [INFO ] Flatten gal took : 56 ms
[2023-03-16 02:03:33] [INFO ] Flatten gal took : 55 ms
[2023-03-16 02:03:33] [INFO ] Time to serialize gal into /tmp/LTL4264805235249215008.gal : 10 ms
[2023-03-16 02:03:33] [INFO ] Time to serialize properties into /tmp/LTL289526254046234986.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4264805235249215008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL289526254046234986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("((((Schedule_Task_B_0<1)&&(((place_500_0<1)||(ModifiedSrc_2<1))||(cSources_0<9)))&&((((place_500_0<1)||(ModifiedSrc_3<1))||(cS...345
Formula 0 simplified : GF!"((((Schedule_Task_B_0<1)&&(((place_500_0<1)||(ModifiedSrc_2<1))||(cSources_0<9)))&&((((place_500_0<1)||(ModifiedSrc_3<1))||(cSou...339
Detected timeout of ITS tools.
[2023-03-16 02:03:48] [INFO ] Flatten gal took : 53 ms
[2023-03-16 02:03:48] [INFO ] Applying decomposition
[2023-03-16 02:03:48] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18241573474841188954.txt' '-o' '/tmp/graph18241573474841188954.bin' '-w' '/tmp/graph18241573474841188954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18241573474841188954.bin' '-l' '-1' '-v' '-w' '/tmp/graph18241573474841188954.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:03:48] [INFO ] Decomposing Gal with order
[2023-03-16 02:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:03:49] [INFO ] Removed a total of 1457 redundant transitions.
[2023-03-16 02:03:49] [INFO ] Flatten gal took : 293 ms
[2023-03-16 02:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 526 labels/synchronizations in 55 ms.
[2023-03-16 02:03:49] [INFO ] Time to serialize gal into /tmp/LTL8910538442453849816.gal : 18 ms
[2023-03-16 02:03:49] [INFO ] Time to serialize properties into /tmp/LTL16726822112372503041.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8910538442453849816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16726822112372503041.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i46.u83.Schedule_Task_B_0<1)&&(((i45.u82.place_500_0<1)||(i45.u82.ModifiedSrc_2<1))||(i45.u82.cSources_0<9)))&&((((i45.u82...473
Formula 0 simplified : GF!"((((i46.u83.Schedule_Task_B_0<1)&&(((i45.u82.place_500_0<1)||(i45.u82.ModifiedSrc_2<1))||(i45.u82.cSources_0<9)))&&((((i45.u82.p...467
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13320221653602625176
[2023-03-16 02:04:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13320221653602625176
Running compilation step : cd /tmp/ltsmin13320221653602625176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13320221653602625176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13320221653602625176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-03 finished in 114455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 23 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 02:04:07] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-16 02:04:07] [INFO ] Computed 182 place invariants in 35 ms
[2023-03-16 02:04:09] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
[2023-03-16 02:04:09] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:09] [INFO ] Invariant cache hit.
[2023-03-16 02:04:10] [INFO ] Implicit Places using invariants in 1452 ms returned []
[2023-03-16 02:04:10] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:10] [INFO ] Invariant cache hit.
[2023-03-16 02:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:04:17] [INFO ] Implicit Places using invariants and state equation in 6603 ms returned []
Implicit Place search using SMT with State Equation took 8057 ms to find 0 implicit places.
[2023-03-16 02:04:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:17] [INFO ] Invariant cache hit.
[2023-03-16 02:04:18] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11087 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1187 1), p1:(AND (OR (LT s509 1) (LT s1008 1) (LT s1013 1) (LT s1016 1)) (OR (LT s509 1) (LT s1006 1) (LT s1011 1) (LT s1016 1)) (OR (LT s509 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10321 reset in 637 ms.
Product exploration explored 100000 steps with 10330 reset in 613 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 p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2063 steps, including 151 resets, run visited all 4 properties in 17 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 1057 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 02:04:22] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:22] [INFO ] Invariant cache hit.
[2023-03-16 02:04:23] [INFO ] [Real]Absence check using 175 positive place invariants in 172 ms returned sat
[2023-03-16 02:04:23] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 64 ms returned sat
[2023-03-16 02:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:04:28] [INFO ] [Real]Absence check using state equation in 4423 ms returned sat
[2023-03-16 02:04:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:04:29] [INFO ] [Nat]Absence check using 175 positive place invariants in 254 ms returned sat
[2023-03-16 02:04:30] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 298 ms returned sat
[2023-03-16 02:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:04:34] [INFO ] [Nat]Absence check using state equation in 4549 ms returned sat
[2023-03-16 02:04:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:04:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2023-03-16 02:04:34] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 80 ms.
[2023-03-16 02:04:35] [INFO ] Added : 33 causal constraints over 7 iterations in 915 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 30 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 02:04:35] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:35] [INFO ] Invariant cache hit.
[2023-03-16 02:04:37] [INFO ] Dead Transitions using invariants and state equation in 1589 ms found 0 transitions.
[2023-03-16 02:04:37] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:37] [INFO ] Invariant cache hit.
[2023-03-16 02:04:38] [INFO ] Implicit Places using invariants in 1384 ms returned []
[2023-03-16 02:04:38] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:38] [INFO ] Invariant cache hit.
[2023-03-16 02:04:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:04:44] [INFO ] Implicit Places using invariants and state equation in 5399 ms returned []
Implicit Place search using SMT with State Equation took 6791 ms to find 0 implicit places.
[2023-03-16 02:04:44] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:44] [INFO ] Invariant cache hit.
[2023-03-16 02:04:45] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9984 ms. Remains : 1188/1188 places, 1599/1599 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 : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 306 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2614 steps, including 186 resets, run visited all 4 properties in 44 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 02:04:46] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:04:46] [INFO ] Invariant cache hit.
[2023-03-16 02:04:48] [INFO ] [Real]Absence check using 175 positive place invariants in 187 ms returned sat
[2023-03-16 02:04:48] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 61 ms returned sat
[2023-03-16 02:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:04:53] [INFO ] [Real]Absence check using state equation in 4488 ms returned sat
[2023-03-16 02:04:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:04:54] [INFO ] [Nat]Absence check using 175 positive place invariants in 267 ms returned sat
[2023-03-16 02:04:55] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 306 ms returned sat
[2023-03-16 02:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:04:59] [INFO ] [Nat]Absence check using state equation in 4646 ms returned sat
[2023-03-16 02:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:04:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2023-03-16 02:04:59] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 76 ms.
[2023-03-16 02:05:00] [INFO ] Added : 33 causal constraints over 7 iterations in 917 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10326 reset in 550 ms.
Product exploration explored 100000 steps with 10331 reset in 595 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1188 transition count 1600
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1188 transition count 1600
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1188 transition count 1600
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 335 rules in 249 ms. Remains 1105 /1188 variables (removed 83) and now considering 1517/1599 (removed 82) transitions.
[2023-03-16 02:05:02] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
// Phase 1: matrix 1513 rows 1105 cols
[2023-03-16 02:05:02] [INFO ] Computed 182 place invariants in 35 ms
[2023-03-16 02:05:04] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
[2023-03-16 02:05:04] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 02:05:04] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
[2023-03-16 02:05:04] [INFO ] Invariant cache hit.
[2023-03-16 02:05:06] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1105/1188 places, 1517/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3843 ms. Remains : 1105/1188 places, 1517/1599 transitions.
Built C files in :
/tmp/ltsmin13594023100185430363
[2023-03-16 02:05:06] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13594023100185430363
Running compilation step : cd /tmp/ltsmin13594023100185430363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13594023100185430363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13594023100185430363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 23 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 02:05:09] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-16 02:05:09] [INFO ] Computed 182 place invariants in 29 ms
[2023-03-16 02:05:10] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
[2023-03-16 02:05:10] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:05:10] [INFO ] Invariant cache hit.
[2023-03-16 02:05:12] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2023-03-16 02:05:12] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:05:12] [INFO ] Invariant cache hit.
[2023-03-16 02:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:05:19] [INFO ] Implicit Places using invariants and state equation in 7528 ms returned []
Implicit Place search using SMT with State Equation took 8954 ms to find 0 implicit places.
[2023-03-16 02:05:19] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:05:19] [INFO ] Invariant cache hit.
[2023-03-16 02:05:21] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11915 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Built C files in :
/tmp/ltsmin7915475902462622388
[2023-03-16 02:05:21] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7915475902462622388
Running compilation step : cd /tmp/ltsmin7915475902462622388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7915475902462622388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7915475902462622388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 02:05:24] [INFO ] Flatten gal took : 65 ms
[2023-03-16 02:05:24] [INFO ] Flatten gal took : 65 ms
[2023-03-16 02:05:24] [INFO ] Time to serialize gal into /tmp/LTL2260817859806004146.gal : 10 ms
[2023-03-16 02:05:24] [INFO ] Time to serialize properties into /tmp/LTL5644212542891066429.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2260817859806004146.gal' '-t' 'CGAL' '-hoa' '/tmp/aut184949140409852939.hoa' '-atoms' '/tmp/LTL5644212542891066429.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5644212542891066429.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut184949140409852939.hoa
Detected timeout of ITS tools.
[2023-03-16 02:05:40] [INFO ] Flatten gal took : 59 ms
[2023-03-16 02:05:40] [INFO ] Flatten gal took : 62 ms
[2023-03-16 02:05:40] [INFO ] Time to serialize gal into /tmp/LTL4710299536193942045.gal : 9 ms
[2023-03-16 02:05:40] [INFO ] Time to serialize properties into /tmp/LTL16638015156535823560.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4710299536193942045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16638015156535823560.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Try_Check_Sources_B_0>=1)")||(G((F(G("((((((cSources_0<1)||(DataOnSrc_3<1))||((TheSour_3<1)||(CanInjectEvent_0<1)))&&(((cSou...4105
Formula 0 simplified : XG(!"(Try_Check_Sources_B_0>=1)" & F(GF!"((((((cSources_0<1)||(DataOnSrc_3<1))||((TheSour_3<1)||(CanInjectEvent_0<1)))&&(((cSources_...4091
Detected timeout of ITS tools.
[2023-03-16 02:05:55] [INFO ] Flatten gal took : 56 ms
[2023-03-16 02:05:55] [INFO ] Applying decomposition
[2023-03-16 02:05:55] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2997077658378709984.txt' '-o' '/tmp/graph2997077658378709984.bin' '-w' '/tmp/graph2997077658378709984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2997077658378709984.bin' '-l' '-1' '-v' '-w' '/tmp/graph2997077658378709984.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:05:55] [INFO ] Decomposing Gal with order
[2023-03-16 02:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:05:55] [INFO ] Removed a total of 2159 redundant transitions.
[2023-03-16 02:05:55] [INFO ] Flatten gal took : 162 ms
[2023-03-16 02:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 44 ms.
[2023-03-16 02:05:55] [INFO ] Time to serialize gal into /tmp/LTL8557091646516804676.gal : 18 ms
[2023-03-16 02:05:55] [INFO ] Time to serialize properties into /tmp/LTL2736493543112062287.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8557091646516804676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2736493543112062287.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i48.u127.Try_Check_Sources_B_0>=1)")||(G((F(G("((((((i27.u79.cSources_0<1)||(i26.i2.u18.DataOnSrc_3<1))||((i26.i2.u140.TheSo...5285
Formula 0 simplified : XG(!"(i48.u127.Try_Check_Sources_B_0>=1)" & F(GF!"((((((i27.u79.cSources_0<1)||(i26.i2.u18.DataOnSrc_3<1))||((i26.i2.u140.TheSour_3<...5271
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7965650318079420511
[2023-03-16 02:06:10] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7965650318079420511
Running compilation step : cd /tmp/ltsmin7965650318079420511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7965650318079420511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7965650318079420511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-04 finished in 126315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1098 transition count 1430
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1014 transition count 1430
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 342 place count 1012 transition count 1428
Applied a total of 342 rules in 86 ms. Remains 1012 /1188 variables (removed 176) and now considering 1428/1599 (removed 171) transitions.
[2023-03-16 02:06:13] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2023-03-16 02:06:13] [INFO ] Computed 177 place invariants in 27 ms
[2023-03-16 02:06:14] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
[2023-03-16 02:06:14] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-16 02:06:14] [INFO ] Invariant cache hit.
[2023-03-16 02:06:16] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2023-03-16 02:06:16] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-16 02:06:16] [INFO ] Invariant cache hit.
[2023-03-16 02:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:06:24] [INFO ] Implicit Places using invariants and state equation in 7807 ms returned []
Implicit Place search using SMT with State Equation took 9077 ms to find 0 implicit places.
[2023-03-16 02:06:24] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-16 02:06:24] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-16 02:06:24] [INFO ] Invariant cache hit.
[2023-03-16 02:06:25] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1188 places, 1428/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11346 ms. Remains : 1012/1188 places, 1428/1599 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1009 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-05 finished in 11400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F(p1)&&G(F(p2)))))'
Support contains 171 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1183 transition count 1596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1180 transition count 1596
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1180 transition count 1593
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1177 transition count 1593
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 1174 transition count 1590
Applied a total of 18 rules in 75 ms. Remains 1174 /1188 variables (removed 14) and now considering 1590/1599 (removed 9) transitions.
[2023-03-16 02:06:25] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
// Phase 1: matrix 1586 rows 1174 cols
[2023-03-16 02:06:25] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-16 02:06:26] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
[2023-03-16 02:06:26] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-16 02:06:26] [INFO ] Invariant cache hit.
[2023-03-16 02:06:28] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2023-03-16 02:06:28] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-16 02:06:28] [INFO ] Invariant cache hit.
[2023-03-16 02:06:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:06:39] [INFO ] Implicit Places using invariants and state equation in 11714 ms returned []
Implicit Place search using SMT with State Equation took 13067 ms to find 0 implicit places.
[2023-03-16 02:06:39] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 02:06:39] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-16 02:06:39] [INFO ] Invariant cache hit.
[2023-03-16 02:06:41] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1174/1188 places, 1590/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16028 ms. Remains : 1174/1188 places, 1590/1599 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s499 1) (LT s502 1) (LT s505 9)) (OR (LT s499 1) (LT s503 1) (LT s505 9)) (OR (LT s499 1) (LT s504 1) (LT s505 9)) (OR (LT s499 1) (LT s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-07 finished in 16209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||F(p1)))))'
Support contains 8 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 33 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 02:06:41] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 02:06:41] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 02:06:43] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
[2023-03-16 02:06:43] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:06:43] [INFO ] Invariant cache hit.
[2023-03-16 02:06:44] [INFO ] Implicit Places using invariants in 1466 ms returned []
[2023-03-16 02:06:44] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:06:44] [INFO ] Invariant cache hit.
[2023-03-16 02:06:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:06:51] [INFO ] Implicit Places using invariants and state equation in 6960 ms returned []
Implicit Place search using SMT with State Equation took 8428 ms to find 0 implicit places.
[2023-03-16 02:06:51] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:06:51] [INFO ] Invariant cache hit.
[2023-03-16 02:06:52] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11355 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s501 1), p1:(OR (AND (GEQ s503 1) (GEQ s505 1) (GEQ s506 1) (GEQ s509 8)) (AND (GEQ s503 1) (GEQ s507 2) (GEQ s509 8)) (AND (GEQ s503 1) (GEQ s504...], 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 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-08 finished in 11479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 169 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1013 transition count 1429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 1010 transition count 1426
Applied a total of 346 rules in 82 ms. Remains 1010 /1188 variables (removed 178) and now considering 1426/1599 (removed 173) transitions.
[2023-03-16 02:06:53] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 02:06:53] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-16 02:06:54] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
[2023-03-16 02:06:54] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:06:54] [INFO ] Invariant cache hit.
[2023-03-16 02:06:54] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-16 02:06:54] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:06:54] [INFO ] Invariant cache hit.
[2023-03-16 02:06:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:06:58] [INFO ] Implicit Places using invariants and state equation in 4022 ms returned []
Implicit Place search using SMT with State Equation took 4630 ms to find 0 implicit places.
[2023-03-16 02:06:58] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-16 02:06:58] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:06:58] [INFO ] Invariant cache hit.
[2023-03-16 02:06:59] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1188 places, 1426/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6728 ms. Remains : 1010/1188 places, 1426/1599 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s912 1) (LT s974 1)) (OR (LT s913 1) (LT s923 1)) (OR (LT s910 1) (LT s946 1)) (OR (LT s913 1) (LT s988 1)) (OR (LT s911 1) (LT s960 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10290 reset in 4019 ms.
Product exploration explored 100000 steps with 10232 reset in 4023 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1338 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 710 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Support contains 169 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 32 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-16 02:07:09] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:09] [INFO ] Invariant cache hit.
[2023-03-16 02:07:10] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
[2023-03-16 02:07:10] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:10] [INFO ] Invariant cache hit.
[2023-03-16 02:07:11] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-16 02:07:11] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:11] [INFO ] Invariant cache hit.
[2023-03-16 02:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:07:15] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 4102 ms to find 0 implicit places.
[2023-03-16 02:07:15] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 02:07:15] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:15] [INFO ] Invariant cache hit.
[2023-03-16 02:07:16] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6139 ms. Remains : 1010/1010 places, 1426/1426 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 : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 440 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 23 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10239 reset in 4317 ms.
Product exploration explored 100000 steps with 10280 reset in 4420 ms.
Built C files in :
/tmp/ltsmin3304663729638904231
[2023-03-16 02:07:25] [INFO ] Computing symmetric may disable matrix : 1426 transitions.
[2023-03-16 02:07:25] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:07:25] [INFO ] Computing symmetric may enable matrix : 1426 transitions.
[2023-03-16 02:07:25] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:07:26] [INFO ] Computing Do-Not-Accords matrix : 1426 transitions.
[2023-03-16 02:07:26] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:07:26] [INFO ] Built C files in 500ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3304663729638904231
Running compilation step : cd /tmp/ltsmin3304663729638904231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3304663729638904231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3304663729638904231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 169 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 32 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-16 02:07:29] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:29] [INFO ] Invariant cache hit.
[2023-03-16 02:07:30] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
[2023-03-16 02:07:30] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:30] [INFO ] Invariant cache hit.
[2023-03-16 02:07:30] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-16 02:07:30] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:30] [INFO ] Invariant cache hit.
[2023-03-16 02:07:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:07:34] [INFO ] Implicit Places using invariants and state equation in 3284 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
[2023-03-16 02:07:34] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 02:07:34] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:34] [INFO ] Invariant cache hit.
[2023-03-16 02:07:35] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5960 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Built C files in :
/tmp/ltsmin18428714103820401476
[2023-03-16 02:07:35] [INFO ] Computing symmetric may disable matrix : 1426 transitions.
[2023-03-16 02:07:35] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:07:35] [INFO ] Computing symmetric may enable matrix : 1426 transitions.
[2023-03-16 02:07:35] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:07:35] [INFO ] Computing Do-Not-Accords matrix : 1426 transitions.
[2023-03-16 02:07:35] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:07:35] [INFO ] Built C files in 455ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18428714103820401476
Running compilation step : cd /tmp/ltsmin18428714103820401476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18428714103820401476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18428714103820401476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 02:07:38] [INFO ] Flatten gal took : 53 ms
[2023-03-16 02:07:38] [INFO ] Flatten gal took : 46 ms
[2023-03-16 02:07:38] [INFO ] Time to serialize gal into /tmp/LTL18058303554402793738.gal : 8 ms
[2023-03-16 02:07:38] [INFO ] Time to serialize properties into /tmp/LTL17906712976019347501.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18058303554402793738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3212841117600659433.hoa' '-atoms' '/tmp/LTL17906712976019347501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17906712976019347501.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3212841117600659433.hoa
Detected timeout of ITS tools.
[2023-03-16 02:07:53] [INFO ] Flatten gal took : 51 ms
[2023-03-16 02:07:53] [INFO ] Flatten gal took : 52 ms
[2023-03-16 02:07:53] [INFO ] Time to serialize gal into /tmp/LTL12540325304560355915.gal : 8 ms
[2023-03-16 02:07:53] [INFO ] Time to serialize properties into /tmp/LTL3673691189461057347.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12540325304560355915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3673691189461057347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((((((((G("(((((((((((place_482_3<1)||(AvailableJobId_56<1))&&((place_482_4<1)||(AvailableJobId_5<1)))&&(((place_482_1<1)||(Availa...21949
Formula 0 simplified : G(!"((((((((block_0>=1)&&(QueueJobB_1>=1))&&(mi1_0>=1))||(((block_0>=1)&&(QueueJobB_78>=1))&&(mi1_0>=1)))||((((block_0>=1)&&(QueueJo...21931
Detected timeout of ITS tools.
[2023-03-16 02:08:09] [INFO ] Flatten gal took : 56 ms
[2023-03-16 02:08:09] [INFO ] Applying decomposition
[2023-03-16 02:08:09] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3974071553213755440.txt' '-o' '/tmp/graph3974071553213755440.bin' '-w' '/tmp/graph3974071553213755440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3974071553213755440.bin' '-l' '-1' '-v' '-w' '/tmp/graph3974071553213755440.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:08:09] [INFO ] Decomposing Gal with order
[2023-03-16 02:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:08:09] [INFO ] Removed a total of 1444 redundant transitions.
[2023-03-16 02:08:09] [INFO ] Flatten gal took : 232 ms
[2023-03-16 02:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 698 labels/synchronizations in 33 ms.
[2023-03-16 02:08:09] [INFO ] Time to serialize gal into /tmp/LTL3212644476506808760.gal : 13 ms
[2023-03-16 02:08:09] [INFO ] Time to serialize properties into /tmp/LTL10084097381333879621.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3212644476506808760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10084097381333879621.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((((((((G("(((((((((((i48.u83.place_482_3<1)||(u68.AvailableJobId_56<1))&&((i48.u83.place_482_4<1)||(u33.AvailableJobId_5<1)))&&((...28947
Formula 0 simplified : G(!"((((((((i0.u0.block_0>=1)&&(i0.u1.QueueJobB_1>=1))&&(i0.u1.mi1_0>=1))||(((i0.u0.block_0>=1)&&(i0.u1.QueueJobB_78>=1))&&(i0.u1.mi...28929
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10494587749253096686
[2023-03-16 02:08:24] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10494587749253096686
Running compilation step : cd /tmp/ltsmin10494587749253096686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10494587749253096686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10494587749253096686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-10 finished in 94836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 9 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 33 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 02:08:27] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 02:08:27] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-16 02:08:29] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
[2023-03-16 02:08:29] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:08:29] [INFO ] Invariant cache hit.
[2023-03-16 02:08:30] [INFO ] Implicit Places using invariants in 1505 ms returned []
[2023-03-16 02:08:30] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:08:30] [INFO ] Invariant cache hit.
[2023-03-16 02:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:08:44] [INFO ] Implicit Places using invariants and state equation in 13613 ms returned []
Implicit Place search using SMT with State Equation took 15119 ms to find 0 implicit places.
[2023-03-16 02:08:44] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 02:08:44] [INFO ] Invariant cache hit.
[2023-03-16 02:08:45] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18091 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GEQ s502 1), p0:(OR (AND (GEQ s503 1) (GEQ s504 1) (GEQ s506 1) (GEQ s507 1) (GEQ s508 1) (GEQ s509 6)) (AND (GEQ s503 1) (GEQ s507 4) (GEQ s509 6)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-12 finished in 18295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 166 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1013 transition count 1429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 1010 transition count 1426
Applied a total of 346 rules in 87 ms. Remains 1010 /1188 variables (removed 178) and now considering 1426/1599 (removed 173) transitions.
[2023-03-16 02:08:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 02:08:46] [INFO ] Computed 177 place invariants in 27 ms
[2023-03-16 02:08:47] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
[2023-03-16 02:08:47] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:08:47] [INFO ] Invariant cache hit.
[2023-03-16 02:08:48] [INFO ] Implicit Places using invariants in 1221 ms returned []
[2023-03-16 02:08:48] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:08:48] [INFO ] Invariant cache hit.
[2023-03-16 02:08:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:08:52] [INFO ] Implicit Places using invariants and state equation in 4046 ms returned []
Implicit Place search using SMT with State Equation took 5271 ms to find 0 implicit places.
[2023-03-16 02:08:52] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 02:08:52] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:08:52] [INFO ] Invariant cache hit.
[2023-03-16 02:08:53] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1188 places, 1426/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7376 ms. Remains : 1010/1188 places, 1426/1599 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s127 1) (GEQ s411 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s411 1)) (AND (GEQ s0 1) (GEQ s156 1) (GEQ s411 1)) (AND (GEQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-15 finished in 7567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Found a Shortening insensitive property : PolyORBNT-COL-S05J80-LTLFireability-04
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1517
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 1106 transition count 1517
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 164 place count 1106 transition count 1432
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 334 place count 1021 transition count 1432
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 338 place count 1019 transition count 1430
Applied a total of 338 rules in 69 ms. Remains 1019 /1188 variables (removed 169) and now considering 1430/1599 (removed 169) transitions.
[2023-03-16 02:08:54] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1019 cols
[2023-03-16 02:08:54] [INFO ] Computed 182 place invariants in 29 ms
[2023-03-16 02:08:55] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
[2023-03-16 02:08:55] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:08:55] [INFO ] Invariant cache hit.
[2023-03-16 02:08:56] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2023-03-16 02:08:56] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:08:56] [INFO ] Invariant cache hit.
[2023-03-16 02:08:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:09:05] [INFO ] Implicit Places using invariants and state equation in 9169 ms returned []
Implicit Place search using SMT with State Equation took 10350 ms to find 0 implicit places.
[2023-03-16 02:09:05] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:05] [INFO ] Invariant cache hit.
[2023-03-16 02:09:06] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1019/1188 places, 1430/1599 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12928 ms. Remains : 1019/1188 places, 1430/1599 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1018 1), p1:(AND (OR (LT s505 1) (LT s1004 1) (LT s1009 1) (LT s1012 1)) (OR (LT s505 1) (LT s1002 1) (LT s1007 1) (LT s1012 1)) (OR (LT s505 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14794 reset in 638 ms.
Product exploration explored 100000 steps with 14821 reset in 690 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 p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 472 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 489 steps, including 37 resets, run visited all 4 properties in 7 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 02:09:09] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:09] [INFO ] Invariant cache hit.
[2023-03-16 02:09:10] [INFO ] [Real]Absence check using 174 positive place invariants in 215 ms returned sat
[2023-03-16 02:09:11] [INFO ] [Real]Absence check using 174 positive and 8 generalized place invariants in 152 ms returned sat
[2023-03-16 02:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:09:14] [INFO ] [Real]Absence check using state equation in 3419 ms returned sat
[2023-03-16 02:09:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:09:15] [INFO ] [Nat]Absence check using 174 positive place invariants in 198 ms returned sat
[2023-03-16 02:09:16] [INFO ] [Nat]Absence check using 174 positive and 8 generalized place invariants in 115 ms returned sat
[2023-03-16 02:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:09:19] [INFO ] [Nat]Absence check using state equation in 3934 ms returned sat
[2023-03-16 02:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:09:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 397 ms returned sat
[2023-03-16 02:09:20] [INFO ] Computed and/alt/rep : 685/2383/685 causal constraints (skipped 735 transitions) in 72 ms.
[2023-03-16 02:09:22] [INFO ] Added : 21 causal constraints over 5 iterations in 2094 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 17 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 02:09:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:22] [INFO ] Invariant cache hit.
[2023-03-16 02:09:23] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
[2023-03-16 02:09:23] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:23] [INFO ] Invariant cache hit.
[2023-03-16 02:09:24] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2023-03-16 02:09:24] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:24] [INFO ] Invariant cache hit.
[2023-03-16 02:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:09:32] [INFO ] Implicit Places using invariants and state equation in 7697 ms returned []
Implicit Place search using SMT with State Equation took 8910 ms to find 0 implicit places.
[2023-03-16 02:09:32] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:32] [INFO ] Invariant cache hit.
[2023-03-16 02:09:33] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11228 ms. Remains : 1019/1019 places, 1430/1430 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 : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 443 steps, including 33 resets, run visited all 4 properties in 7 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 02:09:35] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:35] [INFO ] Invariant cache hit.
[2023-03-16 02:09:36] [INFO ] [Real]Absence check using 174 positive place invariants in 201 ms returned sat
[2023-03-16 02:09:36] [INFO ] [Real]Absence check using 174 positive and 8 generalized place invariants in 152 ms returned sat
[2023-03-16 02:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:09:40] [INFO ] [Real]Absence check using state equation in 3411 ms returned sat
[2023-03-16 02:09:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:09:41] [INFO ] [Nat]Absence check using 174 positive place invariants in 193 ms returned sat
[2023-03-16 02:09:41] [INFO ] [Nat]Absence check using 174 positive and 8 generalized place invariants in 112 ms returned sat
[2023-03-16 02:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:09:45] [INFO ] [Nat]Absence check using state equation in 3840 ms returned sat
[2023-03-16 02:09:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:09:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 404 ms returned sat
[2023-03-16 02:09:45] [INFO ] Computed and/alt/rep : 685/2383/685 causal constraints (skipped 735 transitions) in 73 ms.
[2023-03-16 02:09:47] [INFO ] Added : 21 causal constraints over 5 iterations in 2141 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14811 reset in 644 ms.
Product exploration explored 100000 steps with 14834 reset in 683 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 37 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 02:09:49] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:49] [INFO ] Invariant cache hit.
[2023-03-16 02:09:50] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
[2023-03-16 02:09:50] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-16 02:09:50] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 02:09:50] [INFO ] Invariant cache hit.
[2023-03-16 02:09:52] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2363 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Built C files in :
/tmp/ltsmin17442656695186498637
[2023-03-16 02:09:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17442656695186498637
Running compilation step : cd /tmp/ltsmin17442656695186498637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2817 ms.
Running link step : cd /tmp/ltsmin17442656695186498637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17442656695186498637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12598507823589468249.hoa' '--buchi-type=spotba'
LTSmin run took 895 ms.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-04 finished in 62125 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-04 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
[2023-03-16 02:09:55] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin913044300045498010
[2023-03-16 02:09:56] [INFO ] Too many transitions (1599) to apply POR reductions. Disabling POR matrices.
[2023-03-16 02:09:56] [INFO ] Applying decomposition
[2023-03-16 02:09:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin913044300045498010
Running compilation step : cd /tmp/ltsmin913044300045498010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 02:09:56] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7181607568436350971.txt' '-o' '/tmp/graph7181607568436350971.bin' '-w' '/tmp/graph7181607568436350971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7181607568436350971.bin' '-l' '-1' '-v' '-w' '/tmp/graph7181607568436350971.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:09:56] [INFO ] Decomposing Gal with order
[2023-03-16 02:09:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:09:56] [INFO ] Removed a total of 2159 redundant transitions.
[2023-03-16 02:09:56] [INFO ] Flatten gal took : 279 ms
[2023-03-16 02:09:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 65 ms.
[2023-03-16 02:09:56] [INFO ] Time to serialize gal into /tmp/LTLFireability2130640631498679232.gal : 43 ms
[2023-03-16 02:09:56] [INFO ] Time to serialize properties into /tmp/LTLFireability7241013228930253658.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2130640631498679232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7241013228930253658.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((((i42.u127.Schedule_Task_B_0<1)&&(((i26.u86.place_500_0<1)||(i26.u86.ModifiedSrc_2<1))||(i26.u86.cSources_0<9)))&&((((i26.u8...474
Formula 0 simplified : GF!"((((i42.u127.Schedule_Task_B_0<1)&&(((i26.u86.place_500_0<1)||(i26.u86.ModifiedSrc_2<1))||(i26.u86.cSources_0<9)))&&((((i26.u86....468
Compilation finished in 3425 ms.
Running link step : cd /tmp/ltsmin913044300045498010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin913044300045498010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 02:33:14] [INFO ] Applying decomposition
[2023-03-16 02:33:14] [INFO ] Flatten gal took : 535 ms
[2023-03-16 02:33:15] [INFO ] Decomposing Gal with order
[2023-03-16 02:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:33:16] [INFO ] Removed a total of 5161 redundant transitions.
[2023-03-16 02:33:17] [INFO ] Flatten gal took : 2126 ms
[2023-03-16 02:33:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 144 ms.
[2023-03-16 02:33:17] [INFO ] Time to serialize gal into /tmp/LTLFireability8182636703570003926.gal : 75 ms
[2023-03-16 02:33:18] [INFO ] Time to serialize properties into /tmp/LTLFireability18008668974718692989.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8182636703570003926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18008668974718692989.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G("((((Schedule_Task_B.Schedule_Task_B_0<1)&&(((place_500.place_500_0<1)||(Sources2.ModifiedSrc_2<1))||(cSources.cSources_0<9)))&...501
Formula 0 simplified : GF!"((((Schedule_Task_B.Schedule_Task_B_0<1)&&(((place_500.place_500_0<1)||(Sources2.ModifiedSrc_2<1))||(cSources.cSources_0<9)))&&(...495
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin913044300045498010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin913044300045498010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp5==true))||(LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 02:56:43] [INFO ] Flatten gal took : 144 ms
[2023-03-16 02:56:44] [INFO ] Input system was already deterministic with 1599 transitions.
[2023-03-16 02:56:44] [INFO ] Transformed 1188 places.
[2023-03-16 02:56:44] [INFO ] Transformed 1599 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-16 02:57:15] [INFO ] Time to serialize gal into /tmp/LTLFireability13984538612836387459.gal : 13 ms
[2023-03-16 02:57:15] [INFO ] Time to serialize properties into /tmp/LTLFireability6412076469242989345.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13984538612836387459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6412076469242989345.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((Schedule_Task_B_0<1)&&(((place_500_0<1)||(ModifiedSrc_2<1))||(cSources_0<9)))&&((((place_500_0<1)||(ModifiedSrc_3<1))||(cS...345
Formula 0 simplified : GF!"((((Schedule_Task_B_0<1)&&(((place_500_0<1)||(ModifiedSrc_2<1))||(cSources_0<9)))&&((((place_500_0<1)||(ModifiedSrc_3<1))||(cSou...339
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12808300 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15690412 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J80"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J80, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945700668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;