Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280400317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280400317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 461K Apr 11 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 11 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 660K Apr 11 21:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 11 21:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 149K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 584K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 407K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 854K Apr 11 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 11 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 22:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.4M Apr 11 22:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 43K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17M May 18 16:42 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-PT-L00100M0010C005P005G002-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716659376627

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 17:49:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 17:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:49:40] [INFO ] Load time of PNML (sax parser for PT used): 1316 ms
[2024-05-25 17:49:40] [INFO ] Transformed 40605 places.
[2024-05-25 17:49:40] [INFO ] Transformed 36871 transitions.
[2024-05-25 17:49:40] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 1623 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 2246 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4487 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 132 places and 0 transitions.
Discarding 6665 places :
Implicit places reduction removed 6665 places
Iterating post reduction 0 with 6797 rules applied. Total rules applied 6797 place count 33777 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 6999 place count 33575 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 7201 place count 33575 transition count 36467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7202 place count 33574 transition count 36366
Iterating global reduction 1 with 1 rules applied. Total rules applied 7203 place count 33574 transition count 36366
Applied a total of 7203 rules in 2256 ms. Remains 33574 /40574 variables (removed 7000) and now considering 36366/36871 (removed 505) transitions.
// Phase 1: matrix 36366 rows 33574 cols
[2024-05-25 17:49:48] [INFO ] Computed 2027 invariants in 2003 ms
[2024-05-25 17:49:53] [INFO ] Implicit Places using invariants in 6947 ms returned []
Implicit Place search using SMT only with invariants took 6993 ms to find 0 implicit places.
[2024-05-25 17:49:53] [INFO ] Invariant cache hit.
[2024-05-25 17:49:57] [INFO ] Dead Transitions using invariants and state equation in 4313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33574/40574 places, 36366/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13591 ms. Remains : 33574/40574 places, 36366/36871 transitions.
Support contains 4487 out of 33574 places after structural reductions.
[2024-05-25 17:50:00] [INFO ] Flatten gal took : 1631 ms
[2024-05-25 17:50:01] [INFO ] Flatten gal took : 1003 ms
[2024-05-25 17:50:04] [INFO ] Input system was already deterministic with 36366 transitions.
Support contains 3276 out of 33574 places (down from 4487) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1502 ms. (steps per millisecond=6 ) properties (out of 25) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-25 17:50:06] [INFO ] Invariant cache hit.
[2024-05-25 17:50:23] [INFO ] [Real]Absence check using 201 positive place invariants in 961 ms returned sat
[2024-05-25 17:50:26] [INFO ] [Real]Absence check using 201 positive and 1826 generalized place invariants in 2838 ms returned sat
[2024-05-25 17:50:28] [INFO ] After 22005ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-25 17:50:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 670 ms returned sat
[2024-05-25 17:50:47] [INFO ] [Nat]Absence check using 201 positive and 1826 generalized place invariants in 3018 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 17:50:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:50:53] [INFO ] After 25178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 933 out of 33574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Graph (complete) has 48584 edges and 33574 vertex of which 33366 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.103 ms
Discarding 208 places :
Also discarding 107 output transitions
Drop transitions removed 107 transitions
Drop transitions removed 18972 transitions
Trivial Post-agglo rules discarded 18972 transitions
Performed 18972 trivial Post agglomeration. Transition count delta: 18972
Iterating post reduction 0 with 18972 rules applied. Total rules applied 18973 place count 33366 transition count 17287
Reduce places removed 18972 places and 0 transitions.
Performed 205 Post agglomeration using F-continuation condition.Transition count delta: 205
Iterating post reduction 1 with 19177 rules applied. Total rules applied 38150 place count 14394 transition count 17082
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 2 with 205 rules applied. Total rules applied 38355 place count 14189 transition count 17082
Performed 1714 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1714 Pre rules applied. Total rules applied 38355 place count 14189 transition count 15368
Deduced a syphon composed of 1714 places in 11 ms
Ensure Unique test removed 907 places
Reduce places removed 2621 places and 0 transitions.
Iterating global reduction 3 with 4335 rules applied. Total rules applied 42690 place count 11568 transition count 15368
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 705 transitions
Trivial Post-agglo rules discarded 705 transitions
Performed 705 trivial Post agglomeration. Transition count delta: 705
Iterating post reduction 3 with 707 rules applied. Total rules applied 43397 place count 11566 transition count 14663
Reduce places removed 705 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 706 rules applied. Total rules applied 44103 place count 10861 transition count 14662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 44104 place count 10860 transition count 14662
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 44104 place count 10860 transition count 14661
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 44106 place count 10859 transition count 14661
Discarding 4339 places :
Symmetric choice reduction at 6 with 4339 rule applications. Total rules 48445 place count 6520 transition count 10322
Iterating global reduction 6 with 4339 rules applied. Total rules applied 52784 place count 6520 transition count 10322
Ensure Unique test removed 503 transitions
Reduce isomorphic transitions removed 503 transitions.
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 898 transitions
Trivial Post-agglo rules discarded 898 transitions
Performed 898 trivial Post agglomeration. Transition count delta: 898
Iterating post reduction 6 with 1600 rules applied. Total rules applied 54384 place count 6321 transition count 8921
Reduce places removed 898 places and 0 transitions.
Iterating post reduction 7 with 898 rules applied. Total rules applied 55282 place count 5423 transition count 8921
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 55282 place count 5423 transition count 8918
Deduced a syphon composed of 3 places in 30 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 55288 place count 5420 transition count 8918
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 55298 place count 5410 transition count 7908
Iterating global reduction 8 with 10 rules applied. Total rules applied 55308 place count 5410 transition count 7908
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 8 with 303 rules applied. Total rules applied 55611 place count 5410 transition count 7605
Discarding 705 places :
Symmetric choice reduction at 9 with 705 rule applications. Total rules 56316 place count 4705 transition count 6900
Iterating global reduction 9 with 705 rules applied. Total rules applied 57021 place count 4705 transition count 6900
Ensure Unique test removed 705 transitions
Reduce isomorphic transitions removed 705 transitions.
Iterating post reduction 9 with 705 rules applied. Total rules applied 57726 place count 4705 transition count 6195
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 5 ms
Ensure Unique test removed 202 places
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 10 with 1220 rules applied. Total rules applied 58946 place count 3994 transition count 5686
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 10 with 400 rules applied. Total rules applied 59346 place count 3794 transition count 5486
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 59351 place count 3791 transition count 5491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 59353 place count 3790 transition count 5490
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 59354 place count 3790 transition count 5489
Free-agglomeration rule (complex) applied 104 times.
Iterating global reduction 10 with 104 rules applied. Total rules applied 59458 place count 3790 transition count 5968
Ensure Unique test removed 98 places
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 10 with 202 rules applied. Total rules applied 59660 place count 3588 transition count 5968
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 59664 place count 3588 transition count 5968
Applied a total of 59664 rules in 8304 ms. Remains 3588 /33574 variables (removed 29986) and now considering 5968/36366 (removed 30398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8308 ms. Remains : 3588/33574 places, 5968/36366 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5968 rows 3588 cols
[2024-05-25 17:51:02] [INFO ] Computed 618 invariants in 127 ms
[2024-05-25 17:51:03] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 17:51:04] [INFO ] [Nat]Absence check using 110 positive place invariants in 67 ms returned sat
[2024-05-25 17:51:04] [INFO ] [Nat]Absence check using 110 positive and 508 generalized place invariants in 251 ms returned sat
[2024-05-25 17:51:09] [INFO ] After 4679ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 17:51:10] [INFO ] After 5462ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 580 ms.
[2024-05-25 17:51:10] [INFO ] After 7378ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 211 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 22 ms.
Support contains 2 out of 3588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3588/3588 places, 5968/5968 transitions.
Graph (complete) has 11300 edges and 3588 vertex of which 840 are kept as prefixes of interest. Removing 2748 places using SCC suffix rule.4 ms
Discarding 2748 places :
Also discarding 3634 output transitions
Drop transitions removed 3634 transitions
Drop transitions removed 207 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 212 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 840 transition count 2117
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 223 place count 835 transition count 2117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 223 place count 835 transition count 2115
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 228 place count 832 transition count 2115
Discarding 103 places :
Symmetric choice reduction at 2 with 103 rule applications. Total rules 331 place count 729 transition count 1422
Ensure Unique test removed 1 places
Iterating global reduction 2 with 104 rules applied. Total rules applied 435 place count 728 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 438 place count 728 transition count 1419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 438 place count 728 transition count 1418
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 441 place count 726 transition count 1418
Discarding 297 places :
Symmetric choice reduction at 3 with 297 rule applications. Total rules 738 place count 429 transition count 649
Iterating global reduction 3 with 297 rules applied. Total rules applied 1035 place count 429 transition count 649
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 3 with 202 rules applied. Total rules applied 1237 place count 429 transition count 447
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1238 place count 428 transition count 445
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 428 transition count 445
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1241 place count 427 transition count 444
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1242 place count 426 transition count 443
Iterating global reduction 4 with 1 rules applied. Total rules applied 1243 place count 426 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1244 place count 426 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1246 place count 425 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1247 place count 424 transition count 437
Iterating global reduction 5 with 1 rules applied. Total rules applied 1248 place count 424 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1251 place count 424 transition count 438
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1257 place count 418 transition count 438
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1261 place count 414 transition count 414
Iterating global reduction 6 with 4 rules applied. Total rules applied 1265 place count 414 transition count 414
Discarding 101 places :
Symmetric choice reduction at 6 with 101 rule applications. Total rules 1366 place count 313 transition count 313
Ensure Unique test removed 101 places
Iterating global reduction 6 with 202 rules applied. Total rules applied 1568 place count 212 transition count 313
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 6 with 202 rules applied. Total rules applied 1770 place count 212 transition count 111
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 1871 place count 111 transition count 111
Discarding 99 places :
Symmetric choice reduction at 8 with 99 rule applications. Total rules 1970 place count 12 transition count 12
Iterating global reduction 8 with 99 rules applied. Total rules applied 2069 place count 12 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2070 place count 12 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2072 place count 10 transition count 10
Applied a total of 2072 rules in 212 ms. Remains 10 /3588 variables (removed 3578) and now considering 10/5968 (removed 5958) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 10/3588 places, 10/5968 transitions.
Finished random walk after 307 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=307 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33574 stabilizing places and 36366 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33574 transition count 36366
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 202 out of 33574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Graph (complete) has 48584 edges and 33574 vertex of which 33056 are kept as prefixes of interest. Removing 518 places using SCC suffix rule.87 ms
Discarding 518 places :
Also discarding 309 output transitions
Drop transitions removed 309 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 19897 transitions
Trivial Post-agglo rules discarded 19897 transitions
Performed 19897 trivial Post agglomeration. Transition count delta: 19897
Iterating post reduction 0 with 19898 rules applied. Total rules applied 19899 place count 32954 transition count 16059
Reduce places removed 19897 places and 0 transitions.
Iterating post reduction 1 with 19897 rules applied. Total rules applied 39796 place count 13057 transition count 16059
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1717 Pre rules applied. Total rules applied 39796 place count 13057 transition count 14342
Deduced a syphon composed of 1717 places in 9 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 2 with 4343 rules applied. Total rules applied 44139 place count 10431 transition count 14342
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 44846 place count 10431 transition count 13635
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 45553 place count 9724 transition count 13635
Discarding 4748 places :
Symmetric choice reduction at 4 with 4748 rule applications. Total rules 50301 place count 4976 transition count 8787
Iterating global reduction 4 with 4748 rules applied. Total rules applied 55049 place count 4976 transition count 8787
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 909 transitions
Trivial Post-agglo rules discarded 909 transitions
Performed 909 trivial Post agglomeration. Transition count delta: 909
Iterating post reduction 4 with 1616 rules applied. Total rules applied 56665 place count 4774 transition count 7373
Reduce places removed 909 places and 0 transitions.
Iterating post reduction 5 with 909 rules applied. Total rules applied 57574 place count 3865 transition count 7373
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 57574 place count 3865 transition count 7272
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 57776 place count 3764 transition count 7272
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 57798 place count 3742 transition count 5050
Iterating global reduction 6 with 22 rules applied. Total rules applied 57820 place count 3742 transition count 5050
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 505 places :
Implicit places reduction removed 505 places
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 6 with 1919 rules applied. Total rules applied 59739 place count 3237 transition count 3636
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 7 with 404 rules applied. Total rules applied 60143 place count 2833 transition count 3636
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 303 Pre rules applied. Total rules applied 60143 place count 2833 transition count 3333
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 8 with 606 rules applied. Total rules applied 60749 place count 2530 transition count 3333
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 61759 place count 1520 transition count 2323
Iterating global reduction 8 with 1010 rules applied. Total rules applied 62769 place count 1520 transition count 2323
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 63779 place count 1520 transition count 1313
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 63779 place count 1520 transition count 1212
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 64082 place count 1318 transition count 1212
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 404 rules applied. Total rules applied 64486 place count 1116 transition count 1010
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 64587 place count 1015 transition count 909
Applied a total of 64587 rules in 3792 ms. Remains 1015 /33574 variables (removed 32559) and now considering 909/36366 (removed 35457) transitions.
// Phase 1: matrix 909 rows 1015 cols
[2024-05-25 17:51:15] [INFO ] Computed 207 invariants in 17 ms
[2024-05-25 17:51:17] [INFO ] Implicit Places using invariants in 1810 ms returned [0, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 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, 305, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 609, 913]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 1818 ms to find 206 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 809/33574 places, 909/36366 transitions.
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 708 transition count 606
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 506 transition count 606
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 404 place count 506 transition count 505
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 606 place count 405 transition count 505
Applied a total of 606 rules in 27 ms. Remains 405 /809 variables (removed 404) and now considering 505/909 (removed 404) transitions.
// Phase 1: matrix 505 rows 405 cols
[2024-05-25 17:51:17] [INFO ] Computed 1 invariants in 3 ms
[2024-05-25 17:51:17] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-25 17:51:17] [INFO ] Invariant cache hit.
[2024-05-25 17:51:18] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/33574 places, 505/36366 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6128 ms. Remains : 405/33574 places, 505/36366 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10739 reset in 1482 ms.
Product exploration explored 100000 steps with 10725 reset in 1153 ms.
Computed a total of 405 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 405 transition count 505
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 p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 finished in 9300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 303 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 108 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 33465 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 33464 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 33464 transition count 36265
Applied a total of 111 rules in 702 ms. Remains 33464 /33574 variables (removed 110) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33464 cols
[2024-05-25 17:51:24] [INFO ] Computed 1924 invariants in 2119 ms
[2024-05-25 17:51:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:51:28] [INFO ] Implicit Places using invariants in 6749 ms returned []
Implicit Place search using SMT only with invariants took 6751 ms to find 0 implicit places.
[2024-05-25 17:51:28] [INFO ] Invariant cache hit.
[2024-05-25 17:51:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:51:32] [INFO ] Dead Transitions using invariants and state equation in 4201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33464/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11659 ms. Remains : 33464/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s21332 s21333 s21334 s21335 s21336 s21337 s21338 s21339 s21340 s21341 s21342 s21343 s21344 s21345 s21346 s21347 s21348 s21349 s21350 s21351 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 74 reset in 3174 ms.
Product exploration explored 100000 steps with 73 reset in 3283 ms.
Computed a total of 33464 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33464 transition count 36265
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 (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Finished random walk after 1487 steps, including 0 resets, run visited all 1 properties in 65 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-25 17:52:33] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 303 out of 33464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33464/33464 places, 36265/36265 transitions.
Graph (complete) has 47571 edges and 33464 vertex of which 33458 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.38 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 19796 transitions
Trivial Post-agglo rules discarded 19796 transitions
Performed 19796 trivial Post agglomeration. Transition count delta: 19796
Iterating post reduction 0 with 19796 rules applied. Total rules applied 19797 place count 33357 transition count 16362
Reduce places removed 19796 places and 0 transitions.
Iterating post reduction 1 with 19796 rules applied. Total rules applied 39593 place count 13561 transition count 16362
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1818 Pre rules applied. Total rules applied 39593 place count 13561 transition count 14544
Deduced a syphon composed of 1818 places in 9 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 2 with 4545 rules applied. Total rules applied 44138 place count 10834 transition count 14544
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 44845 place count 10834 transition count 13837
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 45552 place count 10127 transition count 13837
Discarding 4747 places :
Symmetric choice reduction at 4 with 4747 rule applications. Total rules 50299 place count 5380 transition count 9090
Iterating global reduction 4 with 4747 rules applied. Total rules applied 55046 place count 5380 transition count 9090
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 4 with 1313 rules applied. Total rules applied 56359 place count 5178 transition count 7979
Reduce places removed 606 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 5 with 707 rules applied. Total rules applied 57066 place count 4572 transition count 7878
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 57167 place count 4471 transition count 7878
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 202 Pre rules applied. Total rules applied 57167 place count 4471 transition count 7676
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 7 with 404 rules applied. Total rules applied 57571 place count 4269 transition count 7676
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 57593 place count 4247 transition count 5454
Iterating global reduction 7 with 22 rules applied. Total rules applied 57615 place count 4247 transition count 5454
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 505 places :
Implicit places reduction removed 505 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 7 with 1717 rules applied. Total rules applied 59332 place count 3742 transition count 4242
Reduce places removed 202 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 303 rules applied. Total rules applied 59635 place count 3540 transition count 4141
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 59736 place count 3439 transition count 4141
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 303 Pre rules applied. Total rules applied 59736 place count 3439 transition count 3838
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 10 with 606 rules applied. Total rules applied 60342 place count 3136 transition count 3838
Discarding 1010 places :
Symmetric choice reduction at 10 with 1010 rule applications. Total rules 61352 place count 2126 transition count 2828
Iterating global reduction 10 with 1010 rules applied. Total rules applied 62362 place count 2126 transition count 2828
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 10 with 1010 rules applied. Total rules applied 63372 place count 2126 transition count 1818
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 101 Pre rules applied. Total rules applied 63372 place count 2126 transition count 1717
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 303 rules applied. Total rules applied 63675 place count 1924 transition count 1717
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 0 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 11 with 606 rules applied. Total rules applied 64281 place count 1621 transition count 1414
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 64382 place count 1520 transition count 1313
Applied a total of 64382 rules in 4246 ms. Remains 1520 /33464 variables (removed 31944) and now considering 1313/36265 (removed 34952) transitions.
// Phase 1: matrix 1313 rows 1520 cols
[2024-05-25 17:52:53] [INFO ] Computed 207 invariants in 23 ms
[2024-05-25 17:52:54] [INFO ] Implicit Places using invariants in 1827 ms returned [0, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 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, 305, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 609, 1418]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 1835 ms to find 206 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1314/33464 places, 1313/36265 transitions.
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 303 rules applied. Total rules applied 303 place count 1213 transition count 909
Reduce places removed 303 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 404 rules applied. Total rules applied 707 place count 910 transition count 808
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 808 place count 809 transition count 808
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1010 place count 708 transition count 707
Applied a total of 1010 rules in 40 ms. Remains 708 /1314 variables (removed 606) and now considering 707/1313 (removed 606) transitions.
// Phase 1: matrix 707 rows 708 cols
[2024-05-25 17:52:54] [INFO ] Computed 1 invariants in 5 ms
[2024-05-25 17:52:55] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-25 17:52:55] [INFO ] Invariant cache hit.
[2024-05-25 17:52:55] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 708/33464 places, 707/36265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6895 ms. Remains : 708/33464 places, 707/36265 transitions.
Computed a total of 708 stabilizing places and 707 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 708 transition count 707
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 (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 finished in 94907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 707 out of 33574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Graph (complete) has 48584 edges and 33574 vertex of which 31031 are kept as prefixes of interest. Removing 2543 places using SCC suffix rule.63 ms
Discarding 2543 places :
Also discarding 2531 output transitions
Drop transitions removed 2531 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 17776 transitions
Trivial Post-agglo rules discarded 17776 transitions
Performed 17776 trivial Post agglomeration. Transition count delta: 17776
Iterating post reduction 0 with 17777 rules applied. Total rules applied 17778 place count 30929 transition count 15958
Reduce places removed 17776 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 18887 rules applied. Total rules applied 36665 place count 13153 transition count 14847
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 37776 place count 12042 transition count 14847
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1919 Pre rules applied. Total rules applied 37776 place count 12042 transition count 12928
Deduced a syphon composed of 1919 places in 7 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4747 rules applied. Total rules applied 42523 place count 9214 transition count 12928
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 707 rules applied. Total rules applied 43230 place count 9214 transition count 12221
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 43937 place count 8507 transition count 12221
Discarding 4040 places :
Symmetric choice reduction at 5 with 4040 rule applications. Total rules 47977 place count 4467 transition count 8181
Iterating global reduction 5 with 4040 rules applied. Total rules applied 52017 place count 4467 transition count 8181
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 808 transitions
Trivial Post-agglo rules discarded 808 transitions
Performed 808 trivial Post agglomeration. Transition count delta: 808
Iterating post reduction 5 with 1515 rules applied. Total rules applied 53532 place count 4265 transition count 6868
Reduce places removed 808 places and 0 transitions.
Iterating post reduction 6 with 808 rules applied. Total rules applied 54340 place count 3457 transition count 6868
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 54355 place count 3442 transition count 5353
Iterating global reduction 7 with 15 rules applied. Total rules applied 54370 place count 3442 transition count 5353
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 7 with 1010 rules applied. Total rules applied 55380 place count 3139 transition count 4646
Reduce places removed 202 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 303 rules applied. Total rules applied 55683 place count 2937 transition count 4545
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 55784 place count 2836 transition count 4545
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 101 Pre rules applied. Total rules applied 55784 place count 2836 transition count 4444
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 55986 place count 2735 transition count 4444
Discarding 1010 places :
Symmetric choice reduction at 10 with 1010 rule applications. Total rules 56996 place count 1725 transition count 3434
Iterating global reduction 10 with 1010 rules applied. Total rules applied 58006 place count 1725 transition count 3434
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 10 with 1010 rules applied. Total rules applied 59016 place count 1725 transition count 2424
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 101 Pre rules applied. Total rules applied 59016 place count 1725 transition count 2323
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 303 rules applied. Total rules applied 59319 place count 1523 transition count 2323
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 303 rules applied. Total rules applied 59622 place count 1321 transition count 2222
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 59824 place count 1220 transition count 2121
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 59925 place count 1119 transition count 2020
Applied a total of 59925 rules in 4069 ms. Remains 1119 /33574 variables (removed 32455) and now considering 2020/36366 (removed 34346) transitions.
// Phase 1: matrix 2020 rows 1119 cols
[2024-05-25 17:53:00] [INFO ] Computed 104 invariants in 27 ms
[2024-05-25 17:53:01] [INFO ] Implicit Places using invariants in 1476 ms returned [107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 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, 205, 206, 207, 915, 1017]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1480 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1016/33574 places, 2020/36366 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 915 transition count 1919
Applied a total of 202 rules in 45 ms. Remains 915 /1016 variables (removed 101) and now considering 1919/2020 (removed 101) transitions.
// Phase 1: matrix 1919 rows 915 cols
[2024-05-25 17:53:01] [INFO ] Computed 1 invariants in 17 ms
[2024-05-25 17:53:02] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-25 17:53:02] [INFO ] Invariant cache hit.
[2024-05-25 17:53:03] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 915/33574 places, 1919/36366 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7017 ms. Remains : 915/33574 places, 1919/36366 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 9 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 finished in 7205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 713 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 108 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 33465 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 33464 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 33464 transition count 36265
Applied a total of 111 rules in 658 ms. Remains 33464 /33574 variables (removed 110) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33464 cols
[2024-05-25 17:53:05] [INFO ] Computed 2025 invariants in 1887 ms
[2024-05-25 17:53:10] [INFO ] Implicit Places using invariants in 6063 ms returned []
Implicit Place search using SMT only with invariants took 6064 ms to find 0 implicit places.
[2024-05-25 17:53:10] [INFO ] Invariant cache hit.
[2024-05-25 17:53:14] [INFO ] Dead Transitions using invariants and state equation in 4179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33464/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10905 ms. Remains : 33464/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s22948 s22949 s22950 s22951 s22952 s22953 s22954 s22955 s22956 s22957 s22958 s22959 s22960 s22961 s22962 s22963 s22964 s22965 s22966 s22967 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 42550 steps with 14154 reset in 10001 ms.
Product exploration timeout after 39450 steps with 13021 reset in 10007 ms.
Computed a total of 33464 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33464 transition count 36265
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 p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 17:54:30] [INFO ] Invariant cache hit.
[2024-05-25 17:54:38] [INFO ] [Real]Absence check using 201 positive place invariants in 648 ms returned sat
[2024-05-25 17:54:41] [INFO ] [Real]Absence check using 201 positive and 1824 generalized place invariants in 2718 ms returned sat
[2024-05-25 17:54:55] [INFO ] After 12564ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 17:54:55] [INFO ] After 12627ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 17:54:55] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 713 out of 33464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33464/33464 places, 36265/36265 transitions.
Graph (complete) has 47672 edges and 33464 vertex of which 33363 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.26 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Drop transitions removed 18079 transitions
Trivial Post-agglo rules discarded 18079 transitions
Performed 18079 trivial Post agglomeration. Transition count delta: 18079
Iterating post reduction 0 with 18079 rules applied. Total rules applied 18080 place count 33363 transition count 18085
Reduce places removed 18079 places and 0 transitions.
Iterating post reduction 1 with 18079 rules applied. Total rules applied 36159 place count 15284 transition count 18085
Performed 2323 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2323 Pre rules applied. Total rules applied 36159 place count 15284 transition count 15762
Deduced a syphon composed of 2323 places in 11 ms
Ensure Unique test removed 909 places
Reduce places removed 3232 places and 0 transitions.
Iterating global reduction 2 with 5555 rules applied. Total rules applied 41714 place count 12052 transition count 15762
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 2 with 101 rules applied. Total rules applied 41815 place count 12052 transition count 15661
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 41916 place count 11951 transition count 15661
Discarding 4848 places :
Symmetric choice reduction at 4 with 4848 rule applications. Total rules 46764 place count 7103 transition count 10813
Iterating global reduction 4 with 4848 rules applied. Total rules applied 51612 place count 7103 transition count 10813
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 4 with 808 rules applied. Total rules applied 52420 place count 7002 transition count 10106
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 5 with 707 rules applied. Total rules applied 53127 place count 6295 transition count 10106
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 53127 place count 6295 transition count 10005
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 53329 place count 6194 transition count 10005
Discarding 123 places :
Symmetric choice reduction at 6 with 123 rule applications. Total rules 53452 place count 6071 transition count 7682
Iterating global reduction 6 with 123 rules applied. Total rules applied 53575 place count 6071 transition count 7682
Ensure Unique test removed 606 transitions
Reduce isomorphic transitions removed 606 transitions.
Discarding 505 places :
Implicit places reduction removed 505 places
Drop transitions removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 6 with 1616 rules applied. Total rules applied 55191 place count 5566 transition count 6571
Reduce places removed 505 places and 0 transitions.
Iterating post reduction 7 with 505 rules applied. Total rules applied 55696 place count 5061 transition count 6571
Performed 404 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 404 Pre rules applied. Total rules applied 55696 place count 5061 transition count 6167
Deduced a syphon composed of 404 places in 3 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 8 with 808 rules applied. Total rules applied 56504 place count 4657 transition count 6167
Discarding 1515 places :
Symmetric choice reduction at 8 with 1515 rule applications. Total rules 58019 place count 3142 transition count 4652
Iterating global reduction 8 with 1515 rules applied. Total rules applied 59534 place count 3142 transition count 4652
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 8 with 1313 rules applied. Total rules applied 60847 place count 3041 transition count 3440
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 9 with 202 rules applied. Total rules applied 61049 place count 2839 transition count 3440
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 10 with 606 rules applied. Total rules applied 61655 place count 2536 transition count 3137
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 10 with 202 rules applied. Total rules applied 61857 place count 2536 transition count 2935
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 10 with 303 rules applied. Total rules applied 62160 place count 2233 transition count 2935
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 62261 place count 2132 transition count 2834
Applied a total of 62261 rules in 6501 ms. Remains 2132 /33464 variables (removed 31332) and now considering 2834/36265 (removed 33431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6501 ms. Remains : 2132/33464 places, 2834/36265 transitions.
Finished random walk after 732 steps, including 0 resets, run visited all 2 properties in 29 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 371 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Support contains 713 out of 33464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33464/33464 places, 36265/36265 transitions.
Applied a total of 0 rules in 291 ms. Remains 33464 /33464 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
[2024-05-25 17:55:02] [INFO ] Invariant cache hit.
[2024-05-25 17:55:07] [INFO ] Implicit Places using invariants in 4196 ms returned []
Implicit Place search using SMT only with invariants took 4197 ms to find 0 implicit places.
[2024-05-25 17:55:07] [INFO ] Invariant cache hit.
[2024-05-25 17:55:11] [INFO ] Dead Transitions using invariants and state equation in 4589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9083 ms. Remains : 33464/33464 places, 36265/36265 transitions.
Computed a total of 33464 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33464 transition count 36265
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 p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 208 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 17:56:07] [INFO ] Invariant cache hit.
[2024-05-25 17:56:16] [INFO ] [Real]Absence check using 201 positive place invariants in 804 ms returned sat
[2024-05-25 17:56:20] [INFO ] [Real]Absence check using 201 positive and 1824 generalized place invariants in 3099 ms returned sat
[2024-05-25 17:56:32] [INFO ] After 10992ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 17:56:32] [INFO ] After 11008ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 17:56:32] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 713 out of 33464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33464/33464 places, 36265/36265 transitions.
Graph (complete) has 47672 edges and 33464 vertex of which 33363 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.16 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Drop transitions removed 18079 transitions
Trivial Post-agglo rules discarded 18079 transitions
Performed 18079 trivial Post agglomeration. Transition count delta: 18079
Iterating post reduction 0 with 18079 rules applied. Total rules applied 18080 place count 33363 transition count 18085
Reduce places removed 18079 places and 0 transitions.
Iterating post reduction 1 with 18079 rules applied. Total rules applied 36159 place count 15284 transition count 18085
Performed 2323 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2323 Pre rules applied. Total rules applied 36159 place count 15284 transition count 15762
Deduced a syphon composed of 2323 places in 12 ms
Ensure Unique test removed 909 places
Reduce places removed 3232 places and 0 transitions.
Iterating global reduction 2 with 5555 rules applied. Total rules applied 41714 place count 12052 transition count 15762
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 2 with 101 rules applied. Total rules applied 41815 place count 12052 transition count 15661
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 41916 place count 11951 transition count 15661
Discarding 4848 places :
Symmetric choice reduction at 4 with 4848 rule applications. Total rules 46764 place count 7103 transition count 10813
Iterating global reduction 4 with 4848 rules applied. Total rules applied 51612 place count 7103 transition count 10813
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 4 with 808 rules applied. Total rules applied 52420 place count 7002 transition count 10106
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 5 with 707 rules applied. Total rules applied 53127 place count 6295 transition count 10106
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 53127 place count 6295 transition count 10005
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 53329 place count 6194 transition count 10005
Discarding 123 places :
Symmetric choice reduction at 6 with 123 rule applications. Total rules 53452 place count 6071 transition count 7682
Iterating global reduction 6 with 123 rules applied. Total rules applied 53575 place count 6071 transition count 7682
Ensure Unique test removed 606 transitions
Reduce isomorphic transitions removed 606 transitions.
Discarding 505 places :
Implicit places reduction removed 505 places
Drop transitions removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 6 with 1616 rules applied. Total rules applied 55191 place count 5566 transition count 6571
Reduce places removed 505 places and 0 transitions.
Iterating post reduction 7 with 505 rules applied. Total rules applied 55696 place count 5061 transition count 6571
Performed 404 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 404 Pre rules applied. Total rules applied 55696 place count 5061 transition count 6167
Deduced a syphon composed of 404 places in 4 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 8 with 808 rules applied. Total rules applied 56504 place count 4657 transition count 6167
Discarding 1515 places :
Symmetric choice reduction at 8 with 1515 rule applications. Total rules 58019 place count 3142 transition count 4652
Iterating global reduction 8 with 1515 rules applied. Total rules applied 59534 place count 3142 transition count 4652
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 8 with 1313 rules applied. Total rules applied 60847 place count 3041 transition count 3440
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 9 with 202 rules applied. Total rules applied 61049 place count 2839 transition count 3440
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 2 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 10 with 606 rules applied. Total rules applied 61655 place count 2536 transition count 3137
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 10 with 202 rules applied. Total rules applied 61857 place count 2536 transition count 2935
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 10 with 303 rules applied. Total rules applied 62160 place count 2233 transition count 2935
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 62261 place count 2132 transition count 2834
Applied a total of 62261 rules in 6765 ms. Remains 2132 /33464 variables (removed 31332) and now considering 2834/36265 (removed 33431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6770 ms. Remains : 2132/33464 places, 2834/36265 transitions.
Finished random walk after 697 steps, including 0 resets, run visited all 2 properties in 31 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 369 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Product exploration timeout after 39640 steps with 13262 reset in 10001 ms.
Product exploration timeout after 42220 steps with 14091 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Support contains 713 out of 33464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33464/33464 places, 36265/36265 transitions.
Graph (complete) has 47672 edges and 33464 vertex of which 33363 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.39 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Performed 11413 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11413 rules applied. Total rules applied 11414 place count 33363 transition count 36164
Performed 7070 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7070 Pre rules applied. Total rules applied 11414 place count 33363 transition count 36871
Deduced a syphon composed of 18483 places in 38 ms
Iterating global reduction 1 with 7070 rules applied. Total rules applied 18484 place count 33363 transition count 36871
Performed 3939 Post agglomeration using F-continuation condition.Transition count delta: -1111
Deduced a syphon composed of 22422 places in 25 ms
Iterating global reduction 1 with 3939 rules applied. Total rules applied 22423 place count 33363 transition count 37982
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 22523 places in 34 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 22524 place count 33363 transition count 40507
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 22624 places in 17 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 22625 place count 33363 transition count 41517
Applied a total of 22625 rules in 21089 ms. Remains 33363 /33464 variables (removed 101) and now considering 41517/36265 (removed -5252) transitions.
// Phase 1: matrix 41517 rows 33363 cols
[2024-05-25 17:57:25] [INFO ] Computed 2025 invariants in 4288 ms
[2024-05-25 17:57:30] [INFO ] Dead Transitions using invariants and state equation in 8405 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33363/33464 places, 41517/36265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29497 ms. Remains : 33363/33464 places, 41517/36265 transitions.
Built C files in :
/tmp/ltsmin12376792255670680416
[2024-05-25 17:57:30] [INFO ] Built C files in 476ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12376792255670680416
Running compilation step : cd /tmp/ltsmin12376792255670680416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12376792255670680416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12376792255670680416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 713 out of 33464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33464/33464 places, 36265/36265 transitions.
Applied a total of 0 rules in 315 ms. Remains 33464 /33464 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 33464 cols
[2024-05-25 17:57:35] [INFO ] Computed 2025 invariants in 1902 ms
[2024-05-25 17:57:39] [INFO ] Implicit Places using invariants in 5988 ms returned []
Implicit Place search using SMT only with invariants took 5994 ms to find 0 implicit places.
[2024-05-25 17:57:39] [INFO ] Invariant cache hit.
[2024-05-25 17:57:44] [INFO ] Dead Transitions using invariants and state equation in 4127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10438 ms. Remains : 33464/33464 places, 36265/36265 transitions.
Built C files in :
/tmp/ltsmin15760065530478706857
[2024-05-25 17:57:44] [INFO ] Built C files in 371ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15760065530478706857
Running compilation step : cd /tmp/ltsmin15760065530478706857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15760065530478706857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15760065530478706857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 17:57:49] [INFO ] Flatten gal took : 911 ms
[2024-05-25 17:57:50] [INFO ] Flatten gal took : 911 ms
[2024-05-25 17:57:51] [INFO ] Time to serialize gal into /tmp/LTL2733813578105493931.gal : 248 ms
[2024-05-25 17:57:51] [INFO ] Time to serialize properties into /tmp/LTL11547666269679378470.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2733813578105493931.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16633890000727844080.hoa' '-atoms' '/tmp/LTL11547666269679378470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11547666269679378470.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16633890000727844080.hoa
Detected timeout of ITS tools.
[2024-05-25 17:58:07] [INFO ] Flatten gal took : 829 ms
[2024-05-25 17:58:08] [INFO ] Flatten gal took : 876 ms
[2024-05-25 17:58:08] [INFO ] Time to serialize gal into /tmp/LTL15670847943283391939.gal : 148 ms
[2024-05-25 17:58:08] [INFO ] Time to serialize properties into /tmp/LTL6878010630218566972.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15670847943283391939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6878010630218566972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("((((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l3...9417
Formula 0 simplified : X!"((((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38_...9406
Detected timeout of ITS tools.
[2024-05-25 17:58:24] [INFO ] Flatten gal took : 828 ms
[2024-05-25 17:58:24] [INFO ] Applying decomposition
[2024-05-25 17:58:25] [INFO ] Flatten gal took : 875 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12898179995890593521.txt' '-o' '/tmp/graph12898179995890593521.bin' '-w' '/tmp/graph12898179995890593521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12898179995890593521.bin' '-l' '-1' '-v' '-w' '/tmp/graph12898179995890593521.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:58:29] [INFO ] Decomposing Gal with order
[2024-05-25 17:58:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:05:02] [INFO ] Removed a total of 11596 redundant transitions.
[2024-05-25 18:05:03] [INFO ] Flatten gal took : 4951 ms
[2024-05-25 18:05:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4008 labels/synchronizations in 959 ms.
[2024-05-25 18:05:23] [INFO ] Time to serialize gal into /tmp/LTL6449210170094542558.gal : 628 ms
[2024-05-25 18:05:23] [INFO ] Time to serialize properties into /tmp/LTL16313370051640872286.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6449210170094542558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16313370051640872286.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11992761436303154525
[2024-05-25 18:05:39] [INFO ] Built C files in 429ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11992761436303154525
Running compilation step : cd /tmp/ltsmin11992761436303154525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11992761436303154525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11992761436303154525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 finished in 758919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X((G(p1)&&X(G(p2))))))))'
Support contains 1333 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 203 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 33370 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 33369 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 33369 transition count 36265
Applied a total of 206 rules in 882 ms. Remains 33369 /33574 variables (removed 205) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33369 cols
[2024-05-25 18:05:46] [INFO ] Computed 1925 invariants in 2917 ms
[2024-05-25 18:05:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:05:50] [INFO ] Implicit Places using invariants in 7607 ms returned []
Implicit Place search using SMT only with invariants took 7608 ms to find 0 implicit places.
[2024-05-25 18:05:50] [INFO ] Invariant cache hit.
[2024-05-25 18:05:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:05:55] [INFO ] Dead Transitions using invariants and state equation in 4743 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33369/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13252 ms. Remains : 33369/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 214 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s20519 s20520 s20521 s20522 s20523 s20524 s20525 s20526 s20527 s20528 s20529) (ADD s19408 s19409 s19410 s19411 s19412 s19413 s19414 s19415 s1...], 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]]
Product exploration explored 100000 steps with 122 reset in 5733 ms.
Product exploration explored 100000 steps with 119 reset in 5137 ms.
Computed a total of 33369 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33369 transition count 36265
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 p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 467 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 18:07:11] [INFO ] Invariant cache hit.
[2024-05-25 18:07:18] [INFO ] After 7086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:07:29] [INFO ] [Nat]Absence check using 0 positive and 1925 generalized place invariants in 4176 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 18:07:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 18:07:43] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1333 out of 33369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33369/33369 places, 36265/36265 transitions.
Graph (complete) has 48076 edges and 33369 vertex of which 31746 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.15 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 16160 rules applied. Total rules applied 16161 place count 31746 transition count 18584
Reduce places removed 16160 places and 0 transitions.
Performed 1717 Post agglomeration using F-continuation condition.Transition count delta: 1717
Iterating post reduction 1 with 17877 rules applied. Total rules applied 34038 place count 15586 transition count 16867
Reduce places removed 1717 places and 0 transitions.
Iterating post reduction 2 with 1717 rules applied. Total rules applied 35755 place count 13869 transition count 16867
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1717 Pre rules applied. Total rules applied 35755 place count 13869 transition count 15150
Deduced a syphon composed of 1717 places in 10 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 3 with 4343 rules applied. Total rules applied 40098 place count 11243 transition count 15150
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 707 rules applied. Total rules applied 40805 place count 11243 transition count 14443
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 41512 place count 10536 transition count 14443
Discarding 3130 places :
Symmetric choice reduction at 5 with 3130 rule applications. Total rules 44642 place count 7406 transition count 11113
Iterating global reduction 5 with 3130 rules applied. Total rules applied 47772 place count 7406 transition count 11113
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 5 with 1111 rules applied. Total rules applied 48883 place count 7204 transition count 10204
Reduce places removed 404 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 6 with 505 rules applied. Total rules applied 49388 place count 6800 transition count 10103
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 49489 place count 6699 transition count 10103
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 49489 place count 6699 transition count 10002
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 49691 place count 6598 transition count 10002
Discarding 605 places :
Symmetric choice reduction at 8 with 605 rule applications. Total rules 50296 place count 5993 transition count 8897
Iterating global reduction 8 with 605 rules applied. Total rules applied 50901 place count 5993 transition count 8897
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 808 rules applied. Total rules applied 51709 place count 5791 transition count 8291
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 9 with 202 rules applied. Total rules applied 51911 place count 5690 transition count 8190
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 52012 place count 5589 transition count 8190
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 2 ms
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 11 with 707 rules applied. Total rules applied 52719 place count 5185 transition count 7887
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 52921 place count 5084 transition count 7786
Free-agglomeration rule (complex) applied 1723 times.
Iterating global reduction 11 with 1723 rules applied. Total rules applied 54644 place count 5084 transition count 6063
Ensure Unique test removed 101 places
Reduce places removed 1824 places and 0 transitions.
Iterating post reduction 11 with 1824 rules applied. Total rules applied 56468 place count 3260 transition count 6063
Discarding 100 places :
Symmetric choice reduction at 12 with 100 rule applications. Total rules 56568 place count 3160 transition count 5463
Iterating global reduction 12 with 100 rules applied. Total rules applied 56668 place count 3160 transition count 5463
Discarding 100 places :
Symmetric choice reduction at 12 with 100 rule applications. Total rules 56768 place count 3060 transition count 4863
Iterating global reduction 12 with 100 rules applied. Total rules applied 56868 place count 3060 transition count 4863
Applied a total of 56868 rules in 8886 ms. Remains 3060 /33369 variables (removed 30309) and now considering 4863/36265 (removed 31402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8886 ms. Remains : 3060/33369 places, 4863/36265 transitions.
Finished random walk after 492 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1446 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1333 out of 33369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33369/33369 places, 36265/36265 transitions.
Applied a total of 0 rules in 417 ms. Remains 33369 /33369 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
[2024-05-25 18:07:54] [INFO ] Invariant cache hit.
[2024-05-25 18:07:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:07:58] [INFO ] Implicit Places using invariants in 4150 ms returned []
Implicit Place search using SMT only with invariants took 4153 ms to find 0 implicit places.
[2024-05-25 18:07:58] [INFO ] Invariant cache hit.
[2024-05-25 18:08:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:08:02] [INFO ] Dead Transitions using invariants and state equation in 4106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8679 ms. Remains : 33369/33369 places, 36265/36265 transitions.
Computed a total of 33369 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33369 transition count 36265
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 p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=12 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 18:09:02] [INFO ] Invariant cache hit.
[2024-05-25 18:09:09] [INFO ] After 6601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:09:20] [INFO ] [Nat]Absence check using 0 positive and 1925 generalized place invariants in 4148 ms returned sat
[2024-05-25 18:09:34] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1333 out of 33369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33369/33369 places, 36265/36265 transitions.
Graph (complete) has 48076 edges and 33369 vertex of which 31746 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.23 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 16160 rules applied. Total rules applied 16161 place count 31746 transition count 18584
Reduce places removed 16160 places and 0 transitions.
Performed 1717 Post agglomeration using F-continuation condition.Transition count delta: 1717
Iterating post reduction 1 with 17877 rules applied. Total rules applied 34038 place count 15586 transition count 16867
Reduce places removed 1717 places and 0 transitions.
Iterating post reduction 2 with 1717 rules applied. Total rules applied 35755 place count 13869 transition count 16867
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1717 Pre rules applied. Total rules applied 35755 place count 13869 transition count 15150
Deduced a syphon composed of 1717 places in 10 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 3 with 4343 rules applied. Total rules applied 40098 place count 11243 transition count 15150
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 707 rules applied. Total rules applied 40805 place count 11243 transition count 14443
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 41512 place count 10536 transition count 14443
Discarding 3130 places :
Symmetric choice reduction at 5 with 3130 rule applications. Total rules 44642 place count 7406 transition count 11113
Iterating global reduction 5 with 3130 rules applied. Total rules applied 47772 place count 7406 transition count 11113
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 5 with 1111 rules applied. Total rules applied 48883 place count 7204 transition count 10204
Reduce places removed 404 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 6 with 505 rules applied. Total rules applied 49388 place count 6800 transition count 10103
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 49489 place count 6699 transition count 10103
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 49489 place count 6699 transition count 10002
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 49691 place count 6598 transition count 10002
Discarding 605 places :
Symmetric choice reduction at 8 with 605 rule applications. Total rules 50296 place count 5993 transition count 8897
Iterating global reduction 8 with 605 rules applied. Total rules applied 50901 place count 5993 transition count 8897
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 808 rules applied. Total rules applied 51709 place count 5791 transition count 8291
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 9 with 202 rules applied. Total rules applied 51911 place count 5690 transition count 8190
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 52012 place count 5589 transition count 8190
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 3 ms
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 11 with 707 rules applied. Total rules applied 52719 place count 5185 transition count 7887
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 52921 place count 5084 transition count 7786
Free-agglomeration rule (complex) applied 1723 times.
Iterating global reduction 11 with 1723 rules applied. Total rules applied 54644 place count 5084 transition count 6063
Ensure Unique test removed 101 places
Reduce places removed 1824 places and 0 transitions.
Iterating post reduction 11 with 1824 rules applied. Total rules applied 56468 place count 3260 transition count 6063
Discarding 100 places :
Symmetric choice reduction at 12 with 100 rule applications. Total rules 56568 place count 3160 transition count 5463
Iterating global reduction 12 with 100 rules applied. Total rules applied 56668 place count 3160 transition count 5463
Discarding 100 places :
Symmetric choice reduction at 12 with 100 rule applications. Total rules 56768 place count 3060 transition count 4863
Iterating global reduction 12 with 100 rules applied. Total rules applied 56868 place count 3060 transition count 4863
Applied a total of 56868 rules in 8543 ms. Remains 3060 /33369 variables (removed 30309) and now considering 4863/36265 (removed 31402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8543 ms. Remains : 3060/33369 places, 4863/36265 transitions.
Finished random walk after 423 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1268 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 290 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 122 reset in 5246 ms.
Product exploration explored 100000 steps with 122 reset in 5092 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 193 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1333 out of 33369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33369/33369 places, 36265/36265 transitions.
Graph (complete) has 48076 edges and 33369 vertex of which 31746 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.40 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Performed 10605 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10605 rules applied. Total rules applied 10606 place count 31746 transition count 34744
Performed 8080 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8080 Pre rules applied. Total rules applied 10606 place count 31746 transition count 35451
Deduced a syphon composed of 18685 places in 32 ms
Iterating global reduction 1 with 8080 rules applied. Total rules applied 18686 place count 31746 transition count 35451
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 18786 place count 31646 transition count 35151
Deduced a syphon composed of 18685 places in 29 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 18886 place count 31646 transition count 35151
Performed 1414 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 20099 places in 21 ms
Iterating global reduction 1 with 1414 rules applied. Total rules applied 20300 place count 31646 transition count 36161
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 20200 places in 16 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 20401 place count 31646 transition count 38686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 20301 places in 16 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 20502 place count 31646 transition count 39696
Deduced a syphon composed of 20301 places in 16 ms
Applied a total of 20502 rules in 19812 ms. Remains 31646 /33369 variables (removed 1723) and now considering 39696/36265 (removed -3431) transitions.
// Phase 1: matrix 39696 rows 31646 cols
[2024-05-25 18:10:19] [INFO ] Computed 1722 invariants in 4030 ms
[2024-05-25 18:10:23] [INFO ] Dead Transitions using invariants and state equation in 8109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31646/33369 places, 39696/36265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27925 ms. Remains : 31646/33369 places, 39696/36265 transitions.
Built C files in :
/tmp/ltsmin3575319340211511766
[2024-05-25 18:10:24] [INFO ] Built C files in 430ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3575319340211511766
Running compilation step : cd /tmp/ltsmin3575319340211511766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3575319340211511766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3575319340211511766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1333 out of 33369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33369/33369 places, 36265/36265 transitions.
Applied a total of 0 rules in 266 ms. Remains 33369 /33369 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 33369 cols
[2024-05-25 18:10:29] [INFO ] Computed 1925 invariants in 2178 ms
[2024-05-25 18:10:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:10:33] [INFO ] Implicit Places using invariants in 6480 ms returned []
Implicit Place search using SMT only with invariants took 6496 ms to find 0 implicit places.
[2024-05-25 18:10:33] [INFO ] Invariant cache hit.
[2024-05-25 18:10:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:10:38] [INFO ] Dead Transitions using invariants and state equation in 4520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11287 ms. Remains : 33369/33369 places, 36265/36265 transitions.
Built C files in :
/tmp/ltsmin13688210326906138286
[2024-05-25 18:10:38] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13688210326906138286
Running compilation step : cd /tmp/ltsmin13688210326906138286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13688210326906138286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13688210326906138286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 18:10:43] [INFO ] Flatten gal took : 938 ms
[2024-05-25 18:10:44] [INFO ] Flatten gal took : 924 ms
[2024-05-25 18:10:44] [INFO ] Time to serialize gal into /tmp/LTL89887137075139888.gal : 141 ms
[2024-05-25 18:10:44] [INFO ] Time to serialize properties into /tmp/LTL5708500217109764063.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL89887137075139888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1171753065080843378.hoa' '-atoms' '/tmp/LTL5708500217109764063.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL5708500217109764063.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1171753065080843378.hoa
Detected timeout of ITS tools.
[2024-05-25 18:11:01] [INFO ] Flatten gal took : 876 ms
[2024-05-25 18:11:02] [INFO ] Flatten gal took : 906 ms
[2024-05-25 18:11:02] [INFO ] Time to serialize gal into /tmp/LTL6270305479471836206.gal : 137 ms
[2024-05-25 18:11:02] [INFO ] Time to serialize properties into /tmp/LTL17972854343934145500.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6270305479471836206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17972854343934145500.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0_0+ml3_1_0)+(ml3_2_0+ml3_3_0)...14223
Formula 0 simplified : XF(G!"(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0_0+ml3_1_0)+(ml3_2_0+ml3_3_0))+(...14207
Detected timeout of ITS tools.
[2024-05-25 18:11:18] [INFO ] Flatten gal took : 1093 ms
[2024-05-25 18:11:18] [INFO ] Applying decomposition
[2024-05-25 18:11:19] [INFO ] Flatten gal took : 954 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17515310056430517589.txt' '-o' '/tmp/graph17515310056430517589.bin' '-w' '/tmp/graph17515310056430517589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17515310056430517589.bin' '-l' '-1' '-v' '-w' '/tmp/graph17515310056430517589.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:11:24] [INFO ] Decomposing Gal with order
[2024-05-25 18:11:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:19:21] [INFO ] Removed a total of 13864 redundant transitions.
[2024-05-25 18:19:22] [INFO ] Flatten gal took : 6402 ms
[2024-05-25 18:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 3918 labels/synchronizations in 604 ms.
[2024-05-25 18:19:30] [INFO ] Time to serialize gal into /tmp/LTL10033090011885406955.gal : 254 ms
[2024-05-25 18:19:30] [INFO ] Time to serialize properties into /tmp/LTL11937279026755333414.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10033090011885406955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11937279026755333414.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14158979410795856030
[2024-05-25 18:19:45] [INFO ] Built C files in 269ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14158979410795856030
Running compilation step : cd /tmp/ltsmin14158979410795856030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14158979410795856030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14158979410795856030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 finished in 846698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 33574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Graph (complete) has 48584 edges and 33574 vertex of which 33 are kept as prefixes of interest. Removing 33541 places using SCC suffix rule.32 ms
Discarding 33541 places :
Also discarding 36324 output transitions
Drop transitions removed 36324 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 32 transition count 24
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 15 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 44 place count 6 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 6 transition count 15
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 62 place count 6 transition count 6
Applied a total of 62 rules in 76 ms. Remains 6 /33574 variables (removed 33568) and now considering 6/36366 (removed 36360) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 18:19:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 18:19:49] [INFO ] Implicit Places using invariants in 33 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/33574 places, 6/36366 transitions.
Graph (complete) has 4 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 3 ms. Remains 3 /5 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:19:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:19:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 18:19:49] [INFO ] Invariant cache hit.
[2024-05-25 18:19:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/33574 places, 4/36366 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 3/33574 places, 4/36366 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s2)], 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 33257 reset in 90 ms.
Product exploration explored 100000 steps with 33397 reset in 106 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 4
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 p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(X(X(p2))||(!p0 U G(p3))))))'
Support contains 6 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 209 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 33364 transition count 36366
Applied a total of 210 rules in 540 ms. Remains 33364 /33574 variables (removed 210) and now considering 36366/36366 (removed 0) transitions.
// Phase 1: matrix 36366 rows 33364 cols
[2024-05-25 18:19:52] [INFO ] Computed 1924 invariants in 2535 ms
[2024-05-25 18:19:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:19:56] [INFO ] Implicit Places using invariants in 6896 ms returned []
Implicit Place search using SMT only with invariants took 6898 ms to find 0 implicit places.
[2024-05-25 18:19:56] [INFO ] Invariant cache hit.
[2024-05-25 18:20:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:20:01] [INFO ] Dead Transitions using invariants and state equation in 4379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33364/33574 places, 36366/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11819 ms. Remains : 33364/33574 places, 36366/36366 transitions.
Stuttering acceptance computed with spot in 702 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p3), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(NOT p0), acceptance={} source=5 dest: 8}, { cond=(AND p0 p3), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={} source=6 dest: 7}, { cond=p3, acceptance={} source=6 dest: 9}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p3), acceptance={} source=10 dest: 2}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(AND p0 p3), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p3), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p0:(LEQ s22584 s25603), p1:(LEQ 1 s16978), p3:(LEQ 1 s20524), p2:(LEQ s7885 s16924)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 56500 steps with 14125 reset in 10002 ms.
Product exploration timeout after 57660 steps with 14415 reset in 10002 ms.
Computed a total of 33364 stabilizing places and 36366 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33364 transition count 36366
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 p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p3))), (X (X (AND p0 (NOT p3)))), true, (X (X p0)), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND p0 p3)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1901 ms. Reduced automaton from 12 states, 27 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167334 steps, run timeout after 3002 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167334 steps, saw 165700 distinct states, run finished after 3007 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 18:21:33] [INFO ] Invariant cache hit.
[2024-05-25 18:21:39] [INFO ] After 6918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:21:51] [INFO ] [Nat]Absence check using 0 positive and 1924 generalized place invariants in 4775 ms returned sat
[2024-05-25 18:22:04] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 33364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33364/33364 places, 36366/36366 transitions.
Graph (complete) has 47571 edges and 33364 vertex of which 29348 are kept as prefixes of interest. Removing 4016 places using SCC suffix rule.16 ms
Discarding 4016 places :
Also discarding 3814 output transitions
Drop transitions removed 3814 transitions
Drop transitions removed 696 transitions
Reduce isomorphic transitions removed 696 transitions.
Drop transitions removed 18994 transitions
Trivial Post-agglo rules discarded 18994 transitions
Performed 18994 trivial Post agglomeration. Transition count delta: 18994
Iterating post reduction 0 with 19690 rules applied. Total rules applied 19691 place count 29348 transition count 12862
Reduce places removed 18994 places and 0 transitions.
Iterating post reduction 1 with 18994 rules applied. Total rules applied 38685 place count 10354 transition count 12862
Performed 1817 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1817 Pre rules applied. Total rules applied 38685 place count 10354 transition count 11045
Deduced a syphon composed of 1817 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 2726 places and 0 transitions.
Iterating global reduction 2 with 4543 rules applied. Total rules applied 43228 place count 7628 transition count 11045
Drop transitions removed 608 transitions
Trivial Post-agglo rules discarded 608 transitions
Performed 608 trivial Post agglomeration. Transition count delta: 608
Iterating post reduction 2 with 608 rules applied. Total rules applied 43836 place count 7628 transition count 10437
Reduce places removed 608 places and 0 transitions.
Iterating post reduction 3 with 608 rules applied. Total rules applied 44444 place count 7020 transition count 10437
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 99 Pre rules applied. Total rules applied 44444 place count 7020 transition count 10338
Deduced a syphon composed of 99 places in 5 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 44642 place count 6921 transition count 10338
Discarding 3648 places :
Symmetric choice reduction at 4 with 3648 rule applications. Total rules 48290 place count 3273 transition count 6200
Iterating global reduction 4 with 3648 rules applied. Total rules applied 51938 place count 3273 transition count 6200
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 609 transitions
Trivial Post-agglo rules discarded 609 transitions
Performed 609 trivial Post agglomeration. Transition count delta: 609
Iterating post reduction 4 with 1316 rules applied. Total rules applied 53254 place count 3071 transition count 5086
Reduce places removed 609 places and 0 transitions.
Iterating post reduction 5 with 609 rules applied. Total rules applied 53863 place count 2462 transition count 5086
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 53863 place count 2462 transition count 5084
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 53867 place count 2460 transition count 5084
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 53887 place count 2440 transition count 3559
Iterating global reduction 6 with 20 rules applied. Total rules applied 53907 place count 2440 transition count 3559
Ensure Unique test removed 520 transitions
Reduce isomorphic transitions removed 520 transitions.
Discarding 305 places :
Implicit places reduction removed 305 places
Drop transitions removed 305 transitions
Trivial Post-agglo rules discarded 305 transitions
Performed 305 trivial Post agglomeration. Transition count delta: 305
Iterating post reduction 6 with 1130 rules applied. Total rules applied 55037 place count 2135 transition count 2734
Reduce places removed 305 places and 0 transitions.
Iterating post reduction 7 with 305 rules applied. Total rules applied 55342 place count 1830 transition count 2734
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 55342 place count 1830 transition count 2532
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 55746 place count 1628 transition count 2532
Discarding 1108 places :
Symmetric choice reduction at 8 with 1108 rule applications. Total rules 56854 place count 520 transition count 1424
Iterating global reduction 8 with 1108 rules applied. Total rules applied 57962 place count 520 transition count 1424
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 8 with 1314 rules applied. Total rules applied 59276 place count 419 transition count 211
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 9 with 203 rules applied. Total rules applied 59479 place count 216 transition count 211
Discarding 98 places :
Symmetric choice reduction at 10 with 98 rule applications. Total rules 59577 place count 118 transition count 113
Iterating global reduction 10 with 98 rules applied. Total rules applied 59675 place count 118 transition count 113
Discarding 98 places :
Symmetric choice reduction at 10 with 98 rule applications. Total rules 59773 place count 20 transition count 15
Iterating global reduction 10 with 98 rules applied. Total rules applied 59871 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 59873 place count 19 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 59874 place count 19 transition count 13
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 59876 place count 17 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 59879 place count 14 transition count 10
Applied a total of 59879 rules in 2789 ms. Remains 14 /33364 variables (removed 33350) and now considering 10/36366 (removed 36356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2789 ms. Remains : 14/33364 places, 10/36366 transitions.
Finished random walk after 207 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=207 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p3))), (X (X (AND p0 (NOT p3)))), true, (X (X p0)), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND p0 p3)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 15 factoid took 1798 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 33364 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 33364/33364 places, 36366/36366 transitions.
Applied a total of 0 rules in 469 ms. Remains 33364 /33364 variables (removed 0) and now considering 36366/36366 (removed 0) transitions.
[2024-05-25 18:22:10] [INFO ] Invariant cache hit.
[2024-05-25 18:22:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:22:14] [INFO ] Implicit Places using invariants in 4224 ms returned []
Implicit Place search using SMT only with invariants took 4225 ms to find 0 implicit places.
[2024-05-25 18:22:14] [INFO ] Invariant cache hit.
[2024-05-25 18:22:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:22:18] [INFO ] Dead Transitions using invariants and state equation in 4239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8935 ms. Remains : 33364/33364 places, 36366/36366 transitions.
Computed a total of 33364 stabilizing places and 36366 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33364 transition count 36366
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 : [p2, true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 169384 steps, run timeout after 3002 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169384 steps, saw 167730 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 18:23:27] [INFO ] Invariant cache hit.
[2024-05-25 18:23:33] [INFO ] After 6876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:23:45] [INFO ] [Nat]Absence check using 0 positive and 1924 generalized place invariants in 4689 ms returned sat
[2024-05-25 18:23:58] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 33364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33364/33364 places, 36366/36366 transitions.
Graph (complete) has 47571 edges and 33364 vertex of which 29348 are kept as prefixes of interest. Removing 4016 places using SCC suffix rule.17 ms
Discarding 4016 places :
Also discarding 3814 output transitions
Drop transitions removed 3814 transitions
Drop transitions removed 696 transitions
Reduce isomorphic transitions removed 696 transitions.
Drop transitions removed 18994 transitions
Trivial Post-agglo rules discarded 18994 transitions
Performed 18994 trivial Post agglomeration. Transition count delta: 18994
Iterating post reduction 0 with 19690 rules applied. Total rules applied 19691 place count 29348 transition count 12862
Reduce places removed 18994 places and 0 transitions.
Iterating post reduction 1 with 18994 rules applied. Total rules applied 38685 place count 10354 transition count 12862
Performed 1817 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1817 Pre rules applied. Total rules applied 38685 place count 10354 transition count 11045
Deduced a syphon composed of 1817 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2726 places and 0 transitions.
Iterating global reduction 2 with 4543 rules applied. Total rules applied 43228 place count 7628 transition count 11045
Drop transitions removed 608 transitions
Trivial Post-agglo rules discarded 608 transitions
Performed 608 trivial Post agglomeration. Transition count delta: 608
Iterating post reduction 2 with 608 rules applied. Total rules applied 43836 place count 7628 transition count 10437
Reduce places removed 608 places and 0 transitions.
Iterating post reduction 3 with 608 rules applied. Total rules applied 44444 place count 7020 transition count 10437
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 99 Pre rules applied. Total rules applied 44444 place count 7020 transition count 10338
Deduced a syphon composed of 99 places in 5 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 44642 place count 6921 transition count 10338
Discarding 3648 places :
Symmetric choice reduction at 4 with 3648 rule applications. Total rules 48290 place count 3273 transition count 6200
Iterating global reduction 4 with 3648 rules applied. Total rules applied 51938 place count 3273 transition count 6200
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 609 transitions
Trivial Post-agglo rules discarded 609 transitions
Performed 609 trivial Post agglomeration. Transition count delta: 609
Iterating post reduction 4 with 1316 rules applied. Total rules applied 53254 place count 3071 transition count 5086
Reduce places removed 609 places and 0 transitions.
Iterating post reduction 5 with 609 rules applied. Total rules applied 53863 place count 2462 transition count 5086
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 53863 place count 2462 transition count 5084
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 53867 place count 2460 transition count 5084
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 53887 place count 2440 transition count 3559
Iterating global reduction 6 with 20 rules applied. Total rules applied 53907 place count 2440 transition count 3559
Ensure Unique test removed 520 transitions
Reduce isomorphic transitions removed 520 transitions.
Discarding 305 places :
Implicit places reduction removed 305 places
Drop transitions removed 305 transitions
Trivial Post-agglo rules discarded 305 transitions
Performed 305 trivial Post agglomeration. Transition count delta: 305
Iterating post reduction 6 with 1130 rules applied. Total rules applied 55037 place count 2135 transition count 2734
Reduce places removed 305 places and 0 transitions.
Iterating post reduction 7 with 305 rules applied. Total rules applied 55342 place count 1830 transition count 2734
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 55342 place count 1830 transition count 2532
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 55746 place count 1628 transition count 2532
Discarding 1108 places :
Symmetric choice reduction at 8 with 1108 rule applications. Total rules 56854 place count 520 transition count 1424
Iterating global reduction 8 with 1108 rules applied. Total rules applied 57962 place count 520 transition count 1424
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 8 with 1314 rules applied. Total rules applied 59276 place count 419 transition count 211
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 9 with 203 rules applied. Total rules applied 59479 place count 216 transition count 211
Discarding 98 places :
Symmetric choice reduction at 10 with 98 rule applications. Total rules 59577 place count 118 transition count 113
Iterating global reduction 10 with 98 rules applied. Total rules applied 59675 place count 118 transition count 113
Discarding 98 places :
Symmetric choice reduction at 10 with 98 rule applications. Total rules 59773 place count 20 transition count 15
Iterating global reduction 10 with 98 rules applied. Total rules applied 59871 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 59873 place count 19 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 59874 place count 19 transition count 13
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 59876 place count 17 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 59879 place count 14 transition count 10
Applied a total of 59879 rules in 2622 ms. Remains 14 /33364 variables (removed 33350) and now considering 10/36366 (removed 36356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2622 ms. Remains : 14/33364 places, 10/36366 transitions.
Finished random walk after 205 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=205 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration timeout after 57690 steps with 14422 reset in 10002 ms.
Product exploration timeout after 56590 steps with 14147 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 33364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33364/33364 places, 36366/36366 transitions.
Graph (complete) has 47571 edges and 33364 vertex of which 31741 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.50 ms
Discarding 1623 places :
Also discarding 1621 output transitions
Drop transitions removed 1621 transitions
Performed 12322 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12322 rules applied. Total rules applied 12323 place count 31741 transition count 34745
Performed 7070 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7070 Pre rules applied. Total rules applied 12323 place count 31741 transition count 35452
Deduced a syphon composed of 19392 places in 36 ms
Iterating global reduction 1 with 7070 rules applied. Total rules applied 19393 place count 31741 transition count 35452
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 19493 place count 31641 transition count 35153
Deduced a syphon composed of 19392 places in 36 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 19593 place count 31641 transition count 35153
Performed 3736 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 23128 places in 22 ms
Iterating global reduction 1 with 3736 rules applied. Total rules applied 23329 place count 31641 transition count 36163
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 23229 places in 26 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 23430 place count 31641 transition count 38688
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 23330 places in 28 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 23531 place count 31641 transition count 39698
Deduced a syphon composed of 23330 places in 13 ms
Applied a total of 23531 rules in 23487 ms. Remains 31641 /33364 variables (removed 1723) and now considering 39698/36366 (removed -3332) transitions.
// Phase 1: matrix 39698 rows 31641 cols
[2024-05-25 18:24:50] [INFO ] Computed 1721 invariants in 4512 ms
[2024-05-25 18:24:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:24:54] [INFO ] Dead Transitions using invariants and state equation in 8539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31641/33364 places, 39698/36366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32029 ms. Remains : 31641/33364 places, 39698/36366 transitions.
Built C files in :
/tmp/ltsmin14019860780809551262
[2024-05-25 18:24:54] [INFO ] Built C files in 278ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14019860780809551262
Running compilation step : cd /tmp/ltsmin14019860780809551262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14019860780809551262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14019860780809551262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 33364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33364/33364 places, 36366/36366 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33363 transition count 36265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33363 transition count 36265
Applied a total of 2 rules in 661 ms. Remains 33363 /33364 variables (removed 1) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2024-05-25 18:25:04] [INFO ] Computed 1924 invariants in 5842 ms
[2024-05-25 18:25:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:25:08] [INFO ] Implicit Places using invariants in 10198 ms returned []
Implicit Place search using SMT only with invariants took 10198 ms to find 0 implicit places.
[2024-05-25 18:25:08] [INFO ] Invariant cache hit.
[2024-05-25 18:25:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:25:13] [INFO ] Dead Transitions using invariants and state equation in 4404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/33364 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15267 ms. Remains : 33363/33364 places, 36265/36366 transitions.
Built C files in :
/tmp/ltsmin15331630421373532170
[2024-05-25 18:25:13] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15331630421373532170
Running compilation step : cd /tmp/ltsmin15331630421373532170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15331630421373532170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15331630421373532170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 18:25:18] [INFO ] Flatten gal took : 965 ms
[2024-05-25 18:25:19] [INFO ] Flatten gal took : 954 ms
[2024-05-25 18:25:19] [INFO ] Time to serialize gal into /tmp/LTL7986308766694351148.gal : 138 ms
[2024-05-25 18:25:19] [INFO ] Time to serialize properties into /tmp/LTL14800654545391622379.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7986308766694351148.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8219840882423560433.hoa' '-atoms' '/tmp/LTL14800654545391622379.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2024-05-25 18:25:36] [INFO ] Flatten gal took : 923 ms
[2024-05-25 18:25:37] [INFO ] Flatten gal took : 961 ms
[2024-05-25 18:25:37] [INFO ] Time to serialize gal into /tmp/LTL11455940852854707278.gal : 162 ms
[2024-05-25 18:25:37] [INFO ] Time to serialize properties into /tmp/LTL4441664374240229733.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11455940852854707278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4441664374240229733.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-25 18:25:53] [INFO ] Flatten gal took : 1164 ms
[2024-05-25 18:25:53] [INFO ] Applying decomposition
[2024-05-25 18:25:54] [INFO ] Flatten gal took : 952 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6290790952235585683.txt' '-o' '/tmp/graph6290790952235585683.bin' '-w' '/tmp/graph6290790952235585683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6290790952235585683.bin' '-l' '-1' '-v' '-w' '/tmp/graph6290790952235585683.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:25:58] [INFO ] Decomposing Gal with order
[2024-05-25 18:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:34:15] [INFO ] Removed a total of 12172 redundant transitions.
[2024-05-25 18:34:15] [INFO ] Flatten gal took : 1624 ms
[2024-05-25 18:34:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 615 labels/synchronizations in 205 ms.
[2024-05-25 18:34:24] [INFO ] Time to serialize gal into /tmp/LTL10558868810733583161.gal : 269 ms
[2024-05-25 18:34:24] [INFO ] Time to serialize properties into /tmp/LTL11638936507887796375.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10558868810733583161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11638936507887796375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15973327475882215797
[2024-05-25 18:34:39] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15973327475882215797
Running compilation step : cd /tmp/ltsmin15973327475882215797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15973327475882215797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15973327475882215797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 finished in 893305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 33365 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 210 place count 33364 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 211 place count 33364 transition count 36265
Applied a total of 211 rules in 813 ms. Remains 33364 /33574 variables (removed 210) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33364 cols
[2024-05-25 18:34:45] [INFO ] Computed 1925 invariants in 2315 ms
[2024-05-25 18:34:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:34:50] [INFO ] Implicit Places using invariants in 6578 ms returned []
Implicit Place search using SMT only with invariants took 6579 ms to find 0 implicit places.
[2024-05-25 18:34:50] [INFO ] Invariant cache hit.
[2024-05-25 18:34:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:34:54] [INFO ] Dead Transitions using invariants and state equation in 4530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33364/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11924 ms. Remains : 33364/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s33265 s18089), p1:(OR (NOT (LEQ s33265 s18089)) (GT 1 s21184))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4454 steps with 0 reset in 180 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 finished in 12475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||(p0&&G(p1)))))'
Support contains 3 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 209 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 33364 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 33363 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 33363 transition count 36265
Applied a total of 212 rules in 965 ms. Remains 33363 /33574 variables (removed 211) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2024-05-25 18:34:58] [INFO ] Computed 1924 invariants in 2359 ms
[2024-05-25 18:35:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:35:02] [INFO ] Implicit Places using invariants in 6771 ms returned []
Implicit Place search using SMT only with invariants took 6775 ms to find 0 implicit places.
[2024-05-25 18:35:02] [INFO ] Invariant cache hit.
[2024-05-25 18:35:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:35:07] [INFO ] Dead Transitions using invariants and state equation in 4640 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12384 ms. Remains : 33363/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT s20513 1), p0:(LEQ s7612 s25214)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 finished in 12764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(F(p1))&&F(p2)))))'
Support contains 5 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 208 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 33365 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 210 place count 33364 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 211 place count 33364 transition count 36265
Applied a total of 211 rules in 807 ms. Remains 33364 /33574 variables (removed 210) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33364 cols
[2024-05-25 18:35:10] [INFO ] Computed 1924 invariants in 2190 ms
[2024-05-25 18:35:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:35:15] [INFO ] Implicit Places using invariants in 6966 ms returned []
Implicit Place search using SMT only with invariants took 6969 ms to find 0 implicit places.
[2024-05-25 18:35:15] [INFO ] Invariant cache hit.
[2024-05-25 18:35:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 18:35:20] [INFO ] Dead Transitions using invariants and state equation in 4407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33364/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12186 ms. Remains : 33364/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s24617 s26529), p2:(LEQ s32559 s32252), p1:(GT 2 s14750)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 46450 steps with 15483 reset in 10001 ms.
Product exploration timeout after 46000 steps with 15333 reset in 10001 ms.
Computed a total of 33364 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33364 transition count 36265
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 p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 21 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 finished in 91789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&G((p0 U X((p1||X(G(p2))))))))'
Support contains 5 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Reduce places removed 208 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 33365 transition count 36366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 210 place count 33364 transition count 36265
Iterating global reduction 1 with 1 rules applied. Total rules applied 211 place count 33364 transition count 36265
Applied a total of 211 rules in 721 ms. Remains 33364 /33574 variables (removed 210) and now considering 36265/36366 (removed 101) transitions.
// Phase 1: matrix 36265 rows 33364 cols
[2024-05-25 18:36:42] [INFO ] Computed 1925 invariants in 2411 ms
[2024-05-25 18:36:46] [INFO ] Implicit Places using invariants in 6497 ms returned []
Implicit Place search using SMT only with invariants took 6499 ms to find 0 implicit places.
[2024-05-25 18:36:46] [INFO ] Invariant cache hit.
[2024-05-25 18:36:51] [INFO ] Dead Transitions using invariants and state equation in 4199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33364/33574 places, 36265/36366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11423 ms. Remains : 33364/33574 places, 36265/36366 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s21018 s8555), p1:(LEQ s23703 s22948), p2:(LEQ 1 s173)], 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 2062 steps with 1 reset in 59 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 finished in 11913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0))||X(G(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X((G(p1)&&X(G(p2))))))))'
Found a Lengthening insensitive property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07
Stuttering acceptance computed with spot in 277 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1333 out of 33574 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33574/33574 places, 36366/36366 transitions.
Graph (complete) has 48584 edges and 33574 vertex of which 31747 are kept as prefixes of interest. Removing 1827 places using SCC suffix rule.53 ms
Discarding 1827 places :
Also discarding 1622 output transitions
Drop transitions removed 1622 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 16161 rules applied. Total rules applied 16162 place count 31645 transition count 18483
Reduce places removed 16160 places and 0 transitions.
Performed 1717 Post agglomeration using F-continuation condition.Transition count delta: 1717
Iterating post reduction 1 with 17877 rules applied. Total rules applied 34039 place count 15485 transition count 16766
Reduce places removed 1717 places and 0 transitions.
Iterating post reduction 2 with 1717 rules applied. Total rules applied 35756 place count 13768 transition count 16766
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1717 Pre rules applied. Total rules applied 35756 place count 13768 transition count 15049
Deduced a syphon composed of 1717 places in 15 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 3 with 4343 rules applied. Total rules applied 40099 place count 11142 transition count 15049
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 707 rules applied. Total rules applied 40806 place count 11142 transition count 14342
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 41513 place count 10435 transition count 14342
Discarding 3130 places :
Symmetric choice reduction at 5 with 3130 rule applications. Total rules 44643 place count 7305 transition count 11012
Iterating global reduction 5 with 3130 rules applied. Total rules applied 47773 place count 7305 transition count 11012
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 5 with 1111 rules applied. Total rules applied 48884 place count 7103 transition count 10103
Reduce places removed 404 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 6 with 505 rules applied. Total rules applied 49389 place count 6699 transition count 10002
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 49490 place count 6598 transition count 10002
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 49490 place count 6598 transition count 9901
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 49692 place count 6497 transition count 9901
Discarding 605 places :
Symmetric choice reduction at 8 with 605 rule applications. Total rules 50297 place count 5892 transition count 8796
Iterating global reduction 8 with 605 rules applied. Total rules applied 50902 place count 5892 transition count 8796
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 808 rules applied. Total rules applied 51710 place count 5690 transition count 8190
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 9 with 202 rules applied. Total rules applied 51912 place count 5589 transition count 8089
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 52013 place count 5488 transition count 8089
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 3 ms
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 11 with 505 rules applied. Total rules applied 52518 place count 5185 transition count 7887
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 52720 place count 5084 transition count 7786
Applied a total of 52720 rules in 8168 ms. Remains 5084 /33574 variables (removed 28490) and now considering 7786/36366 (removed 28580) transitions.
// Phase 1: matrix 7786 rows 5084 cols
[2024-05-25 18:37:00] [INFO ] Computed 308 invariants in 117 ms
[2024-05-25 18:37:01] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-25 18:37:01] [INFO ] Invariant cache hit.
[2024-05-25 18:37:02] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2024-05-25 18:37:02] [INFO ] Invariant cache hit.
[2024-05-25 18:37:03] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5084/33574 places, 7786/36366 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10853 ms. Remains : 5084/33574 places, 7786/36366 transitions.
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s4365 s4366 s4367 s4368 s4369 s4370 s4371 s4372 s4373 s4374 s4375) (ADD s3254 s3255 s3256 s3257 s3258 s3259 s3260 s3261 s3262 s3263 s3264 s32...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 705 reset in 6422 ms.
Product exploration explored 100000 steps with 715 reset in 6795 ms.
Computed a total of 5084 stabilizing places and 7786 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5084 transition count 7786
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 p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 580 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 2859 steps, including 2 resets, run visited all 5 properties in 233 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1632 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1333 out of 5084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5084/5084 places, 7786/7786 transitions.
Applied a total of 0 rules in 680 ms. Remains 5084 /5084 variables (removed 0) and now considering 7786/7786 (removed 0) transitions.
[2024-05-25 18:39:01] [INFO ] Invariant cache hit.
[2024-05-25 18:39:02] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-05-25 18:39:02] [INFO ] Invariant cache hit.
[2024-05-25 18:39:02] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2024-05-25 18:39:02] [INFO ] Invariant cache hit.
[2024-05-25 18:39:03] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3070 ms. Remains : 5084/5084 places, 7786/7786 transitions.
Computed a total of 5084 stabilizing places and 7786 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5084 transition count 7786
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 p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 660 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 1615 steps, including 1 resets, run visited all 5 properties in 154 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1636 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 288 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 712 reset in 6585 ms.
Product exploration explored 100000 steps with 714 reset in 6447 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 212 ms :[(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))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1333 out of 5084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5084/5084 places, 7786/7786 transitions.
Applied a total of 0 rules in 788 ms. Remains 5084 /5084 variables (removed 0) and now considering 7786/7786 (removed 0) transitions.
[2024-05-25 18:40:44] [INFO ] Redundant transitions in 1342 ms returned []
[2024-05-25 18:40:44] [INFO ] Invariant cache hit.
[2024-05-25 18:40:44] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3011 ms. Remains : 5084/5084 places, 7786/7786 transitions.
Built C files in :
/tmp/ltsmin7240874686805260326
[2024-05-25 18:40:45] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7240874686805260326
Running compilation step : cd /tmp/ltsmin7240874686805260326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7240874686805260326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7240874686805260326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1333 out of 5084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5084/5084 places, 7786/7786 transitions.
Applied a total of 0 rules in 442 ms. Remains 5084 /5084 variables (removed 0) and now considering 7786/7786 (removed 0) transitions.
[2024-05-25 18:40:48] [INFO ] Invariant cache hit.
[2024-05-25 18:40:49] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-05-25 18:40:49] [INFO ] Invariant cache hit.
[2024-05-25 18:40:50] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2024-05-25 18:40:50] [INFO ] Invariant cache hit.
[2024-05-25 18:40:51] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2983 ms. Remains : 5084/5084 places, 7786/7786 transitions.
Built C files in :
/tmp/ltsmin16418166120373229338
[2024-05-25 18:40:51] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16418166120373229338
Running compilation step : cd /tmp/ltsmin16418166120373229338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16418166120373229338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16418166120373229338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 18:40:54] [INFO ] Flatten gal took : 285 ms
[2024-05-25 18:40:55] [INFO ] Flatten gal took : 211 ms
[2024-05-25 18:40:55] [INFO ] Time to serialize gal into /tmp/LTL14395639634755552970.gal : 30 ms
[2024-05-25 18:40:55] [INFO ] Time to serialize properties into /tmp/LTL3423853125120952201.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14395639634755552970.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14770914463547213028.hoa' '-atoms' '/tmp/LTL3423853125120952201.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3423853125120952201.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14770914463547213028.hoa
Detected timeout of ITS tools.
[2024-05-25 18:41:11] [INFO ] Flatten gal took : 310 ms
[2024-05-25 18:41:11] [INFO ] Flatten gal took : 202 ms
[2024-05-25 18:41:11] [INFO ] Time to serialize gal into /tmp/LTL739141711070362361.gal : 31 ms
[2024-05-25 18:41:11] [INFO ] Time to serialize properties into /tmp/LTL1579532131930721745.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL739141711070362361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1579532131930721745.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0_0+ml3_1_0)+(ml3_2_0+ml3_3_0)...14223
Formula 0 simplified : XF(G!"(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0_0+ml3_1_0)+(ml3_2_0+ml3_3_0))+(...14207
Detected timeout of ITS tools.
[2024-05-25 18:41:26] [INFO ] Flatten gal took : 203 ms
[2024-05-25 18:41:26] [INFO ] Applying decomposition
[2024-05-25 18:41:26] [INFO ] Flatten gal took : 212 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12861638086644269920.txt' '-o' '/tmp/graph12861638086644269920.bin' '-w' '/tmp/graph12861638086644269920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12861638086644269920.bin' '-l' '-1' '-v' '-w' '/tmp/graph12861638086644269920.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:41:28] [INFO ] Decomposing Gal with order
[2024-05-25 18:41:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:41:32] [INFO ] Removed a total of 7098 redundant transitions.
[2024-05-25 18:41:33] [INFO ] Flatten gal took : 3027 ms
[2024-05-25 18:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1232 labels/synchronizations in 172 ms.
[2024-05-25 18:41:33] [INFO ] Time to serialize gal into /tmp/LTL14042957042204114432.gal : 43 ms
[2024-05-25 18:41:33] [INFO ] Time to serialize properties into /tmp/LTL13253206001248639868.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14042957042204114432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13253206001248639868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((gu299.m8_0+gu299.m8_1)+(gu299.m8_2+gu299.m8_3))+((gu299.m8_4+gu299.m8_5)+(gu299.m8_6+gu299.m8_7)))+((gu299.m8_8+gu299....22275
Formula 0 simplified : XF(G!"(((((gu299.m8_0+gu299.m8_1)+(gu299.m8_2+gu299.m8_3))+((gu299.m8_4+gu299.m8_5)+(gu299.m8_6+gu299.m8_7)))+((gu299.m8_8+gu299.m8_...22259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2520223912471970400
[2024-05-25 18:41:48] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2520223912471970400
Running compilation step : cd /tmp/ltsmin2520223912471970400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2520223912471970400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2520223912471970400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 finished in 300225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(X(X(p2))||(!p0 U G(p3))))))'
[2024-05-25 18:41:53] [INFO ] Flatten gal took : 1129 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7522129494893377083
[2024-05-25 18:41:53] [INFO ] Too many transitions (36366) to apply POR reductions. Disabling POR matrices.
[2024-05-25 18:41:54] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7522129494893377083
Running compilation step : cd /tmp/ltsmin7522129494893377083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 18:41:54] [INFO ] Applying decomposition
[2024-05-25 18:41:55] [INFO ] Flatten gal took : 984 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15151608647384352107.txt' '-o' '/tmp/graph15151608647384352107.bin' '-w' '/tmp/graph15151608647384352107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15151608647384352107.bin' '-l' '-1' '-v' '-w' '/tmp/graph15151608647384352107.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:42:01] [INFO ] Decomposing Gal with order
[2024-05-25 18:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin7522129494893377083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7522129494893377083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8150208 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15803272 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280400317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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