fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016800548
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBLF-COL-S06J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.415 3600000.00 13486661.00 24453.70 FF?FFFFFFTFFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016800548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S06J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016800548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 9.1K Apr 29 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 14:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 14:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652876974410

Running Version 202205111006
[2022-05-18 12:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 12:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 12:29:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 12:29:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 12:29:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 666 ms
[2022-05-18 12:29:36] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 12:29:36] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2022-05-18 12:29:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 975 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 29) seen :12
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-05-18 12:29:36] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 12:29:36] [INFO ] Computed 26 place invariants in 12 ms
[2022-05-18 12:29:37] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 12:29:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 12:29:37] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2022-05-18 12:29:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 12:29:37] [INFO ] Flatten gal took : 32 ms
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 12:29:37] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2022-05-18 12:29:37] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 446 ms.
[2022-05-18 12:29:37] [INFO ] Unfolded 12 HLPN properties in 3 ms.
[2022-05-18 12:29:37] [INFO ] Reduced 960 identical enabling conditions.
[2022-05-18 12:29:37] [INFO ] Reduced 960 identical enabling conditions.
[2022-05-18 12:29:37] [INFO ] Reduced 7020 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 269 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Applied a total of 6 rules in 109 ms. Remains 626 /632 variables (removed 6) and now considering 2430/2430 (removed 0) transitions.
[2022-05-18 12:29:38] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 626 cols
[2022-05-18 12:29:38] [INFO ] Computed 48 place invariants in 187 ms
[2022-05-18 12:29:39] [INFO ] Dead Transitions using invariants and state equation in 1563 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
[2022-05-18 12:29:39] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 626 cols
[2022-05-18 12:29:39] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-18 12:29:40] [INFO ] Implicit Places using invariants in 358 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 369 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 620/632 places, 1512/2430 transitions.
Applied a total of 0 rules in 16 ms. Remains 620 /620 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 620/632 places, 1512/2430 transitions.
Support contains 269 out of 620 places after structural reductions.
[2022-05-18 12:29:40] [INFO ] Flatten gal took : 160 ms
[2022-05-18 12:29:40] [INFO ] Flatten gal took : 158 ms
[2022-05-18 12:29:40] [INFO ] Input system was already deterministic with 1512 transitions.
Finished random walk after 353 steps, including 2 resets, run visited all 24 properties in 35 ms. (steps per millisecond=10 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
Support contains 12 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 620 transition count 1458
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 566 transition count 1458
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 566 transition count 1386
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 494 transition count 1386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 488 transition count 1380
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 488 transition count 1380
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 408 place count 416 transition count 1308
Applied a total of 408 rules in 146 ms. Remains 416 /620 variables (removed 204) and now considering 1308/1512 (removed 204) transitions.
[2022-05-18 12:29:41] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:41] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 12:29:42] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
[2022-05-18 12:29:42] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:42] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 12:29:42] [INFO ] Implicit Places using invariants in 398 ms returned []
[2022-05-18 12:29:42] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:42] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 12:29:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:29:47] [INFO ] Implicit Places using invariants and state equation in 5145 ms returned []
Implicit Place search using SMT with State Equation took 5547 ms to find 0 implicit places.
[2022-05-18 12:29:47] [INFO ] Redundant transitions in 83 ms returned []
[2022-05-18 12:29:47] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:47] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-18 12:29:48] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/620 places, 1308/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/620 places, 1308/1512 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s118 1) (LT s152 1) (LT s156 1)) (OR (LT s118 1) (LT s152 1) (LT s157 1)) (OR (LT s118 1) (LT s152 1) (LT s158 1)) (OR (LT s116 1) (LT s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2027 reset in 621 ms.
Product exploration explored 100000 steps with 2028 reset in 587 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 1308/1308 transitions.
Applied a total of 0 rules in 33 ms. Remains 416 /416 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2022-05-18 12:29:50] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:50] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 12:29:50] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2022-05-18 12:29:50] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:50] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 12:29:51] [INFO ] Implicit Places using invariants in 363 ms returned []
[2022-05-18 12:29:51] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:51] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 12:29:51] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:29:57] [INFO ] Implicit Places using invariants and state equation in 6356 ms returned []
Implicit Place search using SMT with State Equation took 6728 ms to find 0 implicit places.
[2022-05-18 12:29:57] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 12:29:57] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:29:57] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 12:29:58] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1308/1308 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1976 reset in 512 ms.
Product exploration explored 100000 steps with 1979 reset in 524 ms.
Built C files in :
/tmp/ltsmin8641067793219317062
[2022-05-18 12:30:00] [INFO ] Computing symmetric may disable matrix : 1308 transitions.
[2022-05-18 12:30:00] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:30:00] [INFO ] Computing symmetric may enable matrix : 1308 transitions.
[2022-05-18 12:30:00] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:30:00] [INFO ] Computing Do-Not-Accords matrix : 1308 transitions.
[2022-05-18 12:30:00] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:30:00] [INFO ] Built C files in 373ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8641067793219317062
Running compilation step : cd /tmp/ltsmin8641067793219317062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8641067793219317062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8641067793219317062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 12 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 1308/1308 transitions.
Applied a total of 0 rules in 68 ms. Remains 416 /416 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2022-05-18 12:30:03] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:30:03] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 12:30:04] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
[2022-05-18 12:30:04] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:30:04] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 12:30:04] [INFO ] Implicit Places using invariants in 371 ms returned []
[2022-05-18 12:30:04] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:30:04] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 12:30:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:30:09] [INFO ] Implicit Places using invariants and state equation in 5360 ms returned []
Implicit Place search using SMT with State Equation took 5742 ms to find 0 implicit places.
[2022-05-18 12:30:10] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-18 12:30:10] [INFO ] Flow matrix only has 1272 transitions (discarded 36 similar events)
// Phase 1: matrix 1272 rows 416 cols
[2022-05-18 12:30:10] [INFO ] Computed 42 place invariants in 26 ms
[2022-05-18 12:30:10] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1308/1308 transitions.
Built C files in :
/tmp/ltsmin10932726484786771704
[2022-05-18 12:30:10] [INFO ] Computing symmetric may disable matrix : 1308 transitions.
[2022-05-18 12:30:10] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:30:10] [INFO ] Computing symmetric may enable matrix : 1308 transitions.
[2022-05-18 12:30:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:30:10] [INFO ] Computing Do-Not-Accords matrix : 1308 transitions.
[2022-05-18 12:30:10] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:30:10] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10932726484786771704
Running compilation step : cd /tmp/ltsmin10932726484786771704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10932726484786771704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10932726484786771704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 12:30:14] [INFO ] Flatten gal took : 84 ms
[2022-05-18 12:30:14] [INFO ] Flatten gal took : 78 ms
[2022-05-18 12:30:14] [INFO ] Time to serialize gal into /tmp/LTL10669493784206709328.gal : 19 ms
[2022-05-18 12:30:14] [INFO ] Time to serialize properties into /tmp/LTL15119409455311324606.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10669493784206709328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15119409455311324606.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1066949...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_2<1))&&(((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_3<1)))&&((((P_1724_2<1)||(...1566
Formula 0 simplified : !XFGF"((((((((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_2<1))&&(((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_3<1)))&&((((P_1724_2<1)||(P_17...1556
Detected timeout of ITS tools.
[2022-05-18 12:30:29] [INFO ] Flatten gal took : 84 ms
[2022-05-18 12:30:29] [INFO ] Applying decomposition
[2022-05-18 12:30:29] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6216104783825818399.txt' '-o' '/tmp/graph6216104783825818399.bin' '-w' '/tmp/graph6216104783825818399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6216104783825818399.bin' '-l' '-1' '-v' '-w' '/tmp/graph6216104783825818399.weights' '-q' '0' '-e' '0.001'
[2022-05-18 12:30:29] [INFO ] Decomposing Gal with order
[2022-05-18 12:30:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 12:30:30] [INFO ] Removed a total of 941 redundant transitions.
[2022-05-18 12:30:30] [INFO ] Flatten gal took : 365 ms
[2022-05-18 12:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 249 labels/synchronizations in 26 ms.
[2022-05-18 12:30:30] [INFO ] Time to serialize gal into /tmp/LTL6550931910678127867.gal : 13 ms
[2022-05-18 12:30:30] [INFO ] Time to serialize properties into /tmp/LTL9092266290653011011.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6550931910678127867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9092266290653011011.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6550931...245
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((i7.u3.P_1724_2<1)||(i7.u4.P_1717_0<1))||(i7.u4.FetchJobB_2<1))&&(((i7.u3.P_1724_2<1)||(i7.u4.P_1717_0<1))||(i7.u4....2106
Formula 0 simplified : !XFGF"((((((((i7.u3.P_1724_2<1)||(i7.u4.P_1717_0<1))||(i7.u4.FetchJobB_2<1))&&(((i7.u3.P_1724_2<1)||(i7.u4.P_1717_0<1))||(i7.u4.Fetc...2096
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12782086744319824314
[2022-05-18 12:30:45] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12782086744319824314
Running compilation step : cd /tmp/ltsmin12782086744319824314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2516 ms.
Running link step : cd /tmp/ltsmin12782086744319824314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12782086744319824314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-02 finished in 79035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 43 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 35 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 12:31:00] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:00] [INFO ] Computed 42 place invariants in 45 ms
[2022-05-18 12:31:01] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
[2022-05-18 12:31:01] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:01] [INFO ] Computed 42 place invariants in 39 ms
[2022-05-18 12:31:01] [INFO ] Implicit Places using invariants in 491 ms returned []
[2022-05-18 12:31:01] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:01] [INFO ] Computed 42 place invariants in 41 ms
[2022-05-18 12:31:02] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:31:12] [INFO ] Implicit Places using invariants and state equation in 10825 ms returned []
Implicit Place search using SMT with State Equation took 11317 ms to find 0 implicit places.
[2022-05-18 12:31:12] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:12] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:31:13] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s527 1)) (AND (GEQ s1 1) (GEQ s522 1)) (AND (GEQ s1 1) (GEQ s526 1)) (AND (GEQ s1 1) (GEQ s525 1)) (AND (GEQ s1 1) (GEQ s524 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-03 finished in 12782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((((p1 U (p2 U X(p3)))&&!p1) U p2))))'
Support contains 25 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 27 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 12:31:13] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:13] [INFO ] Computed 42 place invariants in 36 ms
[2022-05-18 12:31:13] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
[2022-05-18 12:31:13] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:14] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 12:31:14] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-05-18 12:31:14] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:14] [INFO ] Computed 42 place invariants in 36 ms
[2022-05-18 12:31:15] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:31:24] [INFO ] Implicit Places using invariants and state equation in 10413 ms returned []
Implicit Place search using SMT with State Equation took 10832 ms to find 0 implicit places.
[2022-05-18 12:31:24] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:24] [INFO ] Computed 42 place invariants in 32 ms
[2022-05-18 12:31:25] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s335 1) (GEQ s334 1) (GEQ s331 1) (GEQ s330 1) (GEQ s333 1) (GEQ s332 1)), p2:(OR (AND (GEQ s423 7) (GEQ s427 1) (GEQ s487 3)) (AND (GEQ s423 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-04 finished in 12564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((G(p2) U (p3 U p2))))||p1)))'
Support contains 31 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 620 transition count 1476
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 584 transition count 1470
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 578 transition count 1470
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 84 place count 578 transition count 1392
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 240 place count 500 transition count 1392
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 246 place count 494 transition count 1386
Iterating global reduction 3 with 6 rules applied. Total rules applied 252 place count 494 transition count 1386
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 360 place count 440 transition count 1332
Applied a total of 360 rules in 71 ms. Remains 440 /620 variables (removed 180) and now considering 1332/1512 (removed 180) transitions.
[2022-05-18 12:31:25] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 12:31:25] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 12:31:26] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
[2022-05-18 12:31:26] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 12:31:26] [INFO ] Computed 42 place invariants in 28 ms
[2022-05-18 12:31:26] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-05-18 12:31:26] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 12:31:26] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 12:31:27] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:31:36] [INFO ] Implicit Places using invariants and state equation in 9256 ms returned []
Implicit Place search using SMT with State Equation took 9664 ms to find 0 implicit places.
[2022-05-18 12:31:36] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-18 12:31:36] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 12:31:36] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-18 12:31:36] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 440/620 places, 1332/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 440/620 places, 1332/1512 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2 p0) (AND (NOT p1) p3 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0} source=0 dest: 3}], [{ cond=(OR p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s111 1) (GEQ s181 1)) (AND (GEQ s111 1) (GEQ s182 1)) (AND (GEQ s111 1) (GEQ s179 1)) (AND (GEQ s111 1) (GEQ s180 1)) (AND (GEQ s111 1) (...], 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 67 steps with 4 reset in 13 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-05 finished in 11189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 23 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 12:31:37] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:37] [INFO ] Computed 42 place invariants in 38 ms
[2022-05-18 12:31:37] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2022-05-18 12:31:37] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:37] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:31:38] [INFO ] Implicit Places using invariants in 477 ms returned []
[2022-05-18 12:31:38] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:38] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:31:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:31:48] [INFO ] Implicit Places using invariants and state equation in 10032 ms returned []
Implicit Place search using SMT with State Equation took 10511 ms to find 0 implicit places.
[2022-05-18 12:31:48] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:31:48] [INFO ] Computed 42 place invariants in 46 ms
[2022-05-18 12:31:48] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s288 1) (LT s289 1) (LT s290 1) (LT s291 1) (LT s292 1) (LT s293 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 228 steps with 6 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-06 finished in 11889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(p0) U !F(p0))))))'
Support contains 7 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 620 transition count 1470
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 578 transition count 1464
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 572 transition count 1464
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 96 place count 572 transition count 1386
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 252 place count 494 transition count 1386
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 258 place count 488 transition count 1380
Iterating global reduction 3 with 6 rules applied. Total rules applied 264 place count 488 transition count 1380
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 372 place count 434 transition count 1326
Applied a total of 372 rules in 62 ms. Remains 434 /620 variables (removed 186) and now considering 1326/1512 (removed 186) transitions.
[2022-05-18 12:31:48] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:31:49] [INFO ] Computed 42 place invariants in 31 ms
[2022-05-18 12:31:49] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
[2022-05-18 12:31:49] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:31:49] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 12:31:49] [INFO ] Implicit Places using invariants in 392 ms returned []
[2022-05-18 12:31:49] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:31:49] [INFO ] Computed 42 place invariants in 31 ms
[2022-05-18 12:31:50] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:31:59] [INFO ] Implicit Places using invariants and state equation in 9696 ms returned []
Implicit Place search using SMT with State Equation took 10090 ms to find 0 implicit places.
[2022-05-18 12:31:59] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 12:31:59] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:31:59] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:32:00] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 434/620 places, 1326/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/620 places, 1326/1512 transitions.
Stuttering acceptance computed with spot in 45 ms :[p0]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s359 1) (GEQ s385 1)) (AND (GEQ s360 1) (GEQ s385 1)) (AND (GEQ s363 1) (GEQ s385 1)) (AND (GEQ s362 1) (GEQ s385 1)) (AND (GEQ s358 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1056 reset in 444 ms.
Product exploration explored 100000 steps with 1012 reset in 441 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Support contains 7 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 1326/1326 transitions.
Applied a total of 0 rules in 25 ms. Remains 434 /434 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2022-05-18 12:32:01] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:01] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:32:02] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
[2022-05-18 12:32:02] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:02] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 12:32:02] [INFO ] Implicit Places using invariants in 401 ms returned []
[2022-05-18 12:32:02] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:02] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 12:32:02] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:32:11] [INFO ] Implicit Places using invariants and state equation in 8755 ms returned []
Implicit Place search using SMT with State Equation took 9157 ms to find 0 implicit places.
[2022-05-18 12:32:11] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 12:32:11] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:11] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 12:32:11] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/434 places, 1326/1326 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[p0]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Product exploration explored 100000 steps with 1060 reset in 410 ms.
Product exploration explored 100000 steps with 1081 reset in 427 ms.
Built C files in :
/tmp/ltsmin1670999388192959688
[2022-05-18 12:32:13] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2022-05-18 12:32:13] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:32:13] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2022-05-18 12:32:13] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:32:13] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2022-05-18 12:32:13] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:32:13] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1670999388192959688
Running compilation step : cd /tmp/ltsmin1670999388192959688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1670999388192959688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1670999388192959688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 1326/1326 transitions.
Applied a total of 0 rules in 24 ms. Remains 434 /434 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2022-05-18 12:32:16] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:16] [INFO ] Computed 42 place invariants in 38 ms
[2022-05-18 12:32:17] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
[2022-05-18 12:32:17] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:17] [INFO ] Computed 42 place invariants in 26 ms
[2022-05-18 12:32:17] [INFO ] Implicit Places using invariants in 662 ms returned []
[2022-05-18 12:32:17] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:17] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 12:32:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:32:29] [INFO ] Implicit Places using invariants and state equation in 11342 ms returned []
Implicit Place search using SMT with State Equation took 12007 ms to find 0 implicit places.
[2022-05-18 12:32:29] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-18 12:32:29] [INFO ] Flow matrix only has 1290 transitions (discarded 36 similar events)
// Phase 1: matrix 1290 rows 434 cols
[2022-05-18 12:32:29] [INFO ] Computed 42 place invariants in 32 ms
[2022-05-18 12:32:29] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/434 places, 1326/1326 transitions.
Built C files in :
/tmp/ltsmin17325602423857110892
[2022-05-18 12:32:29] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2022-05-18 12:32:29] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:32:29] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2022-05-18 12:32:29] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:32:29] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2022-05-18 12:32:29] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 12:32:29] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17325602423857110892
Running compilation step : cd /tmp/ltsmin17325602423857110892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17325602423857110892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17325602423857110892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 12:32:33] [INFO ] Flatten gal took : 65 ms
[2022-05-18 12:32:33] [INFO ] Flatten gal took : 68 ms
[2022-05-18 12:32:33] [INFO ] Time to serialize gal into /tmp/LTL8643866957985661085.gal : 7 ms
[2022-05-18 12:32:33] [INFO ] Time to serialize properties into /tmp/LTL16737207651697519070.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8643866957985661085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16737207651697519070.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8643866...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X("(((((Check_Sources_E_1>=1)&&(ORB_Lock_0>=1))||((Check_Sources_E_2>=1)&&(ORB_Lock_0>=1)))||(((Check_Sources_E_5>=1)&&(ORB_...585
Formula 0 simplified : !XGF(X"(((((Check_Sources_E_1>=1)&&(ORB_Lock_0>=1))||((Check_Sources_E_2>=1)&&(ORB_Lock_0>=1)))||(((Check_Sources_E_5>=1)&&(ORB_Lock...571
Detected timeout of ITS tools.
[2022-05-18 12:32:48] [INFO ] Flatten gal took : 61 ms
[2022-05-18 12:32:48] [INFO ] Applying decomposition
[2022-05-18 12:32:48] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16009848584730138205.txt' '-o' '/tmp/graph16009848584730138205.bin' '-w' '/tmp/graph16009848584730138205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16009848584730138205.bin' '-l' '-1' '-v' '-w' '/tmp/graph16009848584730138205.weights' '-q' '0' '-e' '0.001'
[2022-05-18 12:32:48] [INFO ] Decomposing Gal with order
[2022-05-18 12:32:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 12:32:48] [INFO ] Removed a total of 845 redundant transitions.
[2022-05-18 12:32:48] [INFO ] Flatten gal took : 158 ms
[2022-05-18 12:32:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 20 ms.
[2022-05-18 12:32:48] [INFO ] Time to serialize gal into /tmp/LTL5997914492607000447.gal : 10 ms
[2022-05-18 12:32:48] [INFO ] Time to serialize properties into /tmp/LTL8340473794176487724.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5997914492607000447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8340473794176487724.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5997914...245
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X("(((((i7.u22.Check_Sources_E_1>=1)&&(i8.i0.u2.ORB_Lock_0>=1))||((i7.u23.Check_Sources_E_2>=1)&&(i8.i0.u2.ORB_Lock_0>=1)))|...777
Formula 0 simplified : !XGF(X"(((((i7.u22.Check_Sources_E_1>=1)&&(i8.i0.u2.ORB_Lock_0>=1))||((i7.u23.Check_Sources_E_2>=1)&&(i8.i0.u2.ORB_Lock_0>=1)))||(((...763
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10047874971661209644
[2022-05-18 12:33:03] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10047874971661209644
Running compilation step : cd /tmp/ltsmin10047874971661209644;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2539 ms.
Running link step : cd /tmp/ltsmin10047874971661209644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10047874971661209644;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((X((LTLAPp0==true)) U !<>((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 2312 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-07 finished in 79832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 13 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 620 transition count 1464
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 572 transition count 1464
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 572 transition count 1392
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 500 transition count 1392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 494 transition count 1386
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 494 transition count 1386
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 396 place count 422 transition count 1314
Applied a total of 396 rules in 57 ms. Remains 422 /620 variables (removed 198) and now considering 1314/1512 (removed 198) transitions.
[2022-05-18 12:33:08] [INFO ] Flow matrix only has 1278 transitions (discarded 36 similar events)
// Phase 1: matrix 1278 rows 422 cols
[2022-05-18 12:33:08] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 12:33:09] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
[2022-05-18 12:33:09] [INFO ] Flow matrix only has 1278 transitions (discarded 36 similar events)
// Phase 1: matrix 1278 rows 422 cols
[2022-05-18 12:33:09] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 12:33:09] [INFO ] Implicit Places using invariants in 359 ms returned []
[2022-05-18 12:33:09] [INFO ] Flow matrix only has 1278 transitions (discarded 36 similar events)
// Phase 1: matrix 1278 rows 422 cols
[2022-05-18 12:33:09] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 12:33:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:33:17] [INFO ] Implicit Places using invariants and state equation in 7373 ms returned []
Implicit Place search using SMT with State Equation took 7732 ms to find 0 implicit places.
[2022-05-18 12:33:17] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 12:33:17] [INFO ] Flow matrix only has 1278 transitions (discarded 36 similar events)
// Phase 1: matrix 1278 rows 422 cols
[2022-05-18 12:33:17] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 12:33:17] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 422/620 places, 1314/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 422/620 places, 1314/1512 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s315 9) (GEQ s316 1) (GEQ s368 1)) (AND (GEQ s315 9) (GEQ s321 1) (GEQ s369 1)) (AND (GEQ s315 9) (GEQ s316 1) (GEQ s367 1)) (AND (GEQ s3...], 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 119 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-08 finished in 8934 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||X(!(G(p1) U p2)))))'
Support contains 25 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 40 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 12:33:17] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:17] [INFO ] Computed 42 place invariants in 37 ms
[2022-05-18 12:33:18] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2022-05-18 12:33:18] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:18] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-18 12:33:18] [INFO ] Implicit Places using invariants in 480 ms returned []
[2022-05-18 12:33:18] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:18] [INFO ] Computed 42 place invariants in 35 ms
[2022-05-18 12:33:19] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:33:28] [INFO ] Implicit Places using invariants and state equation in 10126 ms returned []
Implicit Place search using SMT with State Equation took 10611 ms to find 0 implicit places.
[2022-05-18 12:33:28] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:29] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-18 12:33:29] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p1 p2), (NOT p0), (NOT p1), (AND p1 (NOT p0) p2), (AND p1 (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s121 1) (GEQ s124 1)) (AND (GEQ s117 1) (GEQ s124 1)) (AND (GEQ s120 1) (GEQ s124 1)) (AND (GEQ s118 1) (GEQ s124 1)) (AND (GEQ s119 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 817 ms.
Product exploration explored 100000 steps with 33333 reset in 844 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0) p2))))
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 8 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-09 finished in 14167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!G((F(p0)||X(p1)||X(G(p2))))) U X(p3)))'
Support contains 57 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Applied a total of 0 rules in 18 ms. Remains 620 /620 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
[2022-05-18 12:33:31] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 620 cols
[2022-05-18 12:33:31] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:33:32] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
[2022-05-18 12:33:32] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 620 cols
[2022-05-18 12:33:32] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 12:33:32] [INFO ] Implicit Places using invariants in 430 ms returned []
[2022-05-18 12:33:32] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 620 cols
[2022-05-18 12:33:32] [INFO ] Computed 42 place invariants in 39 ms
[2022-05-18 12:33:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:33:42] [INFO ] Implicit Places using invariants and state equation in 9584 ms returned []
Implicit Place search using SMT with State Equation took 10017 ms to find 0 implicit places.
[2022-05-18 12:33:42] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 620 cols
[2022-05-18 12:33:42] [INFO ] Computed 42 place invariants in 46 ms
[2022-05-18 12:33:43] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/620 places, 1512/1512 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p3), (NOT p3), (OR p2 p1 p0), (OR p0 p2 p1), p0, (OR p1 p2), p2]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (AND (GEQ s122 10) (GEQ s194 1)) (AND (GEQ s122 10) (GEQ s193 1)) (AND (GEQ s122 10) (GEQ s192 1)) (AND (GEQ s122 10) (GEQ s191 1)) (AND (GEQ s122 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13917 steps with 3101 reset in 112 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-10 finished in 11817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((X(p0)&&F(p1))))||G(X(!p0)))))'
Support contains 73 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 21 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 12:33:43] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:43] [INFO ] Computed 42 place invariants in 29 ms
[2022-05-18 12:33:44] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2022-05-18 12:33:44] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:44] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:33:44] [INFO ] Implicit Places using invariants in 391 ms returned []
[2022-05-18 12:33:44] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:44] [INFO ] Computed 42 place invariants in 35 ms
[2022-05-18 12:33:45] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:33:52] [INFO ] Implicit Places using invariants and state equation in 8123 ms returned []
Implicit Place search using SMT with State Equation took 8531 ms to find 0 implicit places.
[2022-05-18 12:33:52] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:52] [INFO ] Computed 42 place invariants in 57 ms
[2022-05-18 12:33:53] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (NOT p0), (NOT p1), true, false, (AND (NOT p1) p0), p0]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}], [{ cond=p0, acceptance={} source=10 dest: 7}, { cond=(NOT p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (OR (LT s410 1) (LT s585 1)) (OR (LT s400 1) (LT s579 1)) (OR (LT s421 1) (LT s597 1)) (OR (LT s396 1) (LT s588 1)) (OR (LT s405 1) (LT s580 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18203 reset in 950 ms.
Product exploration explored 100000 steps with 18214 reset in 997 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 11 states, 18 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Finished random walk after 39 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 7 states, 8 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 73 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1500/1500 transitions.
Applied a total of 0 rules in 8 ms. Remains 608 /608 variables (removed 0) and now considering 1500/1500 (removed 0) transitions.
[2022-05-18 12:33:56] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:56] [INFO ] Computed 42 place invariants in 40 ms
[2022-05-18 12:33:57] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
[2022-05-18 12:33:57] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:57] [INFO ] Computed 42 place invariants in 31 ms
[2022-05-18 12:33:57] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-05-18 12:33:57] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:33:57] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 12:33:58] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:34:08] [INFO ] Implicit Places using invariants and state equation in 10426 ms returned []
Implicit Place search using SMT with State Equation took 10851 ms to find 0 implicit places.
[2022-05-18 12:34:08] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:34:08] [INFO ] Computed 42 place invariants in 37 ms
[2022-05-18 12:34:08] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1500/1500 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 7 states, 8 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Finished random walk after 59 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 7 states, 8 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 544 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 18203 reset in 718 ms.
Product exploration explored 100000 steps with 18181 reset in 700 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 73 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1500/1500 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 608 transition count 1500
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 36 place count 608 transition count 1572
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 84 place count 608 transition count 1572
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 596 transition count 1560
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 596 transition count 1560
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 168 place count 596 transition count 1560
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 192 place count 572 transition count 1536
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 216 place count 572 transition count 1536
Deduced a syphon composed of 114 places in 0 ms
Applied a total of 216 rules in 90 ms. Remains 572 /608 variables (removed 36) and now considering 1536/1500 (removed -36) transitions.
[2022-05-18 12:34:12] [INFO ] Flow matrix only has 1500 transitions (discarded 36 similar events)
// Phase 1: matrix 1500 rows 572 cols
[2022-05-18 12:34:12] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-18 12:34:13] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
[2022-05-18 12:34:13] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 12:34:13] [INFO ] Flow matrix only has 1500 transitions (discarded 36 similar events)
// Phase 1: matrix 1500 rows 572 cols
[2022-05-18 12:34:13] [INFO ] Computed 42 place invariants in 26 ms
[2022-05-18 12:34:13] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/608 places, 1536/1500 transitions.
Finished structural reductions, in 1 iterations. Remains : 572/608 places, 1536/1500 transitions.
Product exploration explored 100000 steps with 18179 reset in 1934 ms.
Product exploration explored 100000 steps with 18187 reset in 1856 ms.
Built C files in :
/tmp/ltsmin14927949287957352419
[2022-05-18 12:34:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14927949287957352419
Running compilation step : cd /tmp/ltsmin14927949287957352419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2929 ms.
Running link step : cd /tmp/ltsmin14927949287957352419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14927949287957352419;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9275068181841805122.hoa' '--buchi-type=spotba'
LTSmin run took 268 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-12 finished in 37109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 58 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 12:34:20] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:34:20] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 12:34:21] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
[2022-05-18 12:34:21] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:34:21] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 12:34:22] [INFO ] Implicit Places using invariants in 477 ms returned []
[2022-05-18 12:34:22] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:34:22] [INFO ] Computed 42 place invariants in 36 ms
[2022-05-18 12:34:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:34:32] [INFO ] Implicit Places using invariants and state equation in 9981 ms returned []
Implicit Place search using SMT with State Equation took 10462 ms to find 0 implicit places.
[2022-05-18 12:34:32] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 12:34:32] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 12:34:32] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s276 1) (GEQ s287 1)) (AND (GEQ s278 1) (GEQ s287 1)) (AND (GEQ s279 1) (GEQ s287 1)) (AND (GEQ s277 1) (GEQ s287 1)) (AND (GEQ s274 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-14 finished in 12031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((G(!p1)&&p2)||p0)) U p2)))'
Support contains 8 out of 620 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 620 transition count 1458
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 566 transition count 1458
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 566 transition count 1422
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 530 transition count 1422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 524 transition count 1416
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 524 transition count 1416
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 324 place count 458 transition count 1350
Applied a total of 324 rules in 53 ms. Remains 458 /620 variables (removed 162) and now considering 1350/1512 (removed 162) transitions.
[2022-05-18 12:34:32] [INFO ] Flow matrix only has 1314 transitions (discarded 36 similar events)
// Phase 1: matrix 1314 rows 458 cols
[2022-05-18 12:34:32] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 12:34:33] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
[2022-05-18 12:34:33] [INFO ] Flow matrix only has 1314 transitions (discarded 36 similar events)
// Phase 1: matrix 1314 rows 458 cols
[2022-05-18 12:34:33] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 12:34:33] [INFO ] Implicit Places using invariants in 377 ms returned []
[2022-05-18 12:34:33] [INFO ] Flow matrix only has 1314 transitions (discarded 36 similar events)
// Phase 1: matrix 1314 rows 458 cols
[2022-05-18 12:34:33] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 12:34:34] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 12:34:38] [INFO ] Implicit Places using invariants and state equation in 4891 ms returned []
Implicit Place search using SMT with State Equation took 5278 ms to find 0 implicit places.
[2022-05-18 12:34:38] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-18 12:34:38] [INFO ] Flow matrix only has 1314 transitions (discarded 36 similar events)
// Phase 1: matrix 1314 rows 458 cols
[2022-05-18 12:34:38] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 12:34:39] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 458/620 places, 1350/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/620 places, 1350/1512 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (AND (GEQ s107 1) (GEQ s382 1) (GEQ s407 1)) (AND (GEQ s107 1) (GEQ s387 1) (GEQ s407 1)) (AND (GEQ s107 1) (GEQ s385 1) (GEQ s407 1)) (AND (GEQ s1...], 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 65 steps with 3 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-15 finished in 6519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
[2022-05-18 12:34:39] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6058332007245362130
[2022-05-18 12:34:39] [INFO ] Too many transitions (1512) to apply POR reductions. Disabling POR matrices.
[2022-05-18 12:34:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6058332007245362130
Running compilation step : cd /tmp/ltsmin6058332007245362130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 12:34:39] [INFO ] Applying decomposition
[2022-05-18 12:34:39] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13781855968039125738.txt' '-o' '/tmp/graph13781855968039125738.bin' '-w' '/tmp/graph13781855968039125738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13781855968039125738.bin' '-l' '-1' '-v' '-w' '/tmp/graph13781855968039125738.weights' '-q' '0' '-e' '0.001'
[2022-05-18 12:34:39] [INFO ] Decomposing Gal with order
[2022-05-18 12:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 12:34:40] [INFO ] Removed a total of 1033 redundant transitions.
[2022-05-18 12:34:40] [INFO ] Flatten gal took : 261 ms
[2022-05-18 12:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 97 ms.
[2022-05-18 12:34:40] [INFO ] Time to serialize gal into /tmp/LTLFireability12761933365463746028.gal : 84 ms
[2022-05-18 12:34:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16096989036224424577.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12761933365463746028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16096989036224424577.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((i3.u36.P_1724_2<1)||(i3.u36.P_1717_0<1))||(i3.u36.FetchJobB_2<1))&&(((i3.u36.P_1724_2<1)||(i3.u36.P_1717_0<1))||(i...2196
Formula 0 simplified : !XFGF"((((((((i3.u36.P_1724_2<1)||(i3.u36.P_1717_0<1))||(i3.u36.FetchJobB_2<1))&&(((i3.u36.P_1724_2<1)||(i3.u36.P_1717_0<1))||(i3.u3...2186
Compilation finished in 2980 ms.
Running link step : cd /tmp/ltsmin6058332007245362130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin6058332007245362130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 12:56:22] [INFO ] Applying decomposition
[2022-05-18 12:56:22] [INFO ] Flatten gal took : 133 ms
[2022-05-18 12:56:22] [INFO ] Decomposing Gal with order
[2022-05-18 12:56:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 12:56:22] [INFO ] Removed a total of 5971 redundant transitions.
[2022-05-18 12:56:23] [INFO ] Flatten gal took : 402 ms
[2022-05-18 12:56:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 60 ms.
[2022-05-18 12:56:23] [INFO ] Time to serialize gal into /tmp/LTLFireability12895025274877946887.gal : 26 ms
[2022-05-18 12:56:23] [INFO ] Time to serialize properties into /tmp/LTLFireability16306951503367712859.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12895025274877946887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16306951503367712859.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((Jobs2.P_1724_2<1)||(P_1717.P_1717_0<1))||(Threads2.FetchJobB_2<1))&&(((Jobs2.P_1724_2<1)||(P_1717.P_1717_0<1))||(T...2226
Formula 0 simplified : !XFGF"((((((((Jobs2.P_1724_2<1)||(P_1717.P_1717_0<1))||(Threads2.FetchJobB_2<1))&&(((Jobs2.P_1724_2<1)||(P_1717.P_1717_0<1))||(Threa...2216
Detected timeout of ITS tools.
[2022-05-18 13:18:06] [INFO ] Flatten gal took : 640 ms
[2022-05-18 13:18:08] [INFO ] Input system was already deterministic with 1512 transitions.
[2022-05-18 13:18:08] [INFO ] Transformed 620 places.
[2022-05-18 13:18:08] [INFO ] Transformed 1512 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 13:18:39] [INFO ] Time to serialize gal into /tmp/LTLFireability15064540871847388154.gal : 13 ms
[2022-05-18 13:18:39] [INFO ] Time to serialize properties into /tmp/LTLFireability17465448607900169991.ltl : 42 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15064540871847388154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17465448607900169991.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G(F("((((((((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_2<1))&&(((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_3<1)))&&((((P_1724_2<1)||(...1566
Formula 0 simplified : !XFGF"((((((((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_2<1))&&(((P_1724_2<1)||(P_1717_0<1))||(FetchJobB_3<1)))&&((((P_1724_2<1)||(P_17...1556

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016800548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;