Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.6K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 08:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 08:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 137K May 10 09:33 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 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652702606182

Running Version 202205111006
[2022-05-16 12:03:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 12:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 12:03:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 12:03:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 12:03:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 652 ms
[2022-05-16 12:03:28] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2022-05-16 12:03:28] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 12:03:28] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 10 ms.
[2022-05-16 12:03:28] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10006 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 12:03:28] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 12:03:28] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-16 12:03:28] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2022-05-16 12:03:28] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 12:03:28] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:03:28] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:03:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-05-16 12:03:28] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 12:03:29] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:03:29] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 12:03:29] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 192 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=96 )
Parikh walk visited 1 properties in 2 ms.
[2022-05-16 12:03:29] [INFO ] Flatten gal took : 28 ms
[2022-05-16 12:03:29] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2022-05-16 12:03:29] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 80 ms.
[2022-05-16 12:03:29] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2022-05-16 12:03:29] [INFO ] Reduced 102 identical enabling conditions.
[2022-05-16 12:03:29] [INFO ] Reduced 255 identical enabling conditions.
Deduced a syphon composed of 51 places in 49 ms
Reduce places removed 64 places and 0 transitions.
Support contains 4235 out of 11403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Reduce places removed 168 places and 0 transitions.
Discarding 1020 places :
Implicit places reduction removed 1020 places
Iterating post reduction 0 with 1188 rules applied. Total rules applied 1188 place count 10215 transition count 9336
Discarding 512 places :
Symmetric choice reduction at 1 with 512 rule applications. Total rules 1700 place count 9703 transition count 8824
Iterating global reduction 1 with 512 rules applied. Total rules applied 2212 place count 9703 transition count 8824
Discarding 257 places :
Symmetric choice reduction at 1 with 257 rule applications. Total rules 2469 place count 9446 transition count 8467
Iterating global reduction 1 with 257 rules applied. Total rules applied 2726 place count 9446 transition count 8467
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2777 place count 9395 transition count 8467
Applied a total of 2777 rules in 2879 ms. Remains 9395 /11403 variables (removed 2008) and now considering 8467/9336 (removed 869) transitions.
// Phase 1: matrix 8467 rows 9395 cols
[2022-05-16 12:03:32] [INFO ] Computed 1586 place invariants in 490 ms
[2022-05-16 12:03:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:03:33] [INFO ] Implicit Places using invariants in 1442 ms returned []
// Phase 1: matrix 8467 rows 9395 cols
[2022-05-16 12:03:34] [INFO ] Computed 1586 place invariants in 244 ms
[2022-05-16 12:03:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:03:34] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
// Phase 1: matrix 8467 rows 9395 cols
[2022-05-16 12:03:35] [INFO ] Computed 1586 place invariants in 234 ms
[2022-05-16 12:03:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:03:36] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9395/11403 places, 8467/9336 transitions.
Finished structural reductions, in 1 iterations. Remains : 9395/11403 places, 8467/9336 transitions.
Support contains 4235 out of 9395 places after structural reductions.
[2022-05-16 12:03:36] [INFO ] Flatten gal took : 382 ms
[2022-05-16 12:03:37] [INFO ] Flatten gal took : 272 ms
[2022-05-16 12:03:37] [INFO ] Input system was already deterministic with 8467 transitions.
Finished random walk after 2217 steps, including 0 resets, run visited all 29 properties in 424 ms. (steps per millisecond=5 )
Computed a total of 9395 stabilizing places and 8467 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9395 transition count 8467
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F((G(p2)&&p1)))))'
Support contains 409 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 1020 places :
Implicit places reduction removed 1020 places
Iterating post reduction 0 with 1020 rules applied. Total rules applied 1020 place count 8375 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1733 place count 7662 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2446 place count 7662 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2553 place count 7555 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2660 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2711 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2966 place count 7249 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3221 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3476 place count 6994 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 3731 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3986 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4241 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4496 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4751 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5006 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5261 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5516 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 5771 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6026 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6281 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6536 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 6791 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7046 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7301 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7556 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 7811 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8066 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8321 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8576 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 8831 place count 4444 transition count 4337
Applied a total of 8831 rules in 11427 ms. Remains 4444 /9395 variables (removed 4951) and now considering 4337/8467 (removed 4130) transitions.
// Phase 1: matrix 4337 rows 4444 cols
[2022-05-16 12:03:50] [INFO ] Computed 515 place invariants in 46 ms
[2022-05-16 12:03:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:03:51] [INFO ] Implicit Places using invariants in 1215 ms returned [2832]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4443/9395 places, 4337/8467 transitions.
Applied a total of 0 rules in 308 ms. Remains 4443 /4443 variables (removed 0) and now considering 4337/4337 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4443/9395 places, 4337/8467 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s952 1) (GEQ s969 1)) (AND (GEQ s942 1) (GEQ s969 1)) (AND (GEQ s923 1) (GEQ s969 1)) (AND (GEQ s961 1) (GEQ s969 1)) (AND (GEQ s933 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 53 reset in 2424 ms.
Product exploration explored 100000 steps with 53 reset in 2367 ms.
Computed a total of 4443 stabilizing places and 4337 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4443 transition count 4337
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 6 factoid took 382 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 finished in 19540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X((G(p0) U p1))))&&(!p2 U X(p3))))'
Support contains 1173 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 663 places :
Implicit places reduction removed 663 places
Iterating post reduction 0 with 663 rules applied. Total rules applied 663 place count 8732 transition count 8467
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 764 place count 8631 transition count 8366
Iterating global reduction 1 with 101 rules applied. Total rules applied 865 place count 8631 transition count 8366
Applied a total of 865 rules in 2281 ms. Remains 8631 /9395 variables (removed 764) and now considering 8366/8467 (removed 101) transitions.
// Phase 1: matrix 8366 rows 8631 cols
[2022-05-16 12:04:00] [INFO ] Computed 923 place invariants in 162 ms
[2022-05-16 12:04:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:04:01] [INFO ] Implicit Places using invariants in 1013 ms returned []
// Phase 1: matrix 8366 rows 8631 cols
[2022-05-16 12:04:01] [INFO ] Computed 923 place invariants in 151 ms
[2022-05-16 12:04:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:04:02] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
// Phase 1: matrix 8366 rows 8631 cols
[2022-05-16 12:04:02] [INFO ] Computed 923 place invariants in 154 ms
[2022-05-16 12:04:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:04:03] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8631/9395 places, 8366/8467 transitions.
Finished structural reductions, in 1 iterations. Remains : 8631/9395 places, 8366/8467 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p3) (NOT p1)), (NOT p3), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p2:(OR (GEQ s7823 1) (GEQ s7953 1) (GEQ s7888 1) (GEQ s7827 1) (GEQ s7957 1) (GEQ s7892 1) (GEQ s7815 1) (GEQ s7945 1) (GEQ s7880 1) (GEQ s7949 1) (GEQ s7...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2924 steps with 0 reset in 104 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 finished in 5792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(X(F(X(G(p0)))))))))'
Support contains 102 out of 9395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Graph (complete) has 13107 edges and 9395 vertex of which 8934 are kept as prefixes of interest. Removing 461 places using SCC suffix rule.36 ms
Discarding 461 places :
Also discarding 460 output transitions
Drop transitions removed 460 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 1020 places :
Implicit places reduction removed 1020 places
Drop transitions removed 5202 transitions
Trivial Post-agglo rules discarded 5202 transitions
Performed 5202 trivial Post agglomeration. Transition count delta: 5202
Iterating post reduction 0 with 6222 rules applied. Total rules applied 6223 place count 7863 transition count 2754
Reduce places removed 5202 places and 0 transitions.
Iterating post reduction 1 with 5202 rules applied. Total rules applied 11425 place count 2661 transition count 2754
Performed 816 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 816 Pre rules applied. Total rules applied 11425 place count 2661 transition count 1938
Deduced a syphon composed of 816 places in 0 ms
Ensure Unique test removed 306 places
Reduce places removed 1122 places and 0 transitions.
Iterating global reduction 2 with 1938 rules applied. Total rules applied 13363 place count 1539 transition count 1938
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 13516 place count 1539 transition count 1785
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 13771 place count 1386 transition count 1683
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 14031 place count 1126 transition count 1173
Iterating global reduction 4 with 260 rules applied. Total rules applied 14291 place count 1126 transition count 1173
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 102 rules applied. Total rules applied 14393 place count 1075 transition count 1122
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 14444 place count 1024 transition count 1122
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 14444 place count 1024 transition count 1071
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 14546 place count 973 transition count 1071
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 14801 place count 718 transition count 816
Iterating global reduction 6 with 255 rules applied. Total rules applied 15056 place count 718 transition count 816
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 15311 place count 718 transition count 561
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 15311 place count 718 transition count 510
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 15464 place count 616 transition count 510
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 7 with 255 rules applied. Total rules applied 15719 place count 463 transition count 408
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 15770 place count 412 transition count 357
Applied a total of 15770 rules in 490 ms. Remains 412 /9395 variables (removed 8983) and now considering 357/8467 (removed 8110) transitions.
// Phase 1: matrix 357 rows 412 cols
[2022-05-16 12:04:04] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-16 12:04:04] [INFO ] Implicit Places using invariants in 192 ms returned [102, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 308, 360]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 194 ms to find 54 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/9395 places, 357/8467 transitions.
Reduce places removed 51 places and 51 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 307 transition count 255
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 256 transition count 255
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 256 transition count 204
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 205 transition count 204
Applied a total of 204 rules in 8 ms. Remains 205 /358 variables (removed 153) and now considering 204/357 (removed 153) transitions.
// Phase 1: matrix 204 rows 205 cols
[2022-05-16 12:04:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 12:04:04] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 204 rows 205 cols
[2022-05-16 12:04:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 12:04:04] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 205/9395 places, 204/8467 transitions.
Finished structural reductions, in 2 iterations. Remains : 205/9395 places, 204/8467 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s139 1) (LT s141 1) (LT s135 1) (LT s137 1) (LT s131 1) (LT s133 1) (LT s127 1) (LT s129 1) (LT s151 1) (LT s153 1) (LT s147 1) (LT s149 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 finished in 889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 102 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 1020 places :
Implicit places reduction removed 1020 places
Iterating post reduction 0 with 1020 rules applied. Total rules applied 1020 place count 8375 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1733 place count 7662 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2446 place count 7662 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2553 place count 7555 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2660 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2711 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2966 place count 7249 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3221 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3476 place count 6994 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 3731 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3986 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4241 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4496 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4751 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5006 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5261 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5516 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 5771 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6026 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6281 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6536 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 6791 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7046 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7301 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7556 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 7811 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8066 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8321 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8576 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 8831 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9086 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9341 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9647 place count 4138 transition count 3827
Applied a total of 9647 rules in 11581 ms. Remains 4138 /9395 variables (removed 5257) and now considering 3827/8467 (removed 4640) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 12:04:16] [INFO ] Computed 464 place invariants in 50 ms
[2022-05-16 12:04:17] [INFO ] Implicit Places using invariants in 975 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 977 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9395 places, 3827/8467 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4115 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4115 transition count 3806
Applied a total of 38 rules in 3251 ms. Remains 4115 /4134 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4115 cols
[2022-05-16 12:04:20] [INFO ] Computed 460 place invariants in 44 ms
[2022-05-16 12:04:21] [INFO ] Implicit Places using invariants in 980 ms returned [2490, 2520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 983 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4113/9395 places, 3806/8467 transitions.
Applied a total of 0 rules in 308 ms. Remains 4113 /4113 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4113/9395 places, 3806/8467 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s131 1) (GEQ s129 1) (GEQ s135 1) (GEQ s133 1) (GEQ s139 1) (GEQ s137 1) (GEQ s143 1) (GEQ s141 1) (GEQ s147 1) (GEQ s145 1) (GEQ s151 1) (GEQ...], 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 1707 steps with 0 reset in 20 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 finished in 17252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1)))'
Support contains 153 out of 9395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Graph (complete) has 13107 edges and 9395 vertex of which 7912 are kept as prefixes of interest. Removing 1483 places using SCC suffix rule.9 ms
Discarding 1483 places :
Also discarding 1276 output transitions
Drop transitions removed 1276 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 969 places :
Implicit places reduction removed 969 places
Drop transitions removed 4692 transitions
Trivial Post-agglo rules discarded 4692 transitions
Performed 4692 trivial Post agglomeration. Transition count delta: 4692
Iterating post reduction 0 with 5661 rules applied. Total rules applied 5662 place count 6892 transition count 2448
Reduce places removed 4692 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 4743 rules applied. Total rules applied 10405 place count 2200 transition count 2397
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 10456 place count 2149 transition count 2397
Performed 561 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 561 Pre rules applied. Total rules applied 10456 place count 2149 transition count 1836
Deduced a syphon composed of 561 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 3 with 1275 rules applied. Total rules applied 11731 place count 1435 transition count 1836
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 11884 place count 1435 transition count 1683
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 12139 place count 1282 transition count 1581
Discarding 260 places :
Symmetric choice reduction at 5 with 260 rule applications. Total rules 12399 place count 1022 transition count 1071
Iterating global reduction 5 with 260 rules applied. Total rules applied 12659 place count 1022 transition count 1071
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 51 rules applied. Total rules applied 12710 place count 971 transition count 1071
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 12710 place count 971 transition count 1020
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 12812 place count 920 transition count 1020
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 13067 place count 665 transition count 765
Iterating global reduction 6 with 255 rules applied. Total rules applied 13322 place count 665 transition count 765
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 13577 place count 665 transition count 510
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 13577 place count 665 transition count 459
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 13730 place count 563 transition count 459
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 13883 place count 461 transition count 408
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 13934 place count 410 transition count 357
Applied a total of 13934 rules in 244 ms. Remains 410 /9395 variables (removed 8985) and now considering 357/8467 (removed 8110) transitions.
// Phase 1: matrix 357 rows 410 cols
[2022-05-16 12:04:22] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-16 12:04:22] [INFO ] Implicit Places using invariants in 128 ms returned [51, 307]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 408/9395 places, 357/8467 transitions.
Reduce places removed 51 places and 51 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 357 transition count 255
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 306 transition count 255
Applied a total of 102 rules in 6 ms. Remains 306 /408 variables (removed 102) and now considering 255/357 (removed 102) transitions.
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:22] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-16 12:04:22] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:22] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 306/9395 places, 255/8467 transitions.
Finished structural reductions, in 2 iterations. Remains : 306/9395 places, 255/8467 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s290 1) (GEQ s288 1) (GEQ s294 1) (GEQ s292 1) (GEQ s298 1) (GEQ s296 1) (GEQ s302 1) (GEQ s300 1) (GEQ s304 1) (GEQ s256 1) (GEQ s258 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2100 reset in 694 ms.
Product exploration explored 100000 steps with 2091 reset in 709 ms.
Computed a total of 306 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 306 transition count 255
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 39 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:25] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:25] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 19 ms returned sat
[2022-05-16 12:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:04:25] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-05-16 12:04:25] [INFO ] Computed and/alt/rep : 204/255/204 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 12:04:26] [INFO ] Added : 92 causal constraints over 19 iterations in 463 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:26] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:26] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 10 ms returned sat
[2022-05-16 12:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:04:26] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-16 12:04:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:04:26] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 10 ms returned sat
[2022-05-16 12:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:04:26] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-16 12:04:26] [INFO ] Computed and/alt/rep : 204/255/204 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 12:04:27] [INFO ] Added : 102 causal constraints over 21 iterations in 389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 153 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 306 /306 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:27] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 12:04:27] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:27] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:27] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-05-16 12:04:27] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:27] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 12:04:27] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 255/255 transitions.
Computed a total of 306 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 306 transition count 255
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 70 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:28] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 12:04:28] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 21 ms returned sat
[2022-05-16 12:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:04:28] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-16 12:04:28] [INFO ] Computed and/alt/rep : 204/255/204 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 12:04:29] [INFO ] Added : 92 causal constraints over 19 iterations in 428 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:29] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:29] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 10 ms returned sat
[2022-05-16 12:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:04:29] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-05-16 12:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:04:29] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 10 ms returned sat
[2022-05-16 12:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:04:29] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-16 12:04:29] [INFO ] Computed and/alt/rep : 204/255/204 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 12:04:30] [INFO ] Added : 102 causal constraints over 21 iterations in 359 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2092 reset in 735 ms.
Product exploration explored 100000 steps with 2100 reset in 759 ms.
Built C files in :
/tmp/ltsmin1557654017444256808
[2022-05-16 12:04:31] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2022-05-16 12:04:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:04:31] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2022-05-16 12:04:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:04:31] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2022-05-16 12:04:31] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:04:31] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1557654017444256808
Running compilation step : cd /tmp/ltsmin1557654017444256808;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin1557654017444256808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1557654017444256808;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14050469561237577760.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 153 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:46] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:46] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:46] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 12:04:47] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-05-16 12:04:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 255 rows 306 cols
[2022-05-16 12:04:47] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 12:04:47] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 255/255 transitions.
Built C files in :
/tmp/ltsmin3290097646492343667
[2022-05-16 12:04:47] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2022-05-16 12:04:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:04:47] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2022-05-16 12:04:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:04:47] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2022-05-16 12:04:47] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:04:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3290097646492343667
Running compilation step : cd /tmp/ltsmin3290097646492343667;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin3290097646492343667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3290097646492343667;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6074509998054441078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 12:05:02] [INFO ] Flatten gal took : 7 ms
[2022-05-16 12:05:02] [INFO ] Flatten gal took : 6 ms
[2022-05-16 12:05:02] [INFO ] Time to serialize gal into /tmp/LTL2155247863907495011.gal : 10 ms
[2022-05-16 12:05:02] [INFO ] Time to serialize properties into /tmp/LTL7366803119572238181.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2155247863907495011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7366803119572238181.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2155247...266
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((l21_35>=1)||(l21_33>=1))||((l21_39>=1)||(l21_37>=1)))||(((l21_43>=1)||(l21_41>=1))||((l21_47>=1)||(l21_45>=1))))||((((...2299
Formula 0 simplified : !F("((((((((lc0_8>=1)&&(cl1_8>=1))||((lc0_45>=1)&&(cl1_45>=1)))||(((lc0_13>=1)&&(cl1_13>=1))||((lc0_3>=1)&&(cl1_3>=1))))||((((lc0_35...2292
Reverse transition relation is NOT exact ! Due to transitions t8212, t8213, t8214, t8215, t8216, t8217, t8218, t8219, t8220, t8221, t8222, t8223, t8224, t8...519
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 12:05:17] [INFO ] Flatten gal took : 7 ms
[2022-05-16 12:05:17] [INFO ] Applying decomposition
[2022-05-16 12:05:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8518101987692023001.txt' '-o' '/tmp/graph8518101987692023001.bin' '-w' '/tmp/graph8518101987692023001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8518101987692023001.bin' '-l' '-1' '-v' '-w' '/tmp/graph8518101987692023001.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:05:17] [INFO ] Decomposing Gal with order
[2022-05-16 12:05:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:05:17] [INFO ] Flatten gal took : 30 ms
[2022-05-16 12:05:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 12:05:17] [INFO ] Time to serialize gal into /tmp/LTL548219231919136497.gal : 4 ms
[2022-05-16 12:05:17] [INFO ] Time to serialize properties into /tmp/LTL9865461355596890643.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL548219231919136497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9865461355596890643.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5482192...244
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((i10.u122.l21_35>=1)||(i47.u120.l21_33>=1))||((i14.u125.l21_39>=1)||(i12.u123.l21_37>=1)))||(((i15.u151.l21_43>=1)||(i3...3536
Formula 0 simplified : !F("((((((((i43.u54.lc0_8>=1)&&(i43.u81.cl1_8>=1))||((i39.u73.lc0_45>=1)&&(i39.u98.cl1_45>=1)))||(((i46.u2.lc0_13>=1)&&(i46.u85.cl1_...3529
Reverse transition relation is NOT exact ! Due to transitions i0.u102.t8214, i1.u137.t8217, i2.u112.t8229, i3.u142.t8234, i4.u116.t8237, i5.u144.t8238, i6....968
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16715057115771741986
[2022-05-16 12:05:33] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16715057115771741986
Running compilation step : cd /tmp/ltsmin16715057115771741986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 396 ms.
Running link step : cd /tmp/ltsmin16715057115771741986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16715057115771741986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 finished in 85959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(F(G(G(X(F(p1))))))))'
Support contains 663 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 714 places :
Implicit places reduction removed 714 places
Iterating post reduction 0 with 714 rules applied. Total rules applied 714 place count 8681 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1427 place count 7968 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2140 place count 7968 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2247 place count 7861 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2354 place count 7861 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2405 place count 7810 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2660 place count 7555 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 2915 place count 7555 transition count 7142
Applied a total of 2915 rules in 4597 ms. Remains 7555 /9395 variables (removed 1840) and now considering 7142/8467 (removed 1325) transitions.
// Phase 1: matrix 7142 rows 7555 cols
[2022-05-16 12:05:52] [INFO ] Computed 821 place invariants in 108 ms
[2022-05-16 12:05:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:05:54] [INFO ] Implicit Places using invariants in 2009 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2015 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7554/9395 places, 7142/8467 transitions.
Applied a total of 0 rules in 1022 ms. Remains 7554 /7554 variables (removed 0) and now considering 7142/7142 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7554/9395 places, 7142/8467 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s4243 1) (GEQ s4600 1)) (AND (GEQ s4391 1) (GEQ s4748 1)) (AND (GEQ s4253 1) (GEQ s4610 1)) (AND (GEQ s4406 1) (GEQ s4763 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 finished in 7837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X((X(X(p1))&&G(p2))))))))'
Support contains 255 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 969 places :
Implicit places reduction removed 969 places
Iterating post reduction 0 with 969 rules applied. Total rules applied 969 place count 8426 transition count 8467
Discarding 612 places :
Symmetric choice reduction at 1 with 612 rule applications. Total rules 1581 place count 7814 transition count 7855
Iterating global reduction 1 with 612 rules applied. Total rules applied 2193 place count 7814 transition count 7855
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2300 place count 7707 transition count 7498
Iterating global reduction 1 with 107 rules applied. Total rules applied 2407 place count 7707 transition count 7498
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2458 place count 7656 transition count 7498
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2713 place count 7401 transition count 7243
Iterating global reduction 2 with 255 rules applied. Total rules applied 2968 place count 7401 transition count 7243
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3223 place count 7146 transition count 6988
Iterating global reduction 2 with 255 rules applied. Total rules applied 3478 place count 7146 transition count 6988
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3733 place count 6891 transition count 6733
Iterating global reduction 2 with 255 rules applied. Total rules applied 3988 place count 6891 transition count 6733
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4243 place count 6636 transition count 6478
Iterating global reduction 2 with 255 rules applied. Total rules applied 4498 place count 6636 transition count 6478
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4753 place count 6381 transition count 6223
Iterating global reduction 2 with 255 rules applied. Total rules applied 5008 place count 6381 transition count 6223
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5263 place count 6126 transition count 5968
Iterating global reduction 2 with 255 rules applied. Total rules applied 5518 place count 6126 transition count 5968
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5773 place count 5871 transition count 5713
Iterating global reduction 2 with 255 rules applied. Total rules applied 6028 place count 5871 transition count 5713
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6283 place count 5616 transition count 5458
Iterating global reduction 2 with 255 rules applied. Total rules applied 6538 place count 5616 transition count 5458
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6793 place count 5361 transition count 5203
Iterating global reduction 2 with 255 rules applied. Total rules applied 7048 place count 5361 transition count 5203
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7303 place count 5106 transition count 4948
Iterating global reduction 2 with 255 rules applied. Total rules applied 7558 place count 5106 transition count 4948
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7813 place count 4851 transition count 4693
Iterating global reduction 2 with 255 rules applied. Total rules applied 8068 place count 4851 transition count 4693
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8323 place count 4596 transition count 4438
Iterating global reduction 2 with 255 rules applied. Total rules applied 8578 place count 4596 transition count 4438
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8833 place count 4341 transition count 4183
Iterating global reduction 2 with 255 rules applied. Total rules applied 9088 place count 4341 transition count 4183
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9394 place count 4290 transition count 3928
Applied a total of 9394 rules in 12138 ms. Remains 4290 /9395 variables (removed 5105) and now considering 3928/8467 (removed 4539) transitions.
// Phase 1: matrix 3928 rows 4290 cols
[2022-05-16 12:06:08] [INFO ] Computed 515 place invariants in 47 ms
[2022-05-16 12:06:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:06:09] [INFO ] Implicit Places using invariants in 1100 ms returned [1711, 1717, 1723]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1105 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4287/9395 places, 3928/8467 transitions.
Applied a total of 0 rules in 316 ms. Remains 4287 /4287 variables (removed 0) and now considering 3928/3928 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4287/9395 places, 3928/8467 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=1, aps=[p0:(OR (GEQ s188 1) (GEQ s186 1) (GEQ s192 1) (GEQ s190 1) (GEQ s196 1) (GEQ s194 1) (GEQ s200 1) (GEQ s198 1) (GEQ s202 1) (GEQ s153 1) (GEQ s157 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 1089 ms.
Product exploration explored 100000 steps with 62 reset in 1097 ms.
Computed a total of 4287 stabilizing places and 3928 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4287 transition count 3928
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Finished random walk after 1799 steps, including 0 resets, run visited all 5 properties in 52 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 255 out of 4287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4287/4287 places, 3928/3928 transitions.
Applied a total of 0 rules in 328 ms. Remains 4287 /4287 variables (removed 0) and now considering 3928/3928 (removed 0) transitions.
// Phase 1: matrix 3928 rows 4287 cols
[2022-05-16 12:06:15] [INFO ] Computed 512 place invariants in 96 ms
[2022-05-16 12:06:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:06:16] [INFO ] Implicit Places using invariants in 1215 ms returned [2683]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1218 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4286/4287 places, 3928/3928 transitions.
Applied a total of 0 rules in 310 ms. Remains 4286 /4286 variables (removed 0) and now considering 3928/3928 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4286/4287 places, 3928/3928 transitions.
Computed a total of 4286 stabilizing places and 3928 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4286 transition count 3928
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Finished random walk after 1726 steps, including 0 resets, run visited all 5 properties in 62 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2 p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 408 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 373 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 380 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 63 reset in 1060 ms.
Product exploration explored 100000 steps with 62 reset in 1106 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 255 out of 4286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4286/4286 places, 3928/3928 transitions.
Graph (complete) has 5446 edges and 4286 vertex of which 4285 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1173 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1173 rules applied. Total rules applied 1174 place count 4285 transition count 3927
Performed 1126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1126 Pre rules applied. Total rules applied 1174 place count 4285 transition count 4133
Deduced a syphon composed of 2299 places in 2 ms
Iterating global reduction 1 with 1126 rules applied. Total rules applied 2300 place count 4285 transition count 4133
Discarding 972 places :
Symmetric choice reduction at 1 with 972 rule applications. Total rules 3272 place count 3313 transition count 3161
Deduced a syphon composed of 1327 places in 1 ms
Iterating global reduction 1 with 972 rules applied. Total rules applied 4244 place count 3313 transition count 3161
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 1779 places in 2 ms
Iterating global reduction 1 with 452 rules applied. Total rules applied 4696 place count 3313 transition count 3209
Discarding 302 places :
Symmetric choice reduction at 1 with 302 rule applications. Total rules 4998 place count 3011 transition count 2907
Deduced a syphon composed of 1477 places in 1 ms
Iterating global reduction 1 with 302 rules applied. Total rules applied 5300 place count 3011 transition count 2907
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -210
Deduced a syphon composed of 1531 places in 1 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 5354 place count 3011 transition count 3117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5356 place count 3009 transition count 3111
Deduced a syphon composed of 1529 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5358 place count 3009 transition count 3111
Deduced a syphon composed of 1529 places in 1 ms
Applied a total of 5358 rules in 1483 ms. Remains 3009 /4286 variables (removed 1277) and now considering 3111/3928 (removed 817) transitions.
[2022-05-16 12:06:24] [INFO ] Redundant transitions in 323 ms returned []
// Phase 1: matrix 3111 rows 3009 cols
[2022-05-16 12:06:24] [INFO ] Computed 511 place invariants in 38 ms
[2022-05-16 12:06:26] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3009/4286 places, 3111/3928 transitions.
Finished structural reductions, in 1 iterations. Remains : 3009/4286 places, 3111/3928 transitions.
Product exploration explored 100000 steps with 642 reset in 1407 ms.
Product exploration explored 100000 steps with 642 reset in 1413 ms.
Built C files in :
/tmp/ltsmin12619476193333518295
[2022-05-16 12:06:28] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12619476193333518295
Running compilation step : cd /tmp/ltsmin12619476193333518295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12619476193333518295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12619476193333518295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 255 out of 4286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4286/4286 places, 3928/3928 transitions.
Applied a total of 0 rules in 298 ms. Remains 4286 /4286 variables (removed 0) and now considering 3928/3928 (removed 0) transitions.
// Phase 1: matrix 3928 rows 4286 cols
[2022-05-16 12:06:32] [INFO ] Computed 511 place invariants in 44 ms
[2022-05-16 12:06:33] [INFO ] Implicit Places using invariants in 1403 ms returned [663, 1583, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 2091, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2702, 2703, 3673]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1409 ms to find 102 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4184/4286 places, 3928/3928 transitions.
Applied a total of 0 rules in 330 ms. Remains 4184 /4184 variables (removed 0) and now considering 3928/3928 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4184/4286 places, 3928/3928 transitions.
Built C files in :
/tmp/ltsmin262623910790395114
[2022-05-16 12:06:34] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin262623910790395114
Running compilation step : cd /tmp/ltsmin262623910790395114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin262623910790395114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin262623910790395114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 12:06:37] [INFO ] Flatten gal took : 110 ms
[2022-05-16 12:06:37] [INFO ] Flatten gal took : 110 ms
[2022-05-16 12:06:37] [INFO ] Time to serialize gal into /tmp/LTL4074139796814758958.gal : 36 ms
[2022-05-16 12:06:37] [INFO ] Time to serialize properties into /tmp/LTL9852329525456706704.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4074139796814758958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9852329525456706704.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4074139...266
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((((((l30_35>=1)||(l30_33>=1))||((l30_39>=1)||(l30_37>=1)))||(((l30_43>=1)||(l30_41>=1))||((l30_47>=1)||(l30_45>=1))))||((...3639
Formula 0 simplified : !XX(F"(((((((l30_35>=1)||(l30_33>=1))||((l30_39>=1)||(l30_37>=1)))||(((l30_43>=1)||(l30_41>=1))||((l30_47>=1)||(l30_45>=1))))||((((l...3619
Detected timeout of ITS tools.
[2022-05-16 12:06:52] [INFO ] Flatten gal took : 97 ms
[2022-05-16 12:06:52] [INFO ] Applying decomposition
[2022-05-16 12:06:52] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14633326491337331505.txt' '-o' '/tmp/graph14633326491337331505.bin' '-w' '/tmp/graph14633326491337331505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14633326491337331505.bin' '-l' '-1' '-v' '-w' '/tmp/graph14633326491337331505.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:06:53] [INFO ] Decomposing Gal with order
[2022-05-16 12:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:06:53] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-16 12:06:54] [INFO ] Flatten gal took : 237 ms
[2022-05-16 12:06:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 40 ms.
[2022-05-16 12:06:54] [INFO ] Time to serialize gal into /tmp/LTL2984841678369013470.gal : 42 ms
[2022-05-16 12:06:54] [INFO ] Time to serialize properties into /tmp/LTL14998036987335605730.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2984841678369013470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14998036987335605730.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2984841...246
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((((((i58.u141.l30_35>=1)||(i1.i1.i1.u96.l30_33>=1))||((i14.i0.i0.u99.l30_39>=1)||(i8.i0.i3.u97.l30_37>=1)))||(((i55.i3.i0...6897
Formula 0 simplified : !XX(F"(((((((i58.u141.l30_35>=1)||(i1.i1.i1.u96.l30_33>=1))||((i14.i0.i0.u99.l30_39>=1)||(i8.i0.i3.u97.l30_37>=1)))||(((i55.i3.i0.u1...6877
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12585923502824735953
[2022-05-16 12:07:09] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12585923502824735953
Running compilation step : cd /tmp/ltsmin12585923502824735953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12585923502824735953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12585923502824735953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 finished in 76655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&X(G(p1))))'
Support contains 102 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 1020 places :
Implicit places reduction removed 1020 places
Iterating post reduction 0 with 1020 rules applied. Total rules applied 1020 place count 8375 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1733 place count 7662 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2446 place count 7662 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2553 place count 7555 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2660 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2711 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2966 place count 7249 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3221 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3476 place count 6994 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 3731 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3986 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4241 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4496 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4751 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5006 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5261 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5516 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 5771 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6026 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6281 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6536 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 6791 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7046 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7301 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7556 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 7811 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8066 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8321 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8576 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 8831 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9086 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9341 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9647 place count 4138 transition count 3827
Applied a total of 9647 rules in 12199 ms. Remains 4138 /9395 variables (removed 5257) and now considering 3827/8467 (removed 4640) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 12:07:24] [INFO ] Computed 464 place invariants in 42 ms
[2022-05-16 12:07:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:07:25] [INFO ] Implicit Places using invariants in 1150 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1153 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9395 places, 3827/8467 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4115 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4115 transition count 3806
Applied a total of 38 rules in 3030 ms. Remains 4115 /4134 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4115 cols
[2022-05-16 12:07:29] [INFO ] Computed 460 place invariants in 43 ms
[2022-05-16 12:07:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:07:30] [INFO ] Implicit Places using invariants in 1132 ms returned [2490, 2520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1135 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4113/9395 places, 3806/8467 transitions.
Applied a total of 0 rules in 321 ms. Remains 4113 /4113 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4113/9395 places, 3806/8467 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s3756 1) (GEQ s3760 1) (GEQ s3758 1) (GEQ s3764 1) (GEQ s3762 1) (GEQ s3768 1) (GEQ s3766 1) (GEQ s3772 1) (GEQ s3770 1) (GEQ s3776 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 finished in 17978 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U p1))) U (!p2 U p1))))'
Support contains 714 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 714 places :
Implicit places reduction removed 714 places
Iterating post reduction 0 with 714 rules applied. Total rules applied 714 place count 8681 transition count 8467
Discarding 458 places :
Symmetric choice reduction at 1 with 458 rule applications. Total rules 1172 place count 8223 transition count 8009
Iterating global reduction 1 with 458 rules applied. Total rules applied 1630 place count 8223 transition count 8009
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 1737 place count 8116 transition count 7652
Iterating global reduction 1 with 107 rules applied. Total rules applied 1844 place count 8116 transition count 7652
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1895 place count 8065 transition count 7652
Applied a total of 1895 rules in 3348 ms. Remains 8065 /9395 variables (removed 1330) and now considering 7652/8467 (removed 815) transitions.
// Phase 1: matrix 7652 rows 8065 cols
[2022-05-16 12:07:34] [INFO ] Computed 821 place invariants in 141 ms
[2022-05-16 12:07:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:07:35] [INFO ] Implicit Places using invariants in 1964 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1971 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8064/9395 places, 7652/8467 transitions.
Applied a total of 0 rules in 1090 ms. Remains 8064 /8064 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8064/9395 places, 7652/8467 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 3}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s5763 1) (GEQ s5759 1) (GEQ s5761 1) (GEQ s5755 1) (GEQ s5757 1) (GEQ s5751 1) (GEQ s5753 1) (GEQ s5714 1) (GEQ s5716 1) (GEQ s5731 1) (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 1433 ms.
Product exploration explored 100000 steps with 203 reset in 1550 ms.
Computed a total of 8064 stabilizing places and 7652 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8064 transition count 7652
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 471 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1690 steps, including 0 resets, run visited all 5 properties in 35 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (OR p1 p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 13 factoid took 677 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 7652 rows 8064 cols
[2022-05-16 12:07:44] [INFO ] Computed 820 place invariants in 119 ms
[2022-05-16 12:07:57] [INFO ] [Real]Absence check using 0 positive and 820 generalized place invariants in 2485 ms returned sat
[2022-05-16 12:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:59] [INFO ] [Real]Absence check using state equation in 2334 ms returned unknown
Could not prove EG (NOT p1)
Support contains 714 out of 8064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8064/8064 places, 7652/7652 transitions.
Applied a total of 0 rules in 1101 ms. Remains 8064 /8064 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
// Phase 1: matrix 7652 rows 8064 cols
[2022-05-16 12:08:00] [INFO ] Computed 820 place invariants in 129 ms
[2022-05-16 12:08:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:08:02] [INFO ] Implicit Places using invariants in 1920 ms returned [6449]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1930 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8063/8064 places, 7652/7652 transitions.
Applied a total of 0 rules in 1088 ms. Remains 8063 /8063 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8063/8064 places, 7652/7652 transitions.
Computed a total of 8063 stabilizing places and 7652 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8063 transition count 7652
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1636 steps, including 0 resets, run visited all 5 properties in 39 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (OR p1 p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 572 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 7652 rows 8063 cols
[2022-05-16 12:08:08] [INFO ] Computed 819 place invariants in 116 ms
[2022-05-16 12:08:20] [INFO ] [Real]Absence check using 0 positive and 819 generalized place invariants in 1698 ms returned sat
[2022-05-16 12:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:08:23] [INFO ] [Real]Absence check using state equation in 2940 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 206 reset in 1180 ms.
Product exploration explored 100000 steps with 209 reset in 1196 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 714 out of 8063 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8063/8063 places, 7652/7652 transitions.
Graph (complete) has 10345 edges and 8063 vertex of which 7242 are kept as prefixes of interest. Removing 821 places using SCC suffix rule.7 ms
Discarding 821 places :
Also discarding 767 output transitions
Drop transitions removed 767 transitions
Performed 2193 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2193 rules applied. Total rules applied 2194 place count 7242 transition count 6885
Performed 2250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2250 Pre rules applied. Total rules applied 2194 place count 7242 transition count 7089
Deduced a syphon composed of 4443 places in 7 ms
Iterating global reduction 1 with 2250 rules applied. Total rules applied 4444 place count 7242 transition count 7089
Discarding 2358 places :
Symmetric choice reduction at 1 with 2358 rule applications. Total rules 6802 place count 4884 transition count 4731
Deduced a syphon composed of 2085 places in 2 ms
Iterating global reduction 1 with 2358 rules applied. Total rules applied 9160 place count 4884 transition count 4731
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: -255
Deduced a syphon composed of 2391 places in 2 ms
Iterating global reduction 1 with 306 rules applied. Total rules applied 9466 place count 4884 transition count 4986
Discarding 204 places :
Symmetric choice reduction at 1 with 204 rule applications. Total rules 9670 place count 4680 transition count 4782
Deduced a syphon composed of 2187 places in 1 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 9874 place count 4680 transition count 4782
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -204
Deduced a syphon composed of 2238 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 9925 place count 4680 transition count 4986
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9926 place count 4679 transition count 4983
Deduced a syphon composed of 2237 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9927 place count 4679 transition count 4983
Deduced a syphon composed of 2237 places in 1 ms
Applied a total of 9927 rules in 2098 ms. Remains 4679 /8063 variables (removed 3384) and now considering 4983/7652 (removed 2669) transitions.
[2022-05-16 12:08:28] [INFO ] Redundant transitions in 286 ms returned []
// Phase 1: matrix 4983 rows 4679 cols
[2022-05-16 12:08:28] [INFO ] Computed 714 place invariants in 81 ms
[2022-05-16 12:08:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:08:31] [INFO ] Dead Transitions using invariants and state equation in 2982 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4679/8063 places, 4983/7652 transitions.
Finished structural reductions, in 1 iterations. Remains : 4679/8063 places, 4983/7652 transitions.
Product exploration explored 100000 steps with 827 reset in 1831 ms.
Product exploration explored 100000 steps with 823 reset in 1873 ms.
Built C files in :
/tmp/ltsmin9503499956731309755
[2022-05-16 12:08:35] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9503499956731309755
Running compilation step : cd /tmp/ltsmin9503499956731309755;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9503499956731309755;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9503499956731309755;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 714 out of 8063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8063/8063 places, 7652/7652 transitions.
Applied a total of 0 rules in 1055 ms. Remains 8063 /8063 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
// Phase 1: matrix 7652 rows 8063 cols
[2022-05-16 12:08:39] [INFO ] Computed 819 place invariants in 117 ms
[2022-05-16 12:08:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:08:41] [INFO ] Implicit Places using invariants in 1937 ms returned [6472]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1957 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8062/8063 places, 7652/7652 transitions.
Applied a total of 0 rules in 1125 ms. Remains 8062 /8062 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8062/8063 places, 7652/7652 transitions.
Built C files in :
/tmp/ltsmin8933162117888511914
[2022-05-16 12:08:42] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8933162117888511914
Running compilation step : cd /tmp/ltsmin8933162117888511914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8933162117888511914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8933162117888511914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 12:08:45] [INFO ] Flatten gal took : 195 ms
[2022-05-16 12:08:46] [INFO ] Flatten gal took : 204 ms
[2022-05-16 12:08:46] [INFO ] Time to serialize gal into /tmp/LTL3706160268305543043.gal : 25 ms
[2022-05-16 12:08:46] [INFO ] Time to serialize properties into /tmp/LTL15520016948152503593.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3706160268305543043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15520016948152503593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3706160...267
Read 1 LTL properties
Checking formula 0 : !((X((F(G(("(((((((((((ml3_258>=1)&&(l7_258>=1))||((ml3_110>=1)&&(l7_110>=1)))||(((ml3_253>=1)&&(l7_253>=1))||((ml3_105>=1)&&(l7_105>=...11423
Formula 0 simplified : !X(FG("(((((((((((ml3_258>=1)&&(l7_258>=1))||((ml3_110>=1)&&(l7_110>=1)))||(((ml3_253>=1)&&(l7_253>=1))||((ml3_105>=1)&&(l7_105>=1))...11413
Detected timeout of ITS tools.
[2022-05-16 12:09:01] [INFO ] Flatten gal took : 170 ms
[2022-05-16 12:09:01] [INFO ] Applying decomposition
[2022-05-16 12:09:01] [INFO ] Flatten gal took : 200 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15803400780887162945.txt' '-o' '/tmp/graph15803400780887162945.bin' '-w' '/tmp/graph15803400780887162945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15803400780887162945.bin' '-l' '-1' '-v' '-w' '/tmp/graph15803400780887162945.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:09:01] [INFO ] Decomposing Gal with order
[2022-05-16 12:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:09:05] [INFO ] Removed a total of 1559 redundant transitions.
[2022-05-16 12:09:05] [INFO ] Flatten gal took : 337 ms
[2022-05-16 12:09:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 492 labels/synchronizations in 154 ms.
[2022-05-16 12:09:06] [INFO ] Time to serialize gal into /tmp/LTL16804649752803615536.gal : 87 ms
[2022-05-16 12:09:06] [INFO ] Time to serialize properties into /tmp/LTL17383427087113397648.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16804649752803615536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17383427087113397648.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1680464...247
Read 1 LTL properties
Checking formula 0 : !((X((F(G(("(((((((((((i58.i1.i7.u1963.ml3_258>=1)&&(i58.i1.i5.u1743.l7_258>=1))||((i34.i0.i6.u1882.ml3_110>=1)&&(i34.i0.i3.u1671.l7_1...22223
Formula 0 simplified : !X(FG("(((((((((((i58.i1.i7.u1963.ml3_258>=1)&&(i58.i1.i5.u1743.l7_258>=1))||((i34.i0.i6.u1882.ml3_110>=1)&&(i34.i0.i3.u1671.l7_110>...22213
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18133395415831727330
[2022-05-16 12:09:21] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18133395415831727330
Running compilation step : cd /tmp/ltsmin18133395415831727330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18133395415831727330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18133395415831727330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 finished in 114285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((G((G(p1)&&p2))&&X(F(p1)))))))'
Support contains 255 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 969 places :
Implicit places reduction removed 969 places
Iterating post reduction 0 with 969 rules applied. Total rules applied 969 place count 8426 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1682 place count 7713 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2395 place count 7713 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2502 place count 7606 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2609 place count 7606 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2660 place count 7555 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2915 place count 7300 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3170 place count 7300 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3425 place count 7045 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 3680 place count 7045 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3935 place count 6790 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4190 place count 6790 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4445 place count 6535 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4700 place count 6535 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4955 place count 6280 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5210 place count 6280 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5465 place count 6025 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 5720 place count 6025 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5975 place count 5770 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6230 place count 5770 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6485 place count 5515 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 6740 place count 5515 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6995 place count 5260 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7250 place count 5260 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7505 place count 5005 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 7760 place count 5005 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8015 place count 4750 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8270 place count 4750 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8525 place count 4495 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 8780 place count 4495 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9035 place count 4240 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9290 place count 4240 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9596 place count 4189 transition count 3827
Applied a total of 9596 rules in 11808 ms. Remains 4189 /9395 variables (removed 5206) and now considering 3827/8467 (removed 4640) transitions.
// Phase 1: matrix 3827 rows 4189 cols
[2022-05-16 12:09:36] [INFO ] Computed 515 place invariants in 42 ms
[2022-05-16 12:09:37] [INFO ] Implicit Places using invariants in 1081 ms returned [1711, 1717, 2595]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4186/9395 places, 3827/8467 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4183 transition count 3824
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4183 transition count 3824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4182 transition count 3822
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4182 transition count 3822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4181 transition count 3821
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4181 transition count 3821
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 4180 transition count 3820
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 4180 transition count 3820
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 4179 transition count 3819
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 4179 transition count 3819
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 4178 transition count 3818
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 4178 transition count 3818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 4177 transition count 3817
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 4177 transition count 3817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 4176 transition count 3816
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 4176 transition count 3816
Applied a total of 20 rules in 2867 ms. Remains 4176 /4186 variables (removed 10) and now considering 3816/3827 (removed 11) transitions.
// Phase 1: matrix 3816 rows 4176 cols
[2022-05-16 12:09:40] [INFO ] Computed 512 place invariants in 46 ms
[2022-05-16 12:09:41] [INFO ] Implicit Places using invariants in 1058 ms returned [2545, 2574]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4174/9395 places, 3816/8467 transitions.
Applied a total of 0 rules in 354 ms. Remains 4174 /4174 variables (removed 0) and now considering 3816/3816 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4174/9395 places, 3816/8467 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s2348 1) (GEQ s2399 1)) (AND (GEQ s2385 1) (GEQ s2436 1)) (AND (GEQ s2353 1) (GEQ s2404 1)) (AND (GEQ s2343 1) (GEQ s2394 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 finished in 17354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1 U p2)&&p3)))'
Support contains 663 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 969 places :
Implicit places reduction removed 969 places
Iterating post reduction 0 with 969 rules applied. Total rules applied 969 place count 8426 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1682 place count 7713 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2395 place count 7713 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2502 place count 7606 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2609 place count 7606 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2660 place count 7555 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2915 place count 7300 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3170 place count 7300 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3425 place count 7045 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 3680 place count 7045 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3935 place count 6790 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4190 place count 6790 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4445 place count 6535 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4700 place count 6535 transition count 6377
Applied a total of 4700 rules in 6253 ms. Remains 6535 /9395 variables (removed 2860) and now considering 6377/8467 (removed 2090) transitions.
// Phase 1: matrix 6377 rows 6535 cols
[2022-05-16 12:09:48] [INFO ] Computed 566 place invariants in 79 ms
[2022-05-16 12:09:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:09:50] [INFO ] Implicit Places using invariants in 1530 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6534/9395 places, 6377/8467 transitions.
Applied a total of 0 rules in 683 ms. Remains 6534 /6534 variables (removed 0) and now considering 6377/6377 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6534/9395 places, 6377/8467 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p3:(OR (GEQ s6173 1) (GEQ s6171 1) (GEQ s6175 1) (GEQ s6126 1) (GEQ s6130 1) (GEQ s6128 1) (GEQ s6134 1) (GEQ s6132 1) (GEQ s6138 1) (GEQ s6136 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 finished in 8684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(p1)))&&(!p2 U G(p2))))'
Support contains 715 out of 9395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Discarding 714 places :
Implicit places reduction removed 714 places
Iterating post reduction 0 with 714 rules applied. Total rules applied 714 place count 8681 transition count 8467
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1427 place count 7968 transition count 7754
Iterating global reduction 1 with 713 rules applied. Total rules applied 2140 place count 7968 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2247 place count 7861 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2354 place count 7861 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2405 place count 7810 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2660 place count 7555 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 2915 place count 7555 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3170 place count 7300 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 3425 place count 7300 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3680 place count 7045 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 3935 place count 7045 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4190 place count 6790 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4445 place count 6790 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4700 place count 6535 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 4955 place count 6535 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5210 place count 6280 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 5465 place count 6280 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5720 place count 6025 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 5975 place count 6025 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6230 place count 5770 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 6485 place count 5770 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6740 place count 5515 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 6995 place count 5515 transition count 5102
Applied a total of 6995 rules in 9317 ms. Remains 5515 /9395 variables (removed 3880) and now considering 5102/8467 (removed 3365) transitions.
// Phase 1: matrix 5102 rows 5515 cols
[2022-05-16 12:10:00] [INFO ] Computed 821 place invariants in 75 ms
[2022-05-16 12:10:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:10:01] [INFO ] Implicit Places using invariants in 1478 ms returned [3926]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1481 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5514/9395 places, 5102/8467 transitions.
Applied a total of 0 rules in 425 ms. Remains 5514 /5514 variables (removed 0) and now considering 5102/5102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5514/9395 places, 5102/8467 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s1339 1) (GEQ s1645 1)) (AND (GEQ s1462 1) (GEQ s1768 1)) (AND (GEQ s1605 1) (GEQ s1911 1)) (AND (GEQ s1492 1) (GEQ s1798 1)) (AND (GEQ 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]]
Entered a terminal (fully accepting) state of product in 564 steps with 0 reset in 9 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 finished in 11465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Support contains 102 out of 9395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Graph (complete) has 13107 edges and 9395 vertex of which 8473 are kept as prefixes of interest. Removing 922 places using SCC suffix rule.11 ms
Discarding 922 places :
Also discarding 868 output transitions
Drop transitions removed 868 transitions
Discarding 1020 places :
Implicit places reduction removed 1020 places
Drop transitions removed 5100 transitions
Trivial Post-agglo rules discarded 5100 transitions
Performed 5100 trivial Post agglomeration. Transition count delta: 5100
Iterating post reduction 0 with 6120 rules applied. Total rules applied 6121 place count 7453 transition count 2499
Reduce places removed 5100 places and 0 transitions.
Iterating post reduction 1 with 5100 rules applied. Total rules applied 11221 place count 2353 transition count 2499
Performed 714 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 714 Pre rules applied. Total rules applied 11221 place count 2353 transition count 1785
Deduced a syphon composed of 714 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1020 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 12955 place count 1333 transition count 1785
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 13108 place count 1333 transition count 1632
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 13363 place count 1180 transition count 1530
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 13623 place count 920 transition count 1020
Iterating global reduction 4 with 260 rules applied. Total rules applied 13883 place count 920 transition count 1020
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 102 rules applied. Total rules applied 13985 place count 869 transition count 969
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 14036 place count 818 transition count 969
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 14036 place count 818 transition count 918
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 14138 place count 767 transition count 918
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 14393 place count 512 transition count 663
Iterating global reduction 6 with 255 rules applied. Total rules applied 14648 place count 512 transition count 663
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 6 with 357 rules applied. Total rules applied 15005 place count 461 transition count 357
Reduce places removed 51 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 7 with 102 rules applied. Total rules applied 15107 place count 410 transition count 306
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 15158 place count 359 transition count 306
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 9 with 153 rules applied. Total rules applied 15311 place count 257 transition count 255
Applied a total of 15311 rules in 188 ms. Remains 257 /9395 variables (removed 9138) and now considering 255/8467 (removed 8212) transitions.
// Phase 1: matrix 255 rows 257 cols
[2022-05-16 12:10:02] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 12:10:02] [INFO ] Implicit Places using invariants in 92 ms returned [153, 205]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/9395 places, 255/8467 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 255 transition count 204
Reduce places removed 51 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 102 rules applied. Total rules applied 153 place count 204 transition count 153
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 204 place count 153 transition count 153
Applied a total of 204 rules in 3 ms. Remains 153 /255 variables (removed 102) and now considering 153/255 (removed 102) transitions.
// Phase 1: matrix 153 rows 153 cols
[2022-05-16 12:10:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 12:10:02] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 153 rows 153 cols
[2022-05-16 12:10:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:10:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 153/9395 places, 153/8467 transitions.
Finished structural reductions, in 2 iterations. Remains : 153/9395 places, 153/8467 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s100 1) (GEQ s65 1) (GEQ s63 1) (GEQ s61 1) (GEQ s59 1) (GEQ s57 1) (GEQ s55 1) (GEQ s53 1) (GEQ s51 1) (GEQ s81 1) (GEQ s79 1) (GEQ s77 1) (G...], 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 153 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 51 out of 9395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Graph (complete) has 13107 edges and 9395 vertex of which 5457 are kept as prefixes of interest. Removing 3938 places using SCC suffix rule.9 ms
Discarding 3938 places :
Also discarding 3724 output transitions
Drop transitions removed 3724 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions removed 3978 transitions
Trivial Post-agglo rules discarded 3978 transitions
Performed 3978 trivial Post agglomeration. Transition count delta: 3978
Iterating post reduction 0 with 4896 rules applied. Total rules applied 4897 place count 4488 transition count 714
Reduce places removed 3978 places and 0 transitions.
Iterating post reduction 1 with 3978 rules applied. Total rules applied 8875 place count 510 transition count 714
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9130 place count 255 transition count 459
Iterating global reduction 2 with 255 rules applied. Total rules applied 9385 place count 255 transition count 459
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 9640 place count 255 transition count 204
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 9640 place count 255 transition count 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 9895 place count 102 transition count 102
Applied a total of 9895 rules in 48 ms. Remains 102 /9395 variables (removed 9293) and now considering 102/8467 (removed 8365) transitions.
// Phase 1: matrix 102 rows 102 cols
[2022-05-16 12:10:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:10:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 102 rows 102 cols
[2022-05-16 12:10:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 12:10:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 12:10:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 102 rows 102 cols
[2022-05-16 12:10:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:10:03] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/9395 places, 102/8467 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/9395 places, 102/8467 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s100 1) (GEQ s96 1) (GEQ s98 1) (GEQ s92 1) (GEQ s94 1) (GEQ s88 1) (GEQ s90 1) (GEQ s51 1) (GEQ s53 1) (GEQ s68 1) (GEQ s70 1) (GEQ s64 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 finished in 1051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 51 out of 9395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9395/9395 places, 8467/8467 transitions.
Graph (complete) has 13107 edges and 9395 vertex of which 7963 are kept as prefixes of interest. Removing 1432 places using SCC suffix rule.7 ms
Discarding 1432 places :
Also discarding 1225 output transitions
Drop transitions removed 1225 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 1020 places :
Implicit places reduction removed 1020 places
Drop transitions removed 4998 transitions
Trivial Post-agglo rules discarded 4998 transitions
Performed 4998 trivial Post agglomeration. Transition count delta: 4998
Iterating post reduction 0 with 6018 rules applied. Total rules applied 6019 place count 6892 transition count 2193
Reduce places removed 4998 places and 0 transitions.
Iterating post reduction 1 with 4998 rules applied. Total rules applied 11017 place count 1894 transition count 2193
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 459 Pre rules applied. Total rules applied 11017 place count 1894 transition count 1734
Deduced a syphon composed of 459 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 2 with 1071 rules applied. Total rules applied 12088 place count 1282 transition count 1734
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 12241 place count 1282 transition count 1581
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 12496 place count 1129 transition count 1479
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 12756 place count 869 transition count 969
Iterating global reduction 4 with 260 rules applied. Total rules applied 13016 place count 869 transition count 969
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 102 rules applied. Total rules applied 13118 place count 818 transition count 918
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 13169 place count 767 transition count 918
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 13169 place count 767 transition count 867
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 13271 place count 716 transition count 867
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 13526 place count 461 transition count 612
Iterating global reduction 6 with 255 rules applied. Total rules applied 13781 place count 461 transition count 612
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 14036 place count 461 transition count 357
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 14036 place count 461 transition count 306
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 14189 place count 359 transition count 306
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 14342 place count 257 transition count 255
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 14393 place count 206 transition count 204
Applied a total of 14393 rules in 163 ms. Remains 206 /9395 variables (removed 9189) and now considering 204/8467 (removed 8263) transitions.
// Phase 1: matrix 204 rows 206 cols
[2022-05-16 12:10:04] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 12:10:04] [INFO ] Implicit Places using invariants in 97 ms returned [51, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 106 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/9395 places, 204/8467 transitions.
Reduce places removed 51 places and 51 transitions.
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 51 Pre rules applied. Total rules applied 0 place count 153 transition count 102
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 102 transition count 102
Applied a total of 102 rules in 1 ms. Remains 102 /204 variables (removed 102) and now considering 102/204 (removed 102) transitions.
// Phase 1: matrix 102 rows 102 cols
[2022-05-16 12:10:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:10:04] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 102 rows 102 cols
[2022-05-16 12:10:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 12:10:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/9395 places, 102/8467 transitions.
Finished structural reductions, in 2 iterations. Remains : 102/9395 places, 102/8467 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s98 1) (LT s96 1) (LT s100 1) (LT s51 1) (LT s55 1) (LT s53 1) (LT s59 1) (LT s57 1) (LT s63 1) (LT s61 1) (LT s66 1) (LT s64 1) (LT s70 1) (L...], 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 970 reset in 282 ms.
Product exploration explored 100000 steps with 970 reset in 303 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 finished in 1135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X((X(X(p1))&&G(p2))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U p1))) U (!p2 U p1))))'
[2022-05-16 12:10:05] [INFO ] Flatten gal took : 198 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13117987436935539836
[2022-05-16 12:10:05] [INFO ] Too many transitions (8467) to apply POR reductions. Disabling POR matrices.
[2022-05-16 12:10:05] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13117987436935539836
[2022-05-16 12:10:05] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin13117987436935539836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 12:10:05] [INFO ] Flatten gal took : 208 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15757175782074494558.txt' '-o' '/tmp/graph15757175782074494558.bin' '-w' '/tmp/graph15757175782074494558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15757175782074494558.bin' '-l' '-1' '-v' '-w' '/tmp/graph15757175782074494558.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:10:06] [INFO ] Decomposing Gal with order
[2022-05-16 12:10:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:10:10] [INFO ] Removed a total of 1769 redundant transitions.
[2022-05-16 12:10:10] [INFO ] Flatten gal took : 371 ms
[2022-05-16 12:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 70 ms.
[2022-05-16 12:10:11] [INFO ] Time to serialize gal into /tmp/LTLFireability15858856251095236216.gal : 51 ms
[2022-05-16 12:10:11] [INFO ] Time to serialize properties into /tmp/LTLFireability6317157002191324316.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15858856251095236216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6317157002191324316.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F((F("(((((((i34.u2973.l21_35>=1)||(i54.i1.i0.i1.u3006.l21_33>=1))||((i18.u3008.l21_39>=1)||(i49.u3007.l21_37>=1)))||(((i47.i1.i1.i...4212
Formula 0 simplified : !F("((((((((i36.i0.i5.i2.u2262.lc0_8>=1)&&(i36.i0.i5.i2.u2295.cl1_8>=1))||((i56.i0.i4.i2.u2370.lc0_45>=1)&&(i56.i0.i4.i2.u2304.cl1_4...4205
Compilation finished in 48553 ms.
Running link step : cd /tmp/ltsmin13117987436935539836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin13117987436935539836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13117987436935539836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13117987436935539836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 12:32:24] [INFO ] Applying decomposition
[2022-05-16 12:32:25] [INFO ] Flatten gal took : 522 ms
[2022-05-16 12:32:25] [INFO ] Decomposing Gal with order
[2022-05-16 12:32:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:32:28] [INFO ] Removed a total of 2733 redundant transitions.
[2022-05-16 12:32:28] [INFO ] Flatten gal took : 923 ms
[2022-05-16 12:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-16 12:32:29] [INFO ] Time to serialize gal into /tmp/LTLFireability12192574501831094608.gal : 72 ms
[2022-05-16 12:32:29] [INFO ] Time to serialize properties into /tmp/LTLFireability14308715107210893176.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12192574501831094608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14308715107210893176.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 3 LTL properties
Checking formula 0 : !((F((F("(((((((LegalResident35.l21_35>=1)||(LegalResident33.l21_33>=1))||((LegalResident39.l21_39>=1)||(LegalResident37.l21_37>=1)))|...5125
Formula 0 simplified : !F("((((((((LegalResident8.lc0_8>=1)&&(LegalResidentCINFORMI8.cl1_8>=1))||((LegalResident45.lc0_45>=1)&&(LegalResidentCINFORMI45.cl1...5118
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: 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( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.323: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.323: LTL layer: formula: X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.324: "X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.340: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.340: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.349: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.372: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.378: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.401: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.408: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.416: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.431: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 5.032: DFS-FIFO for weak LTL, using special progress label 8475
pins2lts-mc-linux64( 0/ 8), 5.032: There are 8476 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 5.032: State length is 9396, there are 8481 groups
pins2lts-mc-linux64( 0/ 8), 5.032: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 5.032: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 5.032: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 5.032: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 9.553: ~1 levels ~960 states ~54600 transitions
pins2lts-mc-linux64( 6/ 8), 13.824: ~1 levels ~1920 states ~111560 transitions
pins2lts-mc-linux64( 6/ 8), 22.118: ~1 levels ~3840 states ~224280 transitions
pins2lts-mc-linux64( 6/ 8), 38.511: ~1 levels ~7680 states ~450200 transitions
pins2lts-mc-linux64( 6/ 8), 71.711: ~1 levels ~15360 states ~918120 transitions
pins2lts-mc-linux64( 4/ 8), 138.017: ~1 levels ~30720 states ~1853240 transitions
pins2lts-mc-linux64( 4/ 8), 269.659: ~1 levels ~61440 states ~3733360 transitions
pins2lts-mc-linux64( 6/ 8), 532.636: ~1 levels ~122880 states ~7481800 transitions
pins2lts-mc-linux64( 6/ 8), 987.590: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 988.912:
pins2lts-mc-linux64( 0/ 8), 988.912: mean standard work distribution: 4.3% (states) 4.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 988.912:
pins2lts-mc-linux64( 0/ 8), 988.912: Explored 222523 states 14060651 transitions, fanout: 63.187
pins2lts-mc-linux64( 0/ 8), 988.912: Total exploration time 983.850 sec (982.600 sec minimum, 983.269 sec on average)
pins2lts-mc-linux64( 0/ 8), 988.912: States per second: 226, Transitions per second: 14291
pins2lts-mc-linux64( 0/ 8), 988.912:
pins2lts-mc-linux64( 0/ 8), 988.912: Progress states detected: 5432526
pins2lts-mc-linux64( 0/ 8), 988.912: Redundant explorations: -95.9040
pins2lts-mc-linux64( 0/ 8), 988.912:
pins2lts-mc-linux64( 0/ 8), 988.912: Queue width: 8B, total height: 6446157, memory: 49.18MB
pins2lts-mc-linux64( 0/ 8), 988.912: Tree memory: 297.4MB, 57.4 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 988.912: Tree fill ratio (roots/leafs): 4.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 988.912: Stored 8993 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 988.912: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 988.914: Est. total memory use: 346.6MB (~1073.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13117987436935539836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13117987436935539836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 12:54:46] [INFO ] Flatten gal took : 995 ms
[2022-05-16 12:54:55] [INFO ] Input system was already deterministic with 8467 transitions.
[2022-05-16 12:54:55] [INFO ] Transformed 9395 places.
[2022-05-16 12:54:55] [INFO ] Transformed 8467 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 12:55:08] [INFO ] Time to serialize gal into /tmp/LTLFireability7818527450514072659.gal : 60 ms
[2022-05-16 12:55:08] [INFO ] Time to serialize properties into /tmp/LTLFireability12169114522888373434.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7818527450514072659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12169114522888373434.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((F("(((((((l21_35>=1)||(l21_33>=1))||((l21_39>=1)||(l21_37>=1)))||(((l21_43>=1)||(l21_41>=1))||((l21_47>=1)||(l21_45>=1))))||((((...2299
Formula 0 simplified : !F("((((((((lc0_8>=1)&&(cl1_8>=1))||((lc0_45>=1)&&(cl1_45>=1)))||(((lc0_13>=1)&&(cl1_13>=1))||((lc0_3>=1)&&(cl1_3>=1))))||((((lc0_35...2292

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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