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.r417-tall-171690556700547.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 Szymanski-PT-b06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556700547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 Szymanski-PT-b06-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717170222015

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=Szymanski-PT-b06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 15:43:43] [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-31 15:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 15:43:43] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2024-05-31 15:43:43] [INFO ] Transformed 568 places.
[2024-05-31 15:43:43] [INFO ] Transformed 8320 transitions.
[2024-05-31 15:43:43] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 551 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 193 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:43:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:43:44] [INFO ] Computed 1 invariants in 60 ms
[2024-05-31 15:43:45] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-31 15:43:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:43:45] [INFO ] Invariant cache hit.
[2024-05-31 15:43:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:43:52] [INFO ] Implicit Places using invariants and state equation in 6993 ms returned []
Implicit Place search using SMT with State Equation took 7714 ms to find 0 implicit places.
[2024-05-31 15:43:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:43:52] [INFO ] Invariant cache hit.
[2024-05-31 15:43:54] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10029 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 12 out of 305 places after structural reductions.
[2024-05-31 15:43:54] [INFO ] Flatten gal took : 454 ms
[2024-05-31 15:43:55] [INFO ] Flatten gal took : 258 ms
[2024-05-31 15:43:55] [INFO ] Input system was already deterministic with 7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 15:43:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:43:56] [INFO ] Invariant cache hit.
[2024-05-31 15:43:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:43:56] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 15:43:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:43:58] [INFO ] After 1759ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 15:43:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:07] [INFO ] After 9125ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-31 15:44:08] [INFO ] After 10503ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 1263 ms.
[2024-05-31 15:44:09] [INFO ] After 13640ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 383 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-31 15:44:10] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2024-05-31 15:44:10] [INFO ] Computed 1 invariants in 34 ms
[2024-05-31 15:44:10] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:44:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:44:11] [INFO ] After 1017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:44:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:17] [INFO ] After 6148ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:44:18] [INFO ] After 6378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 414 ms.
[2024-05-31 15:44:18] [INFO ] After 7910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7809
Applied a total of 2 rules in 245 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7811 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 305/305 places, 7809/7811 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 163513 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163513 steps, saw 83723 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:44:21] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:44:21] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 15:44:21] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:44:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:44:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:44:22] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:44:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:33] [INFO ] After 10585ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:44:33] [INFO ] Deduced a trap composed of 146 places in 235 ms of which 2 ms to minimize.
[2024-05-31 15:44:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2024-05-31 15:44:33] [INFO ] After 10991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-31 15:44:33] [INFO ] After 11850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 215 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:44:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:44:34] [INFO ] Invariant cache hit.
[2024-05-31 15:44:34] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-31 15:44:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:44:34] [INFO ] Invariant cache hit.
[2024-05-31 15:44:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:41] [INFO ] Implicit Places using invariants and state equation in 6402 ms returned []
Implicit Place search using SMT with State Equation took 6891 ms to find 0 implicit places.
[2024-05-31 15:44:42] [INFO ] Redundant transitions in 898 ms returned []
[2024-05-31 15:44:42] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:44:42] [INFO ] Invariant cache hit.
[2024-05-31 15:44:43] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9839 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 3 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 180 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-31 15:44:44] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 15:44:44] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:44:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:44:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 15:44:45] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:44:45] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:44:45] [INFO ] After 947ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:44:46] [INFO ] After 1338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 969 ms.
[2024-05-31 15:44:47] [INFO ] After 3205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Szymanski-PT-b06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA Szymanski-PT-b06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
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 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:44:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:44:47] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 15:44:48] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-31 15:44:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:44:48] [INFO ] Invariant cache hit.
[2024-05-31 15:44:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:54] [INFO ] Implicit Places using invariants and state equation in 6910 ms returned []
Implicit Place search using SMT with State Equation took 7368 ms to find 0 implicit places.
[2024-05-31 15:44:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:44:54] [INFO ] Invariant cache hit.
[2024-05-31 15:44:56] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9264 ms. Remains : 305/305 places, 7936/7936 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 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s294 0)], 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 50000 reset in 816 ms.
Product exploration explored 100000 steps with 50000 reset in 697 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b06-LTLCardinality-01 finished in 11056 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) U (p1&&X(p2))) U p3))'
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:44:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:44:58] [INFO ] Invariant cache hit.
[2024-05-31 15:44:59] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-31 15:44:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:44:59] [INFO ] Invariant cache hit.
[2024-05-31 15:44:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:05] [INFO ] Implicit Places using invariants and state equation in 6859 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
[2024-05-31 15:45:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:05] [INFO ] Invariant cache hit.
[2024-05-31 15:45:07] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9142 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p3), true, (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(LEQ 3 s302), p1:(LEQ s153 s55), p0:(GT 1 s256), p2:(LEQ 2 s269)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b06-LTLCardinality-08 finished in 9396 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(X(X(X(G(p0))))))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:45:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:08] [INFO ] Invariant cache hit.
[2024-05-31 15:45:08] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-31 15:45:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:08] [INFO ] Invariant cache hit.
[2024-05-31 15:45:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:15] [INFO ] Implicit Places using invariants and state equation in 7508 ms returned []
Implicit Place search using SMT with State Equation took 7927 ms to find 0 implicit places.
[2024-05-31 15:45:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:15] [INFO ] Invariant cache hit.
[2024-05-31 15:45:17] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9868 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT s75 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b06-LTLCardinality-09 finished in 10140 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((p0&&X(X(G(p1))))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:45:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:18] [INFO ] Invariant cache hit.
[2024-05-31 15:45:18] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 15:45:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:18] [INFO ] Invariant cache hit.
[2024-05-31 15:45:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:26] [INFO ] Implicit Places using invariants and state equation in 7483 ms returned []
Implicit Place search using SMT with State Equation took 7890 ms to find 0 implicit places.
[2024-05-31 15:45:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:26] [INFO ] Invariant cache hit.
[2024-05-31 15:45:27] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9745 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s138 0), p1:(LEQ s56 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 403 ms.
Product exploration explored 100000 steps with 2 reset in 475 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 15:45:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:29] [INFO ] Invariant cache hit.
[2024-05-31 15:45:29] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:45:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:45:32] [INFO ] After 3029ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 15:45:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:33] [INFO ] After 1115ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-31 15:45:33] [INFO ] After 1339ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-05-31 15:45:34] [INFO ] After 4549ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 160969 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160969 steps, saw 80760 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:45:37] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:45:37] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 15:45:37] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:45:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:45:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:45:38] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:45:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:40] [INFO ] After 1553ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:45:40] [INFO ] Deduced a trap composed of 45 places in 479 ms of which 1 ms to minimize.
[2024-05-31 15:45:41] [INFO ] Deduced a trap composed of 74 places in 393 ms of which 1 ms to minimize.
[2024-05-31 15:45:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1096 ms
[2024-05-31 15:45:41] [INFO ] After 3050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1036 ms.
[2024-05-31 15:45:42] [INFO ] After 5148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:45:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:45:43] [INFO ] Invariant cache hit.
[2024-05-31 15:45:43] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-31 15:45:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:45:43] [INFO ] Invariant cache hit.
[2024-05-31 15:45:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:49] [INFO ] Implicit Places using invariants and state equation in 5900 ms returned []
Implicit Place search using SMT with State Equation took 6334 ms to find 0 implicit places.
[2024-05-31 15:45:50] [INFO ] Redundant transitions in 852 ms returned []
[2024-05-31 15:45:50] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:45:50] [INFO ] Invariant cache hit.
[2024-05-31 15:45:52] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9209 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 122 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-31 15:45:52] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 15:45:52] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:45:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:45:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:45:52] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:45:52] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:45:53] [INFO ] After 985ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:45:54] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 773 ms.
[2024-05-31 15:45:55] [INFO ] After 2806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 289 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:45:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:45:55] [INFO ] Computed 1 invariants in 20 ms
[2024-05-31 15:45:56] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-31 15:45:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:45:56] [INFO ] Invariant cache hit.
[2024-05-31 15:45:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:03] [INFO ] Implicit Places using invariants and state equation in 7582 ms returned []
Implicit Place search using SMT with State Equation took 8033 ms to find 0 implicit places.
[2024-05-31 15:46:04] [INFO ] Redundant transitions in 652 ms returned []
[2024-05-31 15:46:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:04] [INFO ] Invariant cache hit.
[2024-05-31 15:46:06] [INFO ] Dead Transitions using invariants and state equation in 1899 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10883 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 116 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 15:46:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:06] [INFO ] Invariant cache hit.
[2024-05-31 15:46:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:46:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:46:08] [INFO ] After 1452ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 15:46:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:10] [INFO ] After 1818ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-31 15:46:10] [INFO ] After 2052ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 270 ms.
[2024-05-31 15:46:10] [INFO ] After 3844ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 176151 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176151 steps, saw 82860 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:46:14] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:46:14] [INFO ] Computed 2 invariants in 24 ms
[2024-05-31 15:46:14] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:46:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:46:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:46:15] [INFO ] After 1001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:46:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:16] [INFO ] After 1575ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:46:17] [INFO ] Deduced a trap composed of 45 places in 482 ms of which 1 ms to minimize.
[2024-05-31 15:46:17] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 0 ms to minimize.
[2024-05-31 15:46:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1092 ms
[2024-05-31 15:46:18] [INFO ] After 3072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1037 ms.
[2024-05-31 15:46:19] [INFO ] After 5177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:46:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:46:19] [INFO ] Invariant cache hit.
[2024-05-31 15:46:20] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-31 15:46:20] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:46:20] [INFO ] Invariant cache hit.
[2024-05-31 15:46:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:26] [INFO ] Implicit Places using invariants and state equation in 6214 ms returned []
Implicit Place search using SMT with State Equation took 6662 ms to find 0 implicit places.
[2024-05-31 15:46:27] [INFO ] Redundant transitions in 640 ms returned []
[2024-05-31 15:46:27] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:46:27] [INFO ] Invariant cache hit.
[2024-05-31 15:46:28] [INFO ] Dead Transitions using invariants and state equation in 1789 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9291 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 120 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-31 15:46:28] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 15:46:29] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:46:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:46:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:46:29] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:46:29] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:46:30] [INFO ] After 969ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:46:30] [INFO ] After 1403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 766 ms.
[2024-05-31 15:46:31] [INFO ] After 2747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 208 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 6 reset in 383 ms.
Product exploration explored 100000 steps with 2 reset in 383 ms.
Built C files in :
/tmp/ltsmin15869286974580088435
[2024-05-31 15:46:33] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:46:33] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15869286974580088435
Running compilation step : cd /tmp/ltsmin15869286974580088435;'/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/ltsmin15869286974580088435;'/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/ltsmin15869286974580088435;'/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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:46:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:46:36] [INFO ] Computed 1 invariants in 14 ms
[2024-05-31 15:46:37] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 15:46:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:37] [INFO ] Invariant cache hit.
[2024-05-31 15:46:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:44] [INFO ] Implicit Places using invariants and state equation in 7245 ms returned []
Implicit Place search using SMT with State Equation took 7674 ms to find 0 implicit places.
[2024-05-31 15:46:45] [INFO ] Redundant transitions in 696 ms returned []
[2024-05-31 15:46:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:45] [INFO ] Invariant cache hit.
[2024-05-31 15:46:46] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10381 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin16020848386412950372
[2024-05-31 15:46:46] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:46:46] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16020848386412950372
Running compilation step : cd /tmp/ltsmin16020848386412950372;'/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/ltsmin16020848386412950372;'/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/ltsmin16020848386412950372;'/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-31 15:46:50] [INFO ] Flatten gal took : 208 ms
[2024-05-31 15:46:50] [INFO ] Flatten gal took : 207 ms
[2024-05-31 15:46:50] [INFO ] Time to serialize gal into /tmp/LTL11736024150331008418.gal : 78 ms
[2024-05-31 15:46:50] [INFO ] Time to serialize properties into /tmp/LTL4804721499475469154.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/LTL11736024150331008418.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9515621733017650653.hoa' '-atoms' '/tmp/LTL4804721499475469154.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
Loading property file /tmp/LTL4804721499475469154.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9515621733017650653.hoa
Detected timeout of ITS tools.
[2024-05-31 15:47:06] [INFO ] Flatten gal took : 186 ms
[2024-05-31 15:47:06] [INFO ] Flatten gal took : 187 ms
[2024-05-31 15:47:06] [INFO ] Time to serialize gal into /tmp/LTL17250898381564572198.gal : 25 ms
[2024-05-31 15:47:06] [INFO ] Time to serialize properties into /tmp/LTL16010403155634557582.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/LTL17250898381564572198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16010403155634557582.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 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2024-05-31 15:47:21] [INFO ] Flatten gal took : 181 ms
[2024-05-31 15:47:21] [INFO ] Applying decomposition
[2024-05-31 15:47:21] [INFO ] Flatten gal took : 183 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/graph12106442204669516119.txt' '-o' '/tmp/graph12106442204669516119.bin' '-w' '/tmp/graph12106442204669516119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12106442204669516119.bin' '-l' '-1' '-v' '-w' '/tmp/graph12106442204669516119.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:47:22] [INFO ] Decomposing Gal with order
[2024-05-31 15:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:47:22] [INFO ] Removed a total of 17839 redundant transitions.
[2024-05-31 15:47:23] [INFO ] Flatten gal took : 764 ms
[2024-05-31 15:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1025 labels/synchronizations in 265 ms.
[2024-05-31 15:47:23] [INFO ] Time to serialize gal into /tmp/LTL14497269303735941257.gal : 30 ms
[2024-05-31 15:47:23] [INFO ] Time to serialize properties into /tmp/LTL3050992497313720604.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/LTL14497269303735941257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3050992497313720604.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((F(("(i4.u48.p138<=0)")&&(X(X(G("(i8.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i4.u48.p138<=0)" | XXF!"(i8.u18.p56<=0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12690575009380334543
[2024-05-31 15:47:38] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12690575009380334543
Running compilation step : cd /tmp/ltsmin12690575009380334543;'/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/ltsmin12690575009380334543;'/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/ltsmin12690575009380334543;'/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 Szymanski-PT-b06-LTLCardinality-14 finished in 143582 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((p0&&X(X(G(p1))))))'
Found a Lengthening insensitive property : Szymanski-PT-b06-LTLCardinality-14
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 53 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:47:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:42] [INFO ] Invariant cache hit.
[2024-05-31 15:47:42] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-31 15:47:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:42] [INFO ] Invariant cache hit.
[2024-05-31 15:47:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:50] [INFO ] Implicit Places using invariants and state equation in 7625 ms returned []
Implicit Place search using SMT with State Equation took 8104 ms to find 0 implicit places.
[2024-05-31 15:47:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:50] [INFO ] Invariant cache hit.
[2024-05-31 15:47:51] [INFO ] Dead Transitions using invariants and state equation in 1798 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9956 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s138 0), p1:(LEQ s56 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 446 ms.
Product exploration explored 100000 steps with 3 reset in 413 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10005 steps, including 4 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 15:47:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:53] [INFO ] Invariant cache hit.
[2024-05-31 15:47:53] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:47:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:47:56] [INFO ] After 3073ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 15:47:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:57] [INFO ] After 1098ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-31 15:47:57] [INFO ] After 1302ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-31 15:47:57] [INFO ] After 4584ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162482 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162482 steps, saw 81038 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:48:01] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:48:01] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 15:48:01] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:48:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:48:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:48:02] [INFO ] After 1003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:03] [INFO ] After 1567ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:04] [INFO ] Deduced a trap composed of 45 places in 465 ms of which 0 ms to minimize.
[2024-05-31 15:48:04] [INFO ] Deduced a trap composed of 74 places in 385 ms of which 0 ms to minimize.
[2024-05-31 15:48:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1075 ms
[2024-05-31 15:48:05] [INFO ] After 3053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1056 ms.
[2024-05-31 15:48:06] [INFO ] After 5179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:48:06] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:48:06] [INFO ] Invariant cache hit.
[2024-05-31 15:48:07] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-31 15:48:07] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:48:07] [INFO ] Invariant cache hit.
[2024-05-31 15:48:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:13] [INFO ] Implicit Places using invariants and state equation in 6087 ms returned []
Implicit Place search using SMT with State Equation took 6524 ms to find 0 implicit places.
[2024-05-31 15:48:13] [INFO ] Redundant transitions in 663 ms returned []
[2024-05-31 15:48:13] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:48:13] [INFO ] Invariant cache hit.
[2024-05-31 15:48:15] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9175 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 130 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-31 15:48:15] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 15:48:16] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:48:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:48:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:48:16] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:16] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:48:17] [INFO ] After 956ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:17] [INFO ] After 1391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 772 ms.
[2024-05-31 15:48:18] [INFO ] After 2754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 182 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 168 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:48:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:48:19] [INFO ] Computed 1 invariants in 23 ms
[2024-05-31 15:48:19] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-31 15:48:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:48:19] [INFO ] Invariant cache hit.
[2024-05-31 15:48:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:28] [INFO ] Implicit Places using invariants and state equation in 8170 ms returned []
Implicit Place search using SMT with State Equation took 8599 ms to find 0 implicit places.
[2024-05-31 15:48:28] [INFO ] Redundant transitions in 694 ms returned []
[2024-05-31 15:48:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:48:28] [INFO ] Invariant cache hit.
[2024-05-31 15:48:30] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11296 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 119 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 15:48:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:48:31] [INFO ] Invariant cache hit.
[2024-05-31 15:48:31] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:48:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:48:32] [INFO ] After 1435ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 15:48:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:34] [INFO ] After 1813ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-31 15:48:34] [INFO ] After 2047ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 261 ms.
[2024-05-31 15:48:34] [INFO ] After 3833ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 170998 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170998 steps, saw 82193 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:48:38] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:48:38] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 15:48:38] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:48:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:48:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:48:39] [INFO ] After 1007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:40] [INFO ] After 1538ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:41] [INFO ] Deduced a trap composed of 45 places in 473 ms of which 3 ms to minimize.
[2024-05-31 15:48:41] [INFO ] Deduced a trap composed of 74 places in 387 ms of which 0 ms to minimize.
[2024-05-31 15:48:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1079 ms
[2024-05-31 15:48:42] [INFO ] After 3019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1031 ms.
[2024-05-31 15:48:43] [INFO ] After 5130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 172 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:48:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:48:43] [INFO ] Invariant cache hit.
[2024-05-31 15:48:44] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-31 15:48:44] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:48:44] [INFO ] Invariant cache hit.
[2024-05-31 15:48:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:52] [INFO ] Implicit Places using invariants and state equation in 7916 ms returned []
Implicit Place search using SMT with State Equation took 8359 ms to find 0 implicit places.
[2024-05-31 15:48:52] [INFO ] Redundant transitions in 676 ms returned []
[2024-05-31 15:48:52] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:48:52] [INFO ] Invariant cache hit.
[2024-05-31 15:48:54] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11031 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 118 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-31 15:48:54] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 15:48:54] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:48:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:48:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:48:55] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:55] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:48:56] [INFO ] After 979ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:48:56] [INFO ] After 1423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 768 ms.
[2024-05-31 15:48:57] [INFO ] After 2780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 238 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1 reset in 385 ms.
Product exploration explored 100000 steps with 3 reset in 449 ms.
Built C files in :
/tmp/ltsmin17891130249575518992
[2024-05-31 15:48:59] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:48:59] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17891130249575518992
Running compilation step : cd /tmp/ltsmin17891130249575518992;'/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/ltsmin17891130249575518992;'/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/ltsmin17891130249575518992;'/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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 171 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:49:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:49:02] [INFO ] Computed 1 invariants in 20 ms
[2024-05-31 15:49:02] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-31 15:49:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:49:02] [INFO ] Invariant cache hit.
[2024-05-31 15:49:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:49:09] [INFO ] Implicit Places using invariants and state equation in 6882 ms returned []
Implicit Place search using SMT with State Equation took 7316 ms to find 0 implicit places.
[2024-05-31 15:49:10] [INFO ] Redundant transitions in 650 ms returned []
[2024-05-31 15:49:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:49:10] [INFO ] Invariant cache hit.
[2024-05-31 15:49:12] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9974 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin10376002206459822816
[2024-05-31 15:49:12] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:49:12] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10376002206459822816
Running compilation step : cd /tmp/ltsmin10376002206459822816;'/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/ltsmin10376002206459822816;'/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/ltsmin10376002206459822816;'/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-31 15:49:15] [INFO ] Flatten gal took : 175 ms
[2024-05-31 15:49:15] [INFO ] Flatten gal took : 188 ms
[2024-05-31 15:49:15] [INFO ] Time to serialize gal into /tmp/LTL17554153964698832724.gal : 38 ms
[2024-05-31 15:49:15] [INFO ] Time to serialize properties into /tmp/LTL11208363780316435061.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/LTL17554153964698832724.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4369968976811900804.hoa' '-atoms' '/tmp/LTL11208363780316435061.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/LTL11208363780316435061.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4369968976811900804.hoa
Detected timeout of ITS tools.
[2024-05-31 15:49:31] [INFO ] Flatten gal took : 185 ms
[2024-05-31 15:49:31] [INFO ] Flatten gal took : 188 ms
[2024-05-31 15:49:31] [INFO ] Time to serialize gal into /tmp/LTL4658252095658055048.gal : 24 ms
[2024-05-31 15:49:31] [INFO ] Time to serialize properties into /tmp/LTL5886586744439785261.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/LTL4658252095658055048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5886586744439785261.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...275
Read 1 LTL properties
Checking formula 0 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2024-05-31 15:49:46] [INFO ] Flatten gal took : 173 ms
[2024-05-31 15:49:46] [INFO ] Applying decomposition
[2024-05-31 15:49:46] [INFO ] Flatten gal took : 174 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/graph15358824252996487733.txt' '-o' '/tmp/graph15358824252996487733.bin' '-w' '/tmp/graph15358824252996487733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15358824252996487733.bin' '-l' '-1' '-v' '-w' '/tmp/graph15358824252996487733.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:49:47] [INFO ] Decomposing Gal with order
[2024-05-31 15:49:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:49:47] [INFO ] Removed a total of 18365 redundant transitions.
[2024-05-31 15:49:47] [INFO ] Flatten gal took : 333 ms
[2024-05-31 15:49:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 968 labels/synchronizations in 181 ms.
[2024-05-31 15:49:48] [INFO ] Time to serialize gal into /tmp/LTL7271557729997795351.gal : 23 ms
[2024-05-31 15:49:48] [INFO ] Time to serialize properties into /tmp/LTL8456695614163717824.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/LTL7271557729997795351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8456695614163717824.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F(("(i5.u56.p138<=0)")&&(X(X(G("(i3.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i5.u56.p138<=0)" | XXF!"(i3.u18.p56<=0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5254367986871269940
[2024-05-31 15:50:03] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5254367986871269940
Running compilation step : cd /tmp/ltsmin5254367986871269940;'/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/ltsmin5254367986871269940;'/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/ltsmin5254367986871269940;'/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 Szymanski-PT-b06-LTLCardinality-14 finished in 144475 ms.
[2024-05-31 15:50:06] [INFO ] Flatten gal took : 177 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin119565066697658223
[2024-05-31 15:50:06] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:50:06] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin119565066697658223
Running compilation step : cd /tmp/ltsmin119565066697658223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-31 15:50:06] [INFO ] Applying decomposition
[2024-05-31 15:50:06] [INFO ] Flatten gal took : 179 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/graph13768838854527250920.txt' '-o' '/tmp/graph13768838854527250920.bin' '-w' '/tmp/graph13768838854527250920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13768838854527250920.bin' '-l' '-1' '-v' '-w' '/tmp/graph13768838854527250920.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:50:07] [INFO ] Decomposing Gal with order
[2024-05-31 15:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:50:07] [INFO ] Removed a total of 18062 redundant transitions.
[2024-05-31 15:50:07] [INFO ] Flatten gal took : 456 ms
[2024-05-31 15:50:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 897 labels/synchronizations in 191 ms.
[2024-05-31 15:50:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality1342440810152177264.gal : 19 ms
[2024-05-31 15:50:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality4270477683133744513.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/LTLCardinality1342440810152177264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4270477683133744513.ltl' '-c' '-stutter-deadlock'

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 : !((F(("(i2.u48.p138<=0)")&&(X(X(G("(i8.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i2.u48.p138<=0)" | XXF!"(i8.u18.p56<=0)")
Compilation finished in 30268 ms.
Running link step : cd /tmp/ltsmin119565066697658223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin119565066697658223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 16:12:16] [INFO ] Flatten gal took : 417 ms
[2024-05-31 16:12:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality7772721791809613411.gal : 59 ms
[2024-05-31 16:12:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality10308159140932660155.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/LTLCardinality7772721791809613411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10308159140932660155.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...298
Read 1 LTL properties
Checking formula 0 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2024-05-31 16:34:25] [INFO ] Flatten gal took : 497 ms
[2024-05-31 16:34:25] [INFO ] Input system was already deterministic with 7936 transitions.
[2024-05-31 16:34:25] [INFO ] Transformed 305 places.
[2024-05-31 16:34:26] [INFO ] Transformed 7936 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 16:34:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality12951375635576417134.gal : 55 ms
[2024-05-31 16:34:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality3258330118057798477.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/LTLCardinality12951375635576417134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3258330118057798477.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: LTL layer: formula: <>(((LTLAPp0==true)&&X(X([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.025: "<>(((LTLAPp0==true)&&X(X([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.395: There are 7939 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.395: State length is 306, there are 7956 groups
pins2lts-mc-linux64( 0/ 8), 1.395: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.395: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.395: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.395: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.951: [Blue] ~120 levels ~960 states ~4504 transitions
pins2lts-mc-linux64( 2/ 8), 2.406: [Blue] ~240 levels ~1920 states ~9440 transitions
pins2lts-mc-linux64( 0/ 8), 2.881: [Blue] ~299 levels ~3840 states ~18208 transitions
pins2lts-mc-linux64( 0/ 8), 3.909: [Blue] ~306 levels ~7680 states ~37336 transitions
pins2lts-mc-linux64( 0/ 8), 6.306: [Blue] ~306 levels ~15360 states ~78552 transitions
pins2lts-mc-linux64( 0/ 8), 11.596: [Blue] ~326 levels ~30720 states ~166576 transitions
pins2lts-mc-linux64( 0/ 8), 16.113: [Blue] ~326 levels ~61440 states ~353400 transitions
pins2lts-mc-linux64( 0/ 8), 24.878: [Blue] ~427 levels ~122880 states ~729712 transitions
pins2lts-mc-linux64( 0/ 8), 42.285: [Blue] ~427 levels ~245760 states ~1577584 transitions
pins2lts-mc-linux64( 2/ 8), 76.101: [Blue] ~19740 levels ~491520 states ~3364496 transitions
pins2lts-mc-linux64( 3/ 8), 173.256: [Blue] ~9335 levels ~983040 states ~6767224 transitions
pins2lts-mc-linux64( 3/ 8), 308.528: [Blue] ~9503 levels ~1966080 states ~14617992 transitions
pins2lts-mc-linux64( 2/ 8), 636.558: [Blue] ~28983 levels ~3932160 states ~31352904 transitions
pins2lts-mc-linux64( 2/ 8), 1211.508: [Blue] ~28983 levels ~7864320 states ~65109280 transitions
pins2lts-mc-linux64( 3/ 8), 2317.280: [Blue] ~12803 levels ~15728640 states ~129925424 transitions
pins2lts-mc-linux64( 3/ 8), 3038.450: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3038.538:
pins2lts-mc-linux64( 0/ 8), 3038.538: Explored 20451695 states 179498788 transitions, fanout: 8.777
pins2lts-mc-linux64( 0/ 8), 3038.538: Total exploration time 3037.120 sec (3037.010 sec minimum, 3037.058 sec on average)
pins2lts-mc-linux64( 0/ 8), 3038.538: States per second: 6734, Transitions per second: 59102
pins2lts-mc-linux64( 0/ 8), 3038.538:
pins2lts-mc-linux64( 0/ 8), 3038.538: State space has 20454559 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 3038.538: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3038.538: blue states: 20451695 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3038.538: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3038.538: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3038.538:
pins2lts-mc-linux64( 0/ 8), 3038.538: Total memory used for local state coloring: 1.5MB
pins2lts-mc-linux64( 0/ 8), 3038.538:
pins2lts-mc-linux64( 0/ 8), 3038.538: Queue width: 8B, total height: 95543, memory: 0.73MB
pins2lts-mc-linux64( 0/ 8), 3038.538: Tree memory: 412.1MB, 21.1 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 3038.538: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 3038.538: Stored 8213 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3038.538: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3038.538: Est. total memory use: 412.8MB (~1024.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin119565066697658223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin119565066697658223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8460836 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16031448 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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r417-tall-171690556700547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 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 ;