fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873945700643
Last Updated
May 14, 2023

About the Execution of ITS-Tools for PolyORBNT-COL-S05J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16222.896 3600000.00 4855359.00 503785.40 FFFTTTFTFFTF??FF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678925056623

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 00:04:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 00:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:04:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 00:04:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 00:04:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 479 ms
[2023-03-16 00:04:18] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 00:04:18] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-16 00:04:18] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 806 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :13
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 00:04:19] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-16 00:04:19] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 00:04:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 00:04:19] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-16 00:04:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:04:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 00:04:19] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 00:04:19] [INFO ] Flatten gal took : 45 ms
[2023-03-16 00:04:19] [INFO ] Flatten gal took : 9 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-16 00:04:19] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 42 ms.
[2023-03-16 00:04:19] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 364 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 745
Applied a total of 5 rules in 24 ms. Remains 484 /489 variables (removed 5) and now considering 745/745 (removed 0) transitions.
[2023-03-16 00:04:19] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 484 cols
[2023-03-16 00:04:19] [INFO ] Computed 77 place invariants in 33 ms
[2023-03-16 00:04:20] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
[2023-03-16 00:04:20] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
[2023-03-16 00:04:20] [INFO ] Invariant cache hit.
[2023-03-16 00:04:20] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-16 00:04:20] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
[2023-03-16 00:04:20] [INFO ] Invariant cache hit.
[2023-03-16 00:04:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:21] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-03-16 00:04:21] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
[2023-03-16 00:04:21] [INFO ] Invariant cache hit.
[2023-03-16 00:04:22] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/745 transitions.
Applied a total of 0 rules in 12 ms. Remains 484 /484 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2335 ms. Remains : 484/489 places, 650/745 transitions.
Support contains 364 out of 484 places after structural reductions.
[2023-03-16 00:04:22] [INFO ] Flatten gal took : 60 ms
[2023-03-16 00:04:22] [INFO ] Flatten gal took : 53 ms
[2023-03-16 00:04:22] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 679 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-16 00:04:23] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2023-03-16 00:04:23] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-16 00:04:23] [INFO ] [Real]Absence check using 71 positive place invariants in 14 ms returned sat
[2023-03-16 00:04:23] [INFO ] [Real]Absence check using 71 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-16 00:04:23] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-16 00:04:23] [INFO ] [Nat]Absence check using 71 positive place invariants in 30 ms returned sat
[2023-03-16 00:04:23] [INFO ] [Nat]Absence check using 71 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-16 00:04:23] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-16 00:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:23] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2023-03-16 00:04:23] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-16 00:04:23] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 116 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2023-03-16 00:04:24] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2023-03-16 00:04:24] [INFO ] Computed 77 place invariants in 18 ms
[2023-03-16 00:04:24] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 704 ms. Remains : 412/484 places, 578/650 transitions.
Finished random walk after 633 steps, including 34 resets, run visited all 1 properties in 4 ms. (steps per millisecond=158 )
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(X(p1)))))'
Support contains 33 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 30 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 00:04:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 00:04:25] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-16 00:04:25] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
[2023-03-16 00:04:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:25] [INFO ] Invariant cache hit.
[2023-03-16 00:04:26] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-16 00:04:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:26] [INFO ] Invariant cache hit.
[2023-03-16 00:04:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:27] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-16 00:04:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:27] [INFO ] Invariant cache hit.
[2023-03-16 00:04:28] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2720 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 3 s164), p1:(GT s161 (ADD s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s...], 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 2 ms.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-00 finished in 3476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 89 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-16 00:04:28] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:04:28] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-16 00:04:28] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
[2023-03-16 00:04:28] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:04:28] [INFO ] Invariant cache hit.
[2023-03-16 00:04:29] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-16 00:04:29] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:04:29] [INFO ] Invariant cache hit.
[2023-03-16 00:04:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:30] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2023-03-16 00:04:30] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-16 00:04:30] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:04:30] [INFO ] Invariant cache hit.
[2023-03-16 00:04:30] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2291 ms. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s97 s198)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 137 steps with 8 reset in 7 ms.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-06 finished in 2561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U G(p1))||X(F(p2))))'
Support contains 37 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 16 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 00:04:30] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 00:04:30] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-16 00:04:31] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
[2023-03-16 00:04:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:31] [INFO ] Invariant cache hit.
[2023-03-16 00:04:31] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-16 00:04:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:31] [INFO ] Invariant cache hit.
[2023-03-16 00:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:33] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2023-03-16 00:04:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:33] [INFO ] Invariant cache hit.
[2023-03-16 00:04:33] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2734 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s96 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p0:(LEQ 1 (ADD s1 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) p2)
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-07 finished in 4199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 62 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 14 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 00:04:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:35] [INFO ] Invariant cache hit.
[2023-03-16 00:04:35] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
[2023-03-16 00:04:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:35] [INFO ] Invariant cache hit.
[2023-03-16 00:04:35] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-16 00:04:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:35] [INFO ] Invariant cache hit.
[2023-03-16 00:04:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:37] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2023-03-16 00:04:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:37] [INFO ] Invariant cache hit.
[2023-03-16 00:04:37] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2776 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-08 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:(GT (ADD s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-08 finished in 2885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 31 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 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 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 579
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 578
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 410 transition count 576
Applied a total of 148 rules in 48 ms. Remains 410 /484 variables (removed 74) and now considering 576/650 (removed 74) transitions.
[2023-03-16 00:04:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-16 00:04:38] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-16 00:04:38] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
[2023-03-16 00:04:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 00:04:38] [INFO ] Invariant cache hit.
[2023-03-16 00:04:38] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-16 00:04:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 00:04:38] [INFO ] Invariant cache hit.
[2023-03-16 00:04:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:39] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2023-03-16 00:04:39] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 00:04:39] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 00:04:39] [INFO ] Invariant cache hit.
[2023-03-16 00:04:40] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/484 places, 576/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2015 ms. Remains : 410/484 places, 576/650 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-11 finished in 2094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(F((p0&&F(G(p2)))))))'
Support contains 35 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 16 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 00:04:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 00:04:40] [INFO ] Computed 77 place invariants in 9 ms
[2023-03-16 00:04:40] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
[2023-03-16 00:04:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:40] [INFO ] Invariant cache hit.
[2023-03-16 00:04:40] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-16 00:04:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:40] [INFO ] Invariant cache hit.
[2023-03-16 00:04:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:42] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2023-03-16 00:04:42] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:42] [INFO ] Invariant cache hit.
[2023-03-16 00:04:42] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2819 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GT 1 s98), p0:(LEQ s197 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s...], 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]]
Product exploration explored 100000 steps with 6901 reset in 298 ms.
Product exploration explored 100000 steps with 6925 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X p0), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 664 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 00:04:44] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:44] [INFO ] Invariant cache hit.
[2023-03-16 00:04:44] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:04:44] [INFO ] [Nat]Absence check using 71 positive place invariants in 15 ms returned sat
[2023-03-16 00:04:44] [INFO ] [Nat]Absence check using 71 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-16 00:04:45] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:04:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:45] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:04:45] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-16 00:04:45] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 35 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 649/649 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 483 transition count 616
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 68 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 138 place count 414 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 413 transition count 579
Applied a total of 140 rules in 42 ms. Remains 413 /483 variables (removed 70) and now considering 579/649 (removed 70) transitions.
[2023-03-16 00:04:45] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2023-03-16 00:04:45] [INFO ] Computed 77 place invariants in 9 ms
[2023-03-16 00:04:45] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 413/483 places, 579/649 transitions.
Finished random walk after 299 steps, including 12 resets, run visited all 2 properties in 5 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X p0), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 497 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 35 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Applied a total of 0 rules in 10 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2023-03-16 00:04:46] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 00:04:46] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-16 00:04:46] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
[2023-03-16 00:04:46] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:46] [INFO ] Invariant cache hit.
[2023-03-16 00:04:47] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-16 00:04:47] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:47] [INFO ] Invariant cache hit.
[2023-03-16 00:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:49] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
[2023-03-16 00:04:49] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:49] [INFO ] Invariant cache hit.
[2023-03-16 00:04:49] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2942 ms. Remains : 483/483 places, 649/649 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 p2 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 521 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 686 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 00:04:50] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:04:50] [INFO ] Invariant cache hit.
[2023-03-16 00:04:50] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:04:50] [INFO ] [Nat]Absence check using 71 positive place invariants in 18 ms returned sat
[2023-03-16 00:04:50] [INFO ] [Nat]Absence check using 71 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-16 00:04:50] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:04:51] [INFO ] After 107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:04:51] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-16 00:04:51] [INFO ] After 778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 649/649 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 483 transition count 616
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 68 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 138 place count 414 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 413 transition count 579
Applied a total of 140 rules in 34 ms. Remains 413 /483 variables (removed 70) and now considering 579/649 (removed 70) transitions.
[2023-03-16 00:04:51] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2023-03-16 00:04:51] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-16 00:04:51] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 413/483 places, 579/649 transitions.
Finished random walk after 549 steps, including 29 resets, run visited all 2 properties in 8 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 736 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6854 reset in 283 ms.
Product exploration explored 100000 steps with 6887 reset in 281 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 35 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 483 transition count 649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 483 transition count 650
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 483 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 482 transition count 649
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 482 transition count 649
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 482 transition count 649
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 105 place count 449 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 138 place count 449 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 138 rules in 94 ms. Remains 449 /483 variables (removed 34) and now considering 616/649 (removed 33) transitions.
[2023-03-16 00:04:53] [INFO ] Flow matrix only has 612 transitions (discarded 4 similar events)
// Phase 1: matrix 612 rows 449 cols
[2023-03-16 00:04:53] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-16 00:04:54] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
[2023-03-16 00:04:54] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 00:04:54] [INFO ] Flow matrix only has 612 transitions (discarded 4 similar events)
[2023-03-16 00:04:54] [INFO ] Invariant cache hit.
[2023-03-16 00:04:54] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 449/483 places, 616/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 804 ms. Remains : 449/483 places, 616/649 transitions.
Built C files in :
/tmp/ltsmin14299890609574905809
[2023-03-16 00:04:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14299890609574905809
Running compilation step : cd /tmp/ltsmin14299890609574905809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin14299890609574905809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14299890609574905809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3603370975799577617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2023-03-16 00:05:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 00:05:09] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-16 00:05:09] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
[2023-03-16 00:05:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:05:09] [INFO ] Invariant cache hit.
[2023-03-16 00:05:10] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-16 00:05:10] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:05:10] [INFO ] Invariant cache hit.
[2023-03-16 00:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:05:12] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
[2023-03-16 00:05:12] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 00:05:12] [INFO ] Invariant cache hit.
[2023-03-16 00:05:12] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2882 ms. Remains : 483/483 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin15297944350345837496
[2023-03-16 00:05:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15297944350345837496
Running compilation step : cd /tmp/ltsmin15297944350345837496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1039 ms.
Running link step : cd /tmp/ltsmin15297944350345837496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15297944350345837496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14677215799540922716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 00:05:27] [INFO ] Flatten gal took : 38 ms
[2023-03-16 00:05:27] [INFO ] Flatten gal took : 38 ms
[2023-03-16 00:05:27] [INFO ] Time to serialize gal into /tmp/LTL8409250566426564483.gal : 6 ms
[2023-03-16 00:05:27] [INFO ] Time to serialize properties into /tmp/LTL17936184288869691741.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8409250566426564483.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15676385321234888001.hoa' '-atoms' '/tmp/LTL17936184288869691741.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17936184288869691741.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15676385321234888001.hoa
Detected timeout of ITS tools.
[2023-03-16 00:05:42] [INFO ] Flatten gal took : 32 ms
[2023-03-16 00:05:42] [INFO ] Flatten gal took : 32 ms
[2023-03-16 00:05:42] [INFO ] Time to serialize gal into /tmp/LTL9978138584288489847.gal : 4 ms
[2023-03-16 00:05:42] [INFO ] Time to serialize properties into /tmp/LTL1055975850037269507.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9978138584288489847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1055975850037269507.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((G("(NotifyEventEndOfCheckSourcesB_0<=(((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJo...1080
Formula 0 simplified : (F!"(NotifyEventEndOfCheckSourcesB_0<=(((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB...1067
Detected timeout of ITS tools.
[2023-03-16 00:05:57] [INFO ] Flatten gal took : 29 ms
[2023-03-16 00:05:57] [INFO ] Applying decomposition
[2023-03-16 00:05:58] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7678312226142755233.txt' '-o' '/tmp/graph7678312226142755233.bin' '-w' '/tmp/graph7678312226142755233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7678312226142755233.bin' '-l' '-1' '-v' '-w' '/tmp/graph7678312226142755233.weights' '-q' '0' '-e' '0.001'
[2023-03-16 00:05:58] [INFO ] Decomposing Gal with order
[2023-03-16 00:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:05:58] [INFO ] Removed a total of 748 redundant transitions.
[2023-03-16 00:05:58] [INFO ] Flatten gal took : 205 ms
[2023-03-16 00:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 28 ms.
[2023-03-16 00:05:58] [INFO ] Time to serialize gal into /tmp/LTL12476902998453790468.gal : 11 ms
[2023-03-16 00:05:59] [INFO ] Time to serialize properties into /tmp/LTL2952836911510674190.ltl : 374 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12476902998453790468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2952836911510674190.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("(gu16.NotifyEventEndOfCheckSourcesB_0<=(((((gu16.QueueJobB_0+gu16.QueueJobB_1)+(gu16.QueueJobB_2+gu16.QueueJobB_3))+((gu16.Que...1438
Formula 0 simplified : (F!"(gu16.NotifyEventEndOfCheckSourcesB_0<=(((((gu16.QueueJobB_0+gu16.QueueJobB_1)+(gu16.QueueJobB_2+gu16.QueueJobB_3))+((gu16.Queue...1425
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15466743271460532962
[2023-03-16 00:06:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15466743271460532962
Running compilation step : cd /tmp/ltsmin15466743271460532962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1039 ms.
Running link step : cd /tmp/ltsmin15466743271460532962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15466743271460532962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-12 finished in 109049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 37 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 484 transition count 647
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 481 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 480 transition count 646
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 480 transition count 643
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 477 transition count 643
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 476 transition count 642
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 476 transition count 642
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 474 transition count 640
Applied a total of 20 rules in 73 ms. Remains 474 /484 variables (removed 10) and now considering 640/650 (removed 10) transitions.
[2023-03-16 00:06:29] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
// Phase 1: matrix 636 rows 474 cols
[2023-03-16 00:06:29] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-16 00:06:29] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
[2023-03-16 00:06:29] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:29] [INFO ] Invariant cache hit.
[2023-03-16 00:06:30] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 00:06:30] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:30] [INFO ] Invariant cache hit.
[2023-03-16 00:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:06:31] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
[2023-03-16 00:06:31] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 00:06:31] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:31] [INFO ] Invariant cache hit.
[2023-03-16 00:06:32] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 474/484 places, 640/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3139 ms. Remains : 474/484 places, 640/650 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s359 s360 s361 s362 s363) (ADD s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 ...], 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 7129 reset in 353 ms.
Product exploration explored 100000 steps with 7078 reset in 420 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 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 39 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 37 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 640/640 transitions.
Applied a total of 0 rules in 17 ms. Remains 474 /474 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2023-03-16 00:06:33] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:33] [INFO ] Invariant cache hit.
[2023-03-16 00:06:33] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
[2023-03-16 00:06:33] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:33] [INFO ] Invariant cache hit.
[2023-03-16 00:06:34] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-16 00:06:34] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:34] [INFO ] Invariant cache hit.
[2023-03-16 00:06:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:06:35] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2023-03-16 00:06:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 00:06:35] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:35] [INFO ] Invariant cache hit.
[2023-03-16 00:06:36] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2553 ms. Remains : 474/474 places, 640/640 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 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 89 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7022 reset in 361 ms.
Product exploration explored 100000 steps with 6982 reset in 373 ms.
Built C files in :
/tmp/ltsmin11679718819919296615
[2023-03-16 00:06:37] [INFO ] Computing symmetric may disable matrix : 640 transitions.
[2023-03-16 00:06:37] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:06:37] [INFO ] Computing symmetric may enable matrix : 640 transitions.
[2023-03-16 00:06:37] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:06:37] [INFO ] Computing Do-Not-Accords matrix : 640 transitions.
[2023-03-16 00:06:37] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:06:37] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11679718819919296615
Running compilation step : cd /tmp/ltsmin11679718819919296615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1589 ms.
Running link step : cd /tmp/ltsmin11679718819919296615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11679718819919296615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16379137812820409083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 37 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 640/640 transitions.
Applied a total of 0 rules in 20 ms. Remains 474 /474 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2023-03-16 00:06:52] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:52] [INFO ] Invariant cache hit.
[2023-03-16 00:06:52] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
[2023-03-16 00:06:52] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:52] [INFO ] Invariant cache hit.
[2023-03-16 00:06:52] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-16 00:06:52] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:52] [INFO ] Invariant cache hit.
[2023-03-16 00:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:06:54] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-16 00:06:54] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 00:06:54] [INFO ] Flow matrix only has 636 transitions (discarded 4 similar events)
[2023-03-16 00:06:54] [INFO ] Invariant cache hit.
[2023-03-16 00:06:54] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2543 ms. Remains : 474/474 places, 640/640 transitions.
Built C files in :
/tmp/ltsmin2542398532646824620
[2023-03-16 00:06:54] [INFO ] Computing symmetric may disable matrix : 640 transitions.
[2023-03-16 00:06:54] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:06:54] [INFO ] Computing symmetric may enable matrix : 640 transitions.
[2023-03-16 00:06:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:06:54] [INFO ] Computing Do-Not-Accords matrix : 640 transitions.
[2023-03-16 00:06:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:06:54] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2542398532646824620
Running compilation step : cd /tmp/ltsmin2542398532646824620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1552 ms.
Running link step : cd /tmp/ltsmin2542398532646824620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2542398532646824620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9232718424706353982.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 00:07:09] [INFO ] Flatten gal took : 31 ms
[2023-03-16 00:07:09] [INFO ] Flatten gal took : 28 ms
[2023-03-16 00:07:09] [INFO ] Time to serialize gal into /tmp/LTL17119538536731552566.gal : 5 ms
[2023-03-16 00:07:09] [INFO ] Time to serialize properties into /tmp/LTL17829977129927900249.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17119538536731552566.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5105400582418854691.hoa' '-atoms' '/tmp/LTL17829977129927900249.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17829977129927900249.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5105400582418854691.hoa
Detected timeout of ITS tools.
[2023-03-16 00:07:25] [INFO ] Flatten gal took : 26 ms
[2023-03-16 00:07:25] [INFO ] Flatten gal took : 26 ms
[2023-03-16 00:07:25] [INFO ] Time to serialize gal into /tmp/LTL15303004603971184338.gal : 5 ms
[2023-03-16 00:07:25] [INFO ] Time to serialize properties into /tmp/LTL8899739021517569419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15303004603971184338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8899739021517569419.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((place_482_0+place_482_1)+(place_482_2+place_482_3))+place_482_4)<=(((((Schedule_Task_E_0+Schedule_Task_E_1)+(Schedule_Task...764
Formula 0 simplified : GF!"((((place_482_0+place_482_1)+(place_482_2+place_482_3))+place_482_4)<=(((((Schedule_Task_E_0+Schedule_Task_E_1)+(Schedule_Task_E...758
Detected timeout of ITS tools.
[2023-03-16 00:07:40] [INFO ] Flatten gal took : 29 ms
[2023-03-16 00:07:40] [INFO ] Applying decomposition
[2023-03-16 00:07:40] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5341315382315861726.txt' '-o' '/tmp/graph5341315382315861726.bin' '-w' '/tmp/graph5341315382315861726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5341315382315861726.bin' '-l' '-1' '-v' '-w' '/tmp/graph5341315382315861726.weights' '-q' '0' '-e' '0.001'
[2023-03-16 00:07:40] [INFO ] Decomposing Gal with order
[2023-03-16 00:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:07:40] [INFO ] Removed a total of 482 redundant transitions.
[2023-03-16 00:07:40] [INFO ] Flatten gal took : 93 ms
[2023-03-16 00:07:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 319 labels/synchronizations in 17 ms.
[2023-03-16 00:07:40] [INFO ] Time to serialize gal into /tmp/LTL6347993951127488154.gal : 8 ms
[2023-03-16 00:07:40] [INFO ] Time to serialize properties into /tmp/LTL7906184597801976736.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6347993951127488154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7906184597801976736.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gu34.place_482_0+gu34.place_482_1)+(gu34.place_482_2+gu34.place_482_3))+gu34.place_482_4)<=(((((gu34.Schedule_Task_E_0+gu3...949
Formula 0 simplified : GF!"((((gu34.place_482_0+gu34.place_482_1)+(gu34.place_482_2+gu34.place_482_3))+gu34.place_482_4)<=(((((gu34.Schedule_Task_E_0+gu34....943
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4355140213811464775
[2023-03-16 00:07:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4355140213811464775
Running compilation step : cd /tmp/ltsmin4355140213811464775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin4355140213811464775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4355140213811464775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-13 finished in 101455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 484 transition count 616
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 70 place count 449 transition count 581
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 138 place count 415 transition count 581
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 413 transition count 579
Applied a total of 142 rules in 44 ms. Remains 413 /484 variables (removed 71) and now considering 579/650 (removed 71) transitions.
[2023-03-16 00:08:10] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2023-03-16 00:08:10] [INFO ] Computed 77 place invariants in 17 ms
[2023-03-16 00:08:10] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
[2023-03-16 00:08:10] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:10] [INFO ] Invariant cache hit.
[2023-03-16 00:08:11] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-16 00:08:11] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:11] [INFO ] Invariant cache hit.
[2023-03-16 00:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:08:12] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
[2023-03-16 00:08:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 00:08:12] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:12] [INFO ] Invariant cache hit.
[2023-03-16 00:08:12] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/484 places, 579/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2119 ms. Remains : 413/484 places, 579/650 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-14 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:(GT s195 s407)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 32 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-14 finished in 2224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(F((p0&&F(G(p2)))))))'
Found a Shortening insensitive property : PolyORBNT-COL-S05J30-LTLCardinality-12
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 35 out of 484 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 484 transition count 616
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 413 transition count 579
Applied a total of 142 rules in 29 ms. Remains 413 /484 variables (removed 71) and now considering 579/650 (removed 71) transitions.
[2023-03-16 00:08:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2023-03-16 00:08:13] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-16 00:08:13] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
[2023-03-16 00:08:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:13] [INFO ] Invariant cache hit.
[2023-03-16 00:08:13] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-16 00:08:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:13] [INFO ] Invariant cache hit.
[2023-03-16 00:08:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:08:15] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2023-03-16 00:08:15] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:15] [INFO ] Invariant cache hit.
[2023-03-16 00:08:15] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 413/484 places, 579/650 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2271 ms. Remains : 413/484 places, 579/650 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GT 1 s98), p0:(LEQ s195 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5087 reset in 378 ms.
Product exploration explored 100000 steps with 5107 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X p0), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 603 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Finished random walk after 132 steps, including 6 resets, run visited all 6 properties in 9 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X p0), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 511 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 35 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 579/579 transitions.
Applied a total of 0 rules in 12 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2023-03-16 00:08:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:18] [INFO ] Invariant cache hit.
[2023-03-16 00:08:18] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
[2023-03-16 00:08:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:18] [INFO ] Invariant cache hit.
[2023-03-16 00:08:18] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-16 00:08:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:18] [INFO ] Invariant cache hit.
[2023-03-16 00:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:08:19] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
[2023-03-16 00:08:19] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:19] [INFO ] Invariant cache hit.
[2023-03-16 00:08:20] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2175 ms. Remains : 413/413 places, 579/579 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 p2 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 596 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Finished random walk after 205 steps, including 8 resets, run visited all 6 properties in 6 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 616 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5061 reset in 378 ms.
Product exploration explored 100000 steps with 5055 reset in 406 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 35 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 579/579 transitions.
Applied a total of 0 rules in 9 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2023-03-16 00:08:23] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:23] [INFO ] Invariant cache hit.
[2023-03-16 00:08:23] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
[2023-03-16 00:08:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 00:08:23] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:23] [INFO ] Invariant cache hit.
[2023-03-16 00:08:23] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 632 ms. Remains : 413/413 places, 579/579 transitions.
Built C files in :
/tmp/ltsmin12943958438585000867
[2023-03-16 00:08:23] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12943958438585000867
Running compilation step : cd /tmp/ltsmin12943958438585000867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 952 ms.
Running link step : cd /tmp/ltsmin12943958438585000867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12943958438585000867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13696858183773422421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 579/579 transitions.
Applied a total of 0 rules in 12 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2023-03-16 00:08:38] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:38] [INFO ] Invariant cache hit.
[2023-03-16 00:08:39] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
[2023-03-16 00:08:39] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:39] [INFO ] Invariant cache hit.
[2023-03-16 00:08:39] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-16 00:08:39] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:39] [INFO ] Invariant cache hit.
[2023-03-16 00:08:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:08:40] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
[2023-03-16 00:08:40] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2023-03-16 00:08:40] [INFO ] Invariant cache hit.
[2023-03-16 00:08:41] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2297 ms. Remains : 413/413 places, 579/579 transitions.
Built C files in :
/tmp/ltsmin4857128056522553517
[2023-03-16 00:08:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4857128056522553517
Running compilation step : cd /tmp/ltsmin4857128056522553517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 940 ms.
Running link step : cd /tmp/ltsmin4857128056522553517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4857128056522553517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10763054452188314177.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 00:08:56] [INFO ] Flatten gal took : 22 ms
[2023-03-16 00:08:56] [INFO ] Flatten gal took : 23 ms
[2023-03-16 00:08:56] [INFO ] Time to serialize gal into /tmp/LTL15575997356872143588.gal : 4 ms
[2023-03-16 00:08:56] [INFO ] Time to serialize properties into /tmp/LTL8170413591693953366.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15575997356872143588.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17888147118523189497.hoa' '-atoms' '/tmp/LTL8170413591693953366.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8170413591693953366.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17888147118523189497.hoa
Detected timeout of ITS tools.
[2023-03-16 00:09:11] [INFO ] Flatten gal took : 20 ms
[2023-03-16 00:09:11] [INFO ] Flatten gal took : 19 ms
[2023-03-16 00:09:11] [INFO ] Time to serialize gal into /tmp/LTL13944171136087612774.gal : 5 ms
[2023-03-16 00:09:11] [INFO ] Time to serialize properties into /tmp/LTL4892164487963983642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13944171136087612774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4892164487963983642.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("(NotifyEventEndOfCheckSourcesB_0<=(((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJo...1080
Formula 0 simplified : (F!"(NotifyEventEndOfCheckSourcesB_0<=(((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB...1067
Detected timeout of ITS tools.
[2023-03-16 00:09:26] [INFO ] Flatten gal took : 19 ms
[2023-03-16 00:09:26] [INFO ] Applying decomposition
[2023-03-16 00:09:26] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2951614822299335011.txt' '-o' '/tmp/graph2951614822299335011.bin' '-w' '/tmp/graph2951614822299335011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2951614822299335011.bin' '-l' '-1' '-v' '-w' '/tmp/graph2951614822299335011.weights' '-q' '0' '-e' '0.001'
[2023-03-16 00:09:26] [INFO ] Decomposing Gal with order
[2023-03-16 00:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:09:26] [INFO ] Removed a total of 253 redundant transitions.
[2023-03-16 00:09:26] [INFO ] Flatten gal took : 73 ms
[2023-03-16 00:09:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 13 ms.
[2023-03-16 00:09:26] [INFO ] Time to serialize gal into /tmp/LTL15201243457794261331.gal : 4 ms
[2023-03-16 00:09:26] [INFO ] Time to serialize properties into /tmp/LTL5505779138966765353.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15201243457794261331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5505779138966765353.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("(gu1.NotifyEventEndOfCheckSourcesB_0<=(((((gu1.QueueJobB_0+gu1.QueueJobB_1)+(gu1.QueueJobB_2+gu1.QueueJobB_3))+((gu1.QueueJobB...1362
Formula 0 simplified : (F!"(gu1.NotifyEventEndOfCheckSourcesB_0<=(((((gu1.QueueJobB_0+gu1.QueueJobB_1)+(gu1.QueueJobB_2+gu1.QueueJobB_3))+((gu1.QueueJobB_4...1349
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin700713322397493117
[2023-03-16 00:09:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin700713322397493117
Running compilation step : cd /tmp/ltsmin700713322397493117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 952 ms.
Running link step : cd /tmp/ltsmin700713322397493117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin700713322397493117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J30-LTLCardinality-12 finished in 103996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-16 00:09:56] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17703350273980010428
[2023-03-16 00:09:56] [INFO ] Computing symmetric may disable matrix : 650 transitions.
[2023-03-16 00:09:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:09:56] [INFO ] Computing symmetric may enable matrix : 650 transitions.
[2023-03-16 00:09:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:09:56] [INFO ] Applying decomposition
[2023-03-16 00:09:57] [INFO ] Flatten gal took : 36 ms
[2023-03-16 00:09:57] [INFO ] Computing Do-Not-Accords matrix : 650 transitions.
[2023-03-16 00:09:57] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 00:09:57] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17703350273980010428
Running compilation step : cd /tmp/ltsmin17703350273980010428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16419772293667723494.txt' '-o' '/tmp/graph16419772293667723494.bin' '-w' '/tmp/graph16419772293667723494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16419772293667723494.bin' '-l' '-1' '-v' '-w' '/tmp/graph16419772293667723494.weights' '-q' '0' '-e' '0.001'
[2023-03-16 00:09:57] [INFO ] Decomposing Gal with order
[2023-03-16 00:09:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:09:57] [INFO ] Removed a total of 556 redundant transitions.
[2023-03-16 00:09:57] [INFO ] Flatten gal took : 113 ms
[2023-03-16 00:09:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 847 labels/synchronizations in 57 ms.
[2023-03-16 00:09:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality12468769138316893876.gal : 20 ms
[2023-03-16 00:09:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality9223613260568620187.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12468769138316893876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9223613260568620187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((((G("(gu1.NotifyEventEndOfCheckSourcesB_0<=(((((gu1.QueueJobB_0+gu1.QueueJobB_1)+(gu1.QueueJobB_2+gu1.QueueJobB_3))+((gu1.QueueJobB...1386
Formula 0 simplified : (F!"(gu1.NotifyEventEndOfCheckSourcesB_0<=(((((gu1.QueueJobB_0+gu1.QueueJobB_1)+(gu1.QueueJobB_2+gu1.QueueJobB_3))+((gu1.QueueJobB_4...1373
Compilation finished in 1631 ms.
Running link step : cd /tmp/ltsmin17703350273980010428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17703350273980010428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: LTL layer: formula: (([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.074: "(([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.075: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.371: There are 655 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.371: State length is 485, there are 671 groups
pins2lts-mc-linux64( 0/ 8), 0.371: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.371: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.371: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.371: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.488: [Blue] ~30 levels ~960 states ~4616 transitions
pins2lts-mc-linux64( 3/ 8), 0.556: [Blue] ~30 levels ~1920 states ~7200 transitions
pins2lts-mc-linux64( 1/ 8), 0.716: [Blue] ~30 levels ~3840 states ~10888 transitions
pins2lts-mc-linux64( 1/ 8), 0.912: [Blue] ~30 levels ~7680 states ~21000 transitions
pins2lts-mc-linux64( 1/ 8), 1.328: [Blue] ~30 levels ~15360 states ~39320 transitions
pins2lts-mc-linux64( 1/ 8), 2.131: [Blue] ~30 levels ~30720 states ~76288 transitions
pins2lts-mc-linux64( 1/ 8), 3.391: [Blue] ~30 levels ~61440 states ~146352 transitions
pins2lts-mc-linux64( 1/ 8), 4.580: [Blue] ~30 levels ~122880 states ~300928 transitions
pins2lts-mc-linux64( 1/ 8), 6.879: [Blue] ~30 levels ~245760 states ~632024 transitions
pins2lts-mc-linux64( 1/ 8), 11.015: [Blue] ~30 levels ~491520 states ~1256744 transitions
pins2lts-mc-linux64( 1/ 8), 18.777: [Blue] ~30 levels ~983040 states ~2563416 transitions
pins2lts-mc-linux64( 1/ 8), 33.874: [Blue] ~30 levels ~1966080 states ~5147464 transitions
pins2lts-mc-linux64( 5/ 8), 63.878: [Blue] ~30 levels ~3932160 states ~10461352 transitions
pins2lts-mc-linux64( 5/ 8), 124.379: [Blue] ~30 levels ~7864320 states ~21671528 transitions
pins2lts-mc-linux64( 4/ 8), 250.476: [Blue] ~30 levels ~15728640 states ~43674456 transitions
pins2lts-mc-linux64( 2/ 8), 495.249: [Blue] ~30 levels ~31457280 states ~87505944 transitions
pins2lts-mc-linux64( 0/ 8), 557.994: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 558.045:
pins2lts-mc-linux64( 0/ 8), 558.045: Explored 35123103 states 98415245 transitions, fanout: 2.802
pins2lts-mc-linux64( 0/ 8), 558.045: Total exploration time 557.660 sec (557.590 sec minimum, 557.621 sec on average)
pins2lts-mc-linux64( 0/ 8), 558.045: States per second: 62983, Transitions per second: 176479
pins2lts-mc-linux64( 0/ 8), 558.045:
pins2lts-mc-linux64( 0/ 8), 558.045: State space has 35124942 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 558.045: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 558.045: blue states: 35123103 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 558.045: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 558.045: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 558.045:
pins2lts-mc-linux64( 0/ 8), 558.045: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 558.045:
pins2lts-mc-linux64( 0/ 8), 558.045: Queue width: 8B, total height: 240, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 558.045: Tree memory: 524.0MB, 15.6 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 558.045: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 558.045: Stored 661 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 558.045: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 558.045: Est. total memory use: 524.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17703350273980010428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17703350273980010428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true)) U (LTLAPp1==true))||X(<>(((LTLAPp0==true)&&<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 00:32:15] [INFO ] Applying decomposition
[2023-03-16 00:32:15] [INFO ] Flatten gal took : 228 ms
[2023-03-16 00:32:15] [INFO ] Decomposing Gal with order
[2023-03-16 00:32:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:32:16] [INFO ] Removed a total of 2111 redundant transitions.
[2023-03-16 00:32:16] [INFO ] Flatten gal took : 333 ms
[2023-03-16 00:32:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 65 ms.
[2023-03-16 00:32:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality17032903631933526050.gal : 36 ms
[2023-03-16 00:32:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality8986897042822308409.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17032903631933526050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8986897042822308409.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((((G("(gNotifyEventEndOfCheckSourcesB.NotifyEventEndOfCheckSourcesB_0<=(((((gThreadsJobs0.QueueJobB_0+gThreadsJobs1.QueueJobB_1)+(gT...2084
Formula 0 simplified : (F!"(gNotifyEventEndOfCheckSourcesB.NotifyEventEndOfCheckSourcesB_0<=(((((gThreadsJobs0.QueueJobB_0+gThreadsJobs1.QueueJobB_1)+(gThr...2071
Detected timeout of ITS tools.
[2023-03-16 00:54:38] [INFO ] Flatten gal took : 251 ms
[2023-03-16 00:54:40] [INFO ] Input system was already deterministic with 650 transitions.
[2023-03-16 00:54:40] [INFO ] Transformed 484 places.
[2023-03-16 00:54:40] [INFO ] Transformed 650 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 00:55:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality200403120787404769.gal : 10 ms
[2023-03-16 00:55:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality16338230939385763108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality200403120787404769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16338230939385763108.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((G("(NotifyEventEndOfCheckSourcesB_0<=(((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJo...1080
Formula 0 simplified : (F!"(NotifyEventEndOfCheckSourcesB_0<=(((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB...1067
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1659852 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15866592 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945700643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;