Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 8.5K Apr 29 12:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 12:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 29 12:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 5.4M May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652650321503

Running Version 202205111006
[2022-05-15 21:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:32:03] [INFO ] Load time of PNML (sax parser for PT used): 466 ms
[2022-05-15 21:32:03] [INFO ] Transformed 7922 places.
[2022-05-15 21:32:03] [INFO ] Transformed 14880 transitions.
[2022-05-15 21:32:03] [INFO ] Parsed PT model containing 7922 places and 14880 transitions in 615 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-060-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 7922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Discarding 3452 places :
Symmetric choice reduction at 0 with 3452 rule applications. Total rules 3452 place count 4470 transition count 7976
Iterating global reduction 0 with 3452 rules applied. Total rules applied 6904 place count 4470 transition count 7976
Applied a total of 6904 rules in 1512 ms. Remains 4470 /7922 variables (removed 3452) and now considering 7976/14880 (removed 6904) transitions.
// Phase 1: matrix 7976 rows 4470 cols
[2022-05-15 21:32:05] [INFO ] Computed 121 place invariants in 114 ms
[2022-05-15 21:32:07] [INFO ] Implicit Places using invariants in 2914 ms returned []
// Phase 1: matrix 7976 rows 4470 cols
[2022-05-15 21:32:07] [INFO ] Computed 121 place invariants in 62 ms
[2022-05-15 21:32:10] [INFO ] Implicit Places using invariants and state equation in 2610 ms returned []
Implicit Place search using SMT with State Equation took 5554 ms to find 0 implicit places.
// Phase 1: matrix 7976 rows 4470 cols
[2022-05-15 21:32:10] [INFO ] Computed 121 place invariants in 44 ms
[2022-05-15 21:32:14] [INFO ] Dead Transitions using invariants and state equation in 4204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4470/7922 places, 7976/14880 transitions.
Finished structural reductions, in 1 iterations. Remains : 4470/7922 places, 7976/14880 transitions.
Support contains 45 out of 4470 places after structural reductions.
[2022-05-15 21:32:15] [INFO ] Flatten gal took : 390 ms
[2022-05-15 21:32:15] [INFO ] Flatten gal took : 275 ms
[2022-05-15 21:32:16] [INFO ] Input system was already deterministic with 7976 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 28) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 7976 rows 4470 cols
[2022-05-15 21:32:16] [INFO ] Computed 121 place invariants in 49 ms
[2022-05-15 21:32:18] [INFO ] [Real]Absence check using 61 positive place invariants in 91 ms returned sat
[2022-05-15 21:32:18] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 41 ms returned sat
[2022-05-15 21:32:18] [INFO ] After 1957ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:21
[2022-05-15 21:32:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 85 ms returned sat
[2022-05-15 21:32:20] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 43 ms returned sat
[2022-05-15 21:32:27] [INFO ] After 5671ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :15
[2022-05-15 21:32:27] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:32:32] [INFO ] After 5424ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :7 sat :15
[2022-05-15 21:32:38] [INFO ] After 11552ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :15
Attempting to minimize the solution found.
Minimization took 3956 ms.
[2022-05-15 21:32:42] [INFO ] After 23858ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :15
Fused 22 Parikh solutions to 10 different solutions.
Parikh walk visited 3 properties in 236 ms.
Support contains 23 out of 4470 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 4470 transition count 7556
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 4050 transition count 7556
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 850 place count 4040 transition count 7536
Iterating global reduction 2 with 10 rules applied. Total rules applied 860 place count 4040 transition count 7536
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 980 place count 3980 transition count 7476
Free-agglomeration rule applied 88 times.
Iterating global reduction 2 with 88 rules applied. Total rules applied 1068 place count 3980 transition count 7388
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1156 place count 3892 transition count 7388
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 1188 place count 3892 transition count 7388
Applied a total of 1188 rules in 2851 ms. Remains 3892 /4470 variables (removed 578) and now considering 7388/7976 (removed 588) transitions.
Finished structural reductions, in 1 iterations. Remains : 3892/4470 places, 7388/7976 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7388 rows 3892 cols
[2022-05-15 21:32:46] [INFO ] Computed 121 place invariants in 48 ms
[2022-05-15 21:32:46] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:32:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 77 ms returned sat
[2022-05-15 21:32:47] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 40 ms returned sat
[2022-05-15 21:32:50] [INFO ] After 3069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 21:32:50] [INFO ] State equation strengthened by 7216 read => feed constraints.
[2022-05-15 21:32:52] [INFO ] After 1601ms SMT Verify possible using 7216 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:32:53] [INFO ] After 2913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 835 ms.
[2022-05-15 21:32:54] [INFO ] After 7703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 3 properties in 3 ms.
Support contains 2 out of 3892 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3892/3892 places, 7388/7388 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3890 transition count 7384
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3890 transition count 7384
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 28 place count 3878 transition count 7372
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 3876 transition count 7372
Applied a total of 32 rules in 1748 ms. Remains 3876 /3892 variables (removed 16) and now considering 7372/7388 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 3876/3892 places, 7372/7388 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 217671 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217671 steps, saw 189374 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7372 rows 3876 cols
[2022-05-15 21:32:59] [INFO ] Computed 121 place invariants in 52 ms
[2022-05-15 21:32:59] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:33:00] [INFO ] [Nat]Absence check using 61 positive place invariants in 77 ms returned sat
[2022-05-15 21:33:00] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 36 ms returned sat
[2022-05-15 21:33:03] [INFO ] After 2567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:33:03] [INFO ] State equation strengthened by 7232 read => feed constraints.
[2022-05-15 21:33:03] [INFO ] After 833ms SMT Verify possible using 7232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 21:33:04] [INFO ] After 1166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 221 ms.
[2022-05-15 21:33:04] [INFO ] After 4543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Computed a total of 241 stabilizing places and 300 stable transitions
FORMULA CANConstruction-PT-060-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(G(((p0 U false)||p0))))))'
Support contains 2 out of 4470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4443 transition count 7922
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4443 transition count 7922
Applied a total of 54 rules in 1059 ms. Remains 4443 /4470 variables (removed 27) and now considering 7922/7976 (removed 54) transitions.
// Phase 1: matrix 7922 rows 4443 cols
[2022-05-15 21:33:05] [INFO ] Computed 121 place invariants in 44 ms
[2022-05-15 21:33:08] [INFO ] Implicit Places using invariants in 2576 ms returned []
// Phase 1: matrix 7922 rows 4443 cols
[2022-05-15 21:33:08] [INFO ] Computed 121 place invariants in 34 ms
[2022-05-15 21:33:11] [INFO ] Implicit Places using invariants and state equation in 2641 ms returned []
Implicit Place search using SMT with State Equation took 5220 ms to find 0 implicit places.
// Phase 1: matrix 7922 rows 4443 cols
[2022-05-15 21:33:11] [INFO ] Computed 121 place invariants in 37 ms
[2022-05-15 21:33:15] [INFO ] Dead Transitions using invariants and state equation in 4133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4443/4470 places, 7922/7976 transitions.
Finished structural reductions, in 1 iterations. Remains : 4443/4470 places, 7922/7976 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s1630 s1776)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 37368 steps with 34 reset in 403 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-00 finished in 11083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 4470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 4470 transition count 7556
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 4050 transition count 7556
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 867 place count 4023 transition count 7502
Iterating global reduction 2 with 27 rules applied. Total rules applied 894 place count 4023 transition count 7502
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 1014 place count 3963 transition count 7442
Applied a total of 1014 rules in 1600 ms. Remains 3963 /4470 variables (removed 507) and now considering 7442/7976 (removed 534) transitions.
// Phase 1: matrix 7442 rows 3963 cols
[2022-05-15 21:33:17] [INFO ] Computed 121 place invariants in 38 ms
[2022-05-15 21:33:19] [INFO ] Implicit Places using invariants in 2389 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 347, 353, 359]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2395 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3903/4470 places, 7442/7976 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 3903 transition count 7324
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 3785 transition count 7324
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 240 place count 3783 transition count 7322
Applied a total of 240 rules in 1158 ms. Remains 3783 /3903 variables (removed 120) and now considering 7322/7442 (removed 120) transitions.
// Phase 1: matrix 7322 rows 3783 cols
[2022-05-15 21:33:21] [INFO ] Computed 61 place invariants in 72 ms
[2022-05-15 21:33:23] [INFO ] Implicit Places using invariants in 2600 ms returned []
// Phase 1: matrix 7322 rows 3783 cols
[2022-05-15 21:33:23] [INFO ] Computed 61 place invariants in 86 ms
[2022-05-15 21:33:28] [INFO ] Implicit Places using invariants and state equation in 4451 ms returned []
Implicit Place search using SMT with State Equation took 7055 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3783/4470 places, 7322/7976 transitions.
Finished structural reductions, in 2 iterations. Remains : 3783/4470 places, 7322/7976 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s969)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 465 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-01 finished in 12295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(F(p1))||p1)))))'
Support contains 4 out of 4470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 4470 transition count 7556
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 4050 transition count 7556
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 865 place count 4025 transition count 7506
Iterating global reduction 2 with 25 rules applied. Total rules applied 890 place count 4025 transition count 7506
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 1010 place count 3965 transition count 7446
Applied a total of 1010 rules in 1510 ms. Remains 3965 /4470 variables (removed 505) and now considering 7446/7976 (removed 530) transitions.
// Phase 1: matrix 7446 rows 3965 cols
[2022-05-15 21:33:29] [INFO ] Computed 121 place invariants in 36 ms
[2022-05-15 21:33:32] [INFO ] Implicit Places using invariants in 2566 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 347, 353, 359]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2572 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3905/4470 places, 7446/7976 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 3905 transition count 7332
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 3791 transition count 7332
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 240 place count 3785 transition count 7326
Applied a total of 240 rules in 934 ms. Remains 3785 /3905 variables (removed 120) and now considering 7326/7446 (removed 120) transitions.
// Phase 1: matrix 7326 rows 3785 cols
[2022-05-15 21:33:33] [INFO ] Computed 61 place invariants in 83 ms
[2022-05-15 21:33:35] [INFO ] Implicit Places using invariants in 2654 ms returned []
// Phase 1: matrix 7326 rows 3785 cols
[2022-05-15 21:33:35] [INFO ] Computed 61 place invariants in 89 ms
[2022-05-15 21:33:36] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:33:37] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 4183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3785/4470 places, 7326/7976 transitions.
Finished structural reductions, in 2 iterations. Remains : 3785/4470 places, 7326/7976 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2755 s2061), p1:(LEQ s331 s3708)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 240 reset in 1235 ms.
Stack based approach found an accepted trace after 51817 steps with 127 reset with depth 250 and stack size 250 in 679 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-04 finished in 11251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Support contains 4 out of 4470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 4470 transition count 7558
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 4052 transition count 7558
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 861 place count 4027 transition count 7508
Iterating global reduction 2 with 25 rules applied. Total rules applied 886 place count 4027 transition count 7508
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 1006 place count 3967 transition count 7448
Applied a total of 1006 rules in 1471 ms. Remains 3967 /4470 variables (removed 503) and now considering 7448/7976 (removed 528) transitions.
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:33:40] [INFO ] Computed 121 place invariants in 40 ms
[2022-05-15 21:33:45] [INFO ] Implicit Places using invariants in 4269 ms returned []
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:33:45] [INFO ] Computed 121 place invariants in 30 ms
[2022-05-15 21:33:49] [INFO ] Implicit Places using invariants and state equation in 4267 ms returned []
Implicit Place search using SMT with State Equation took 8540 ms to find 0 implicit places.
[2022-05-15 21:33:50] [INFO ] Redundant transitions in 918 ms returned []
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:33:50] [INFO ] Computed 121 place invariants in 36 ms
[2022-05-15 21:33:54] [INFO ] Dead Transitions using invariants and state equation in 4360 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3967/4470 places, 7448/7976 transitions.
Finished structural reductions, in 1 iterations. Remains : 3967/4470 places, 7448/7976 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s3569 s1175), p0:(LEQ s28 s984)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 187 reset in 1220 ms.
Product exploration explored 100000 steps with 188 reset in 1202 ms.
Computed a total of 184 stabilizing places and 182 stable transitions
Computed a total of 184 stabilizing places and 182 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0)]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:33:57] [INFO ] Computed 121 place invariants in 37 ms
[2022-05-15 21:33:58] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:33:58] [INFO ] [Nat]Absence check using 61 positive place invariants in 72 ms returned sat
[2022-05-15 21:33:58] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 36 ms returned sat
[2022-05-15 21:34:01] [INFO ] After 2627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:34:01] [INFO ] State equation strengthened by 7200 read => feed constraints.
[2022-05-15 21:34:02] [INFO ] After 763ms SMT Verify possible using 7200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 21:34:02] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 208 ms.
[2022-05-15 21:34:02] [INFO ] After 4536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0)]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 7448/7448 transitions.
Applied a total of 0 rules in 556 ms. Remains 3967 /3967 variables (removed 0) and now considering 7448/7448 (removed 0) transitions.
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:03] [INFO ] Computed 121 place invariants in 40 ms
[2022-05-15 21:34:08] [INFO ] Implicit Places using invariants in 4322 ms returned []
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:08] [INFO ] Computed 121 place invariants in 31 ms
[2022-05-15 21:34:12] [INFO ] Implicit Places using invariants and state equation in 4212 ms returned []
Implicit Place search using SMT with State Equation took 8536 ms to find 0 implicit places.
[2022-05-15 21:34:13] [INFO ] Redundant transitions in 822 ms returned []
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:13] [INFO ] Computed 121 place invariants in 36 ms
[2022-05-15 21:34:17] [INFO ] Dead Transitions using invariants and state equation in 4378 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3967/3967 places, 7448/7448 transitions.
Computed a total of 184 stabilizing places and 182 stable transitions
Computed a total of 184 stabilizing places and 182 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0)]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 96131 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96131 steps, saw 70522 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:21] [INFO ] Computed 121 place invariants in 39 ms
[2022-05-15 21:34:21] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 21:34:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 75 ms returned sat
[2022-05-15 21:34:22] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 36 ms returned sat
[2022-05-15 21:34:25] [INFO ] After 3107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 21:34:25] [INFO ] State equation strengthened by 7200 read => feed constraints.
[2022-05-15 21:34:26] [INFO ] After 1234ms SMT Verify possible using 7200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 21:34:27] [INFO ] After 2286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 684 ms.
[2022-05-15 21:34:28] [INFO ] After 6880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0)]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 185 reset in 1171 ms.
Product exploration explored 100000 steps with 188 reset in 1232 ms.
Built C files in :
/tmp/ltsmin1422612131020039937
[2022-05-15 21:34:31] [INFO ] Too many transitions (7448) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:34:31] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1422612131020039937
Running compilation step : cd /tmp/ltsmin1422612131020039937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1422612131020039937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1422612131020039937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 7448/7448 transitions.
Applied a total of 0 rules in 544 ms. Remains 3967 /3967 variables (removed 0) and now considering 7448/7448 (removed 0) transitions.
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:35] [INFO ] Computed 121 place invariants in 37 ms
[2022-05-15 21:34:39] [INFO ] Implicit Places using invariants in 4298 ms returned []
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:39] [INFO ] Computed 121 place invariants in 30 ms
[2022-05-15 21:34:43] [INFO ] Implicit Places using invariants and state equation in 4268 ms returned []
Implicit Place search using SMT with State Equation took 8569 ms to find 0 implicit places.
[2022-05-15 21:34:44] [INFO ] Redundant transitions in 619 ms returned []
// Phase 1: matrix 7448 rows 3967 cols
[2022-05-15 21:34:44] [INFO ] Computed 121 place invariants in 41 ms
[2022-05-15 21:34:48] [INFO ] Dead Transitions using invariants and state equation in 4380 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3967/3967 places, 7448/7448 transitions.
Built C files in :
/tmp/ltsmin12261257192500315390
[2022-05-15 21:34:48] [INFO ] Too many transitions (7448) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:34:48] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12261257192500315390
Running compilation step : cd /tmp/ltsmin12261257192500315390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12261257192500315390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12261257192500315390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:34:52] [INFO ] Flatten gal took : 237 ms
[2022-05-15 21:34:52] [INFO ] Flatten gal took : 270 ms
[2022-05-15 21:34:52] [INFO ] Time to serialize gal into /tmp/LTL8371928393572521938.gal : 45 ms
[2022-05-15 21:34:52] [INFO ] Time to serialize properties into /tmp/LTL3664847166849239720.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8371928393572521938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3664847166849239720.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8371928...266
Read 1 LTL properties
Checking formula 0 : !((F((G("(Node4ResZone<=Node9GiveAnswer29)"))&&("(Node53GiveAnswer15<=Node12GiveAnswer42)"))))
Formula 0 simplified : !F("(Node53GiveAnswer15<=Node12GiveAnswer42)" & G"(Node4ResZone<=Node9GiveAnswer29)")
Detected timeout of ITS tools.
[2022-05-15 21:35:08] [INFO ] Flatten gal took : 224 ms
[2022-05-15 21:35:08] [INFO ] Applying decomposition
[2022-05-15 21:35:08] [INFO ] Flatten gal took : 204 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13489478356567830473.txt' '-o' '/tmp/graph13489478356567830473.bin' '-w' '/tmp/graph13489478356567830473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13489478356567830473.bin' '-l' '-1' '-v' '-w' '/tmp/graph13489478356567830473.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:35:08] [INFO ] Decomposing Gal with order
[2022-05-15 21:35:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:35:10] [INFO ] Removed a total of 7084 redundant transitions.
[2022-05-15 21:35:10] [INFO ] Flatten gal took : 1264 ms
[2022-05-15 21:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 6966 labels/synchronizations in 787 ms.
[2022-05-15 21:35:11] [INFO ] Time to serialize gal into /tmp/LTL10223309628233202493.gal : 27 ms
[2022-05-15 21:35:11] [INFO ] Time to serialize properties into /tmp/LTL13992260003845339256.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10223309628233202493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13992260003845339256.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1022330...268
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu5.Node4ResZone<=gu5.Node9GiveAnswer29)"))&&("(gu63.Node53GiveAnswer15<=gu63.Node12GiveAnswer42)"))))
Formula 0 simplified : !F("(gu63.Node53GiveAnswer15<=gu63.Node12GiveAnswer42)" & G"(gu5.Node4ResZone<=gu5.Node9GiveAnswer29)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7850711610477743125
[2022-05-15 21:35:26] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7850711610477743125
Running compilation step : cd /tmp/ltsmin7850711610477743125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7850711610477743125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7850711610477743125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-060-LTLCardinality-05 finished in 110585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U (X(p1)&&G(p2)))||F(X(p3)))))'
Support contains 7 out of 4470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 4446 transition count 7928
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 4446 transition count 7928
Applied a total of 48 rules in 1133 ms. Remains 4446 /4470 variables (removed 24) and now considering 7928/7976 (removed 48) transitions.
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:35:31] [INFO ] Computed 121 place invariants in 37 ms
[2022-05-15 21:35:33] [INFO ] Implicit Places using invariants in 2614 ms returned []
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:35:33] [INFO ] Computed 121 place invariants in 33 ms
[2022-05-15 21:35:36] [INFO ] Implicit Places using invariants and state equation in 2571 ms returned []
Implicit Place search using SMT with State Equation took 5186 ms to find 0 implicit places.
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:35:36] [INFO ] Computed 121 place invariants in 33 ms
[2022-05-15 21:35:40] [INFO ] Dead Transitions using invariants and state equation in 4096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4446/4470 places, 7928/7976 transitions.
Finished structural reductions, in 1 iterations. Remains : 4446/4470 places, 7928/7976 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s2670 s1086), p0:(LEQ s1367 s3796), p3:(LEQ 1 s160), p1:(LEQ s800 s4251)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 155 reset in 1064 ms.
Product exploration explored 100000 steps with 150 reset in 1082 ms.
Computed a total of 241 stabilizing places and 300 stable transitions
Computed a total of 241 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 p0 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1)))), (X (AND p2 (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p2 p0 (NOT p3) (NOT p1))), (X (NOT (AND p2 p0 (NOT p3) (NOT p1)))), (X (AND p2 (NOT p3) (NOT p1))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (X (AND p2 p0 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1)))))]
Knowledge based reduction with 23 factoid took 1332 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:35:45] [INFO ] Computed 121 place invariants in 33 ms
[2022-05-15 21:35:46] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 21:35:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 87 ms returned sat
[2022-05-15 21:35:47] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 54 ms returned sat
[2022-05-15 21:35:51] [INFO ] After 4046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 21:35:51] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:35:54] [INFO ] After 2531ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 21:35:57] [INFO ] After 5616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1771 ms.
[2022-05-15 21:35:59] [INFO ] After 12848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 23 ms.
Support contains 7 out of 4446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4446/4446 places, 7928/7928 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 4446 transition count 7510
Reduce places removed 418 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 419 rules applied. Total rules applied 837 place count 4028 transition count 7509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 838 place count 4027 transition count 7509
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 958 place count 3967 transition count 7449
Free-agglomeration rule applied 112 times.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1070 place count 3967 transition count 7337
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 1182 place count 3855 transition count 7337
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1183 place count 3855 transition count 7336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1184 place count 3854 transition count 7336
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1192 place count 3854 transition count 7336
Applied a total of 1192 rules in 2616 ms. Remains 3854 /4446 variables (removed 592) and now considering 7336/7928 (removed 592) transitions.
Finished structural reductions, in 1 iterations. Remains : 3854/4446 places, 7336/7928 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 6) seen :4
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
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
Running SMT prover for 2 properties.
// Phase 1: matrix 7336 rows 3854 cols
[2022-05-15 21:36:01] [INFO ] Computed 121 place invariants in 40 ms
[2022-05-15 21:36:02] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:36:02] [INFO ] [Nat]Absence check using 61 positive place invariants in 60 ms returned sat
[2022-05-15 21:36:02] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 35 ms returned sat
[2022-05-15 21:36:05] [INFO ] After 2639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:36:05] [INFO ] State equation strengthened by 7204 read => feed constraints.
[2022-05-15 21:36:06] [INFO ] After 1059ms SMT Verify possible using 7204 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:36:07] [INFO ] After 1777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 472 ms.
[2022-05-15 21:36:07] [INFO ] After 5545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 3854 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3854/3854 places, 7336/7336 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3853 transition count 7335
Applied a total of 2 rules in 873 ms. Remains 3853 /3854 variables (removed 1) and now considering 7335/7336 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3853/3854 places, 7335/7336 transitions.
Finished random walk after 8287 steps, including 20 resets, run visited all 2 properties in 185 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p2 p0 (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 p0 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1)))), (X (AND p2 (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p2 p0 (NOT p3) (NOT p1))), (X (NOT (AND p2 p0 (NOT p3) (NOT p1)))), (X (AND p2 (NOT p3) (NOT p1))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (X (AND p2 p0 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F p3), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (AND p0 p2 (NOT p3))))]
Knowledge based reduction with 23 factoid took 1721 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:36:11] [INFO ] Computed 121 place invariants in 40 ms
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 7 out of 4446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4446/4446 places, 7928/7928 transitions.
Applied a total of 0 rules in 574 ms. Remains 4446 /4446 variables (removed 0) and now considering 7928/7928 (removed 0) transitions.
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:36:27] [INFO ] Computed 121 place invariants in 39 ms
[2022-05-15 21:36:29] [INFO ] Implicit Places using invariants in 2622 ms returned []
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:36:29] [INFO ] Computed 121 place invariants in 33 ms
[2022-05-15 21:36:32] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 5222 ms to find 0 implicit places.
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:36:32] [INFO ] Computed 121 place invariants in 33 ms
[2022-05-15 21:36:36] [INFO ] Dead Transitions using invariants and state equation in 4131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4446/4446 places, 7928/7928 transitions.
Computed a total of 241 stabilizing places and 300 stable transitions
Computed a total of 241 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND p2 (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
Knowledge based reduction with 23 factoid took 1420 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:36:38] [INFO ] Computed 121 place invariants in 33 ms
[2022-05-15 21:36:39] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 21:36:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 84 ms returned sat
[2022-05-15 21:36:40] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 42 ms returned sat
[2022-05-15 21:36:44] [INFO ] After 4267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 21:36:44] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:36:47] [INFO ] After 2492ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 21:36:50] [INFO ] After 5279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1859 ms.
[2022-05-15 21:36:52] [INFO ] After 12723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 15 ms.
Support contains 7 out of 4446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4446/4446 places, 7928/7928 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 4446 transition count 7510
Reduce places removed 418 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 419 rules applied. Total rules applied 837 place count 4028 transition count 7509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 838 place count 4027 transition count 7509
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 958 place count 3967 transition count 7449
Free-agglomeration rule applied 112 times.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1070 place count 3967 transition count 7337
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 1182 place count 3855 transition count 7337
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1183 place count 3855 transition count 7336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1184 place count 3854 transition count 7336
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1192 place count 3854 transition count 7336
Applied a total of 1192 rules in 2568 ms. Remains 3854 /4446 variables (removed 592) and now considering 7336/7928 (removed 592) transitions.
Finished structural reductions, in 1 iterations. Remains : 3854/4446 places, 7336/7928 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
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 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7336 rows 3854 cols
[2022-05-15 21:36:54] [INFO ] Computed 121 place invariants in 34 ms
[2022-05-15 21:36:55] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:36:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 65 ms returned sat
[2022-05-15 21:36:55] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 37 ms returned sat
[2022-05-15 21:36:58] [INFO ] After 2705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:36:58] [INFO ] State equation strengthened by 7204 read => feed constraints.
[2022-05-15 21:36:59] [INFO ] After 1138ms SMT Verify possible using 7204 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:37:00] [INFO ] After 1890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 506 ms.
[2022-05-15 21:37:01] [INFO ] After 5770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 3854 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3854/3854 places, 7336/7336 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3853 transition count 7335
Applied a total of 2 rules in 904 ms. Remains 3853 /3854 variables (removed 1) and now considering 7335/7336 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3853/3854 places, 7335/7336 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 226 ms. (steps per millisecond=44 ) 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 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73359 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73359 steps, saw 51010 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7335 rows 3853 cols
[2022-05-15 21:37:05] [INFO ] Computed 121 place invariants in 36 ms
[2022-05-15 21:37:05] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:37:06] [INFO ] [Nat]Absence check using 61 positive place invariants in 66 ms returned sat
[2022-05-15 21:37:06] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 37 ms returned sat
[2022-05-15 21:37:09] [INFO ] After 2668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:37:09] [INFO ] State equation strengthened by 7205 read => feed constraints.
[2022-05-15 21:37:10] [INFO ] After 956ms SMT Verify possible using 7205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:37:10] [INFO ] After 1682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 448 ms.
[2022-05-15 21:37:11] [INFO ] After 5474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p2 (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND p2 (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F p3), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (AND p0 p2 (NOT p3))))]
Knowledge based reduction with 23 factoid took 1770 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 422 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
// Phase 1: matrix 7928 rows 4446 cols
[2022-05-15 21:37:13] [INFO ] Computed 121 place invariants in 40 ms
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 155 reset in 908 ms.
Stack based approach found an accepted trace after 30982 steps with 46 reset with depth 1097 and stack size 1097 in 290 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-06 finished in 120454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((true U p0)))'
Support contains 2 out of 4470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 4470 transition count 7556
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 4050 transition count 7556
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 868 place count 4022 transition count 7500
Iterating global reduction 2 with 28 rules applied. Total rules applied 896 place count 4022 transition count 7500
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 1016 place count 3962 transition count 7440
Applied a total of 1016 rules in 1466 ms. Remains 3962 /4470 variables (removed 508) and now considering 7440/7976 (removed 536) transitions.
// Phase 1: matrix 7440 rows 3962 cols
[2022-05-15 21:37:31] [INFO ] Computed 121 place invariants in 38 ms
[2022-05-15 21:37:34] [INFO ] Implicit Places using invariants in 2589 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 347, 353, 359]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2595 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3902/4470 places, 7440/7976 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 3902 transition count 7320
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 3782 transition count 7320
Applied a total of 240 rules in 521 ms. Remains 3782 /3902 variables (removed 120) and now considering 7320/7440 (removed 120) transitions.
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:37:35] [INFO ] Computed 61 place invariants in 78 ms
[2022-05-15 21:37:37] [INFO ] Implicit Places using invariants in 2680 ms returned []
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:37:37] [INFO ] Computed 61 place invariants in 78 ms
[2022-05-15 21:37:38] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:37:39] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 4169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3782/4470 places, 7320/7976 transitions.
Finished structural reductions, in 2 iterations. Remains : 3782/4470 places, 7320/7976 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3384 s1597)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 242 reset in 1171 ms.
Product exploration explored 100000 steps with 244 reset in 1194 ms.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 705599 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 705599 steps, saw 674620 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:37:45] [INFO ] Computed 61 place invariants in 76 ms
[2022-05-15 21:37:45] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:37:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 64 ms returned sat
[2022-05-15 21:37:48] [INFO ] After 2539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:37:48] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:37:49] [INFO ] After 768ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 21:37:49] [INFO ] After 1082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 250 ms.
[2022-05-15 21:37:49] [INFO ] After 4430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 3782 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3782/3782 places, 7320/7320 transitions.
Applied a total of 0 rules in 518 ms. Remains 3782 /3782 variables (removed 0) and now considering 7320/7320 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3782/3782 places, 7320/7320 transitions.
Finished random walk after 4564 steps, including 10 resets, run visited all 1 properties in 56 ms. (steps per millisecond=81 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3782 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3782/3782 places, 7320/7320 transitions.
Applied a total of 0 rules in 500 ms. Remains 3782 /3782 variables (removed 0) and now considering 7320/7320 (removed 0) transitions.
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:37:51] [INFO ] Computed 61 place invariants in 79 ms
[2022-05-15 21:37:53] [INFO ] Implicit Places using invariants in 2367 ms returned []
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:37:53] [INFO ] Computed 61 place invariants in 70 ms
[2022-05-15 21:37:54] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:37:55] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 3882 ms to find 0 implicit places.
[2022-05-15 21:37:55] [INFO ] Redundant transitions in 563 ms returned []
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:37:55] [INFO ] Computed 61 place invariants in 86 ms
[2022-05-15 21:37:59] [INFO ] Dead Transitions using invariants and state equation in 4085 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3782/3782 places, 7320/7320 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 724564 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 724564 steps, saw 692621 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:38:03] [INFO ] Computed 61 place invariants in 108 ms
[2022-05-15 21:38:03] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:38:04] [INFO ] [Nat]Absence check using 61 positive place invariants in 64 ms returned sat
[2022-05-15 21:38:06] [INFO ] After 2410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:38:06] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:38:07] [INFO ] After 788ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 21:38:07] [INFO ] After 1107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 248 ms.
[2022-05-15 21:38:07] [INFO ] After 4276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 3782 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3782/3782 places, 7320/7320 transitions.
Applied a total of 0 rules in 484 ms. Remains 3782 /3782 variables (removed 0) and now considering 7320/7320 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3782/3782 places, 7320/7320 transitions.
Finished random walk after 3484 steps, including 8 resets, run visited all 1 properties in 48 ms. (steps per millisecond=72 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 244 reset in 1171 ms.
Product exploration explored 100000 steps with 246 reset in 1205 ms.
Built C files in :
/tmp/ltsmin8266676897026058997
[2022-05-15 21:38:11] [INFO ] Too many transitions (7320) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:38:11] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8266676897026058997
Running compilation step : cd /tmp/ltsmin8266676897026058997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8266676897026058997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8266676897026058997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3782 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3782/3782 places, 7320/7320 transitions.
Applied a total of 0 rules in 510 ms. Remains 3782 /3782 variables (removed 0) and now considering 7320/7320 (removed 0) transitions.
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:38:14] [INFO ] Computed 61 place invariants in 90 ms
[2022-05-15 21:38:17] [INFO ] Implicit Places using invariants in 2372 ms returned []
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:38:17] [INFO ] Computed 61 place invariants in 72 ms
[2022-05-15 21:38:18] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:38:18] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 3893 ms to find 0 implicit places.
[2022-05-15 21:38:19] [INFO ] Redundant transitions in 578 ms returned []
// Phase 1: matrix 7320 rows 3782 cols
[2022-05-15 21:38:19] [INFO ] Computed 61 place invariants in 101 ms
[2022-05-15 21:38:23] [INFO ] Dead Transitions using invariants and state equation in 4101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3782/3782 places, 7320/7320 transitions.
Built C files in :
/tmp/ltsmin13907140758218028508
[2022-05-15 21:38:23] [INFO ] Too many transitions (7320) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:38:23] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13907140758218028508
Running compilation step : cd /tmp/ltsmin13907140758218028508;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13907140758218028508;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13907140758218028508;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:38:26] [INFO ] Flatten gal took : 201 ms
[2022-05-15 21:38:27] [INFO ] Flatten gal took : 230 ms
[2022-05-15 21:38:27] [INFO ] Time to serialize gal into /tmp/LTL4445192886044619777.gal : 20 ms
[2022-05-15 21:38:27] [INFO ] Time to serialize properties into /tmp/LTL14650865921560017881.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4445192886044619777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14650865921560017881.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4445192...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node53requestsent15<=Node22requestsent58)"))))
Formula 0 simplified : !GF"(Node53requestsent15<=Node22requestsent58)"
Detected timeout of ITS tools.
[2022-05-15 21:38:42] [INFO ] Flatten gal took : 233 ms
[2022-05-15 21:38:42] [INFO ] Applying decomposition
[2022-05-15 21:38:42] [INFO ] Flatten gal took : 198 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2358644686219680275.txt' '-o' '/tmp/graph2358644686219680275.bin' '-w' '/tmp/graph2358644686219680275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2358644686219680275.bin' '-l' '-1' '-v' '-w' '/tmp/graph2358644686219680275.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:38:42] [INFO ] Decomposing Gal with order
[2022-05-15 21:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:38:43] [INFO ] Removed a total of 7137 redundant transitions.
[2022-05-15 21:38:44] [INFO ] Flatten gal took : 941 ms
[2022-05-15 21:38:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6956 labels/synchronizations in 605 ms.
[2022-05-15 21:38:45] [INFO ] Time to serialize gal into /tmp/LTL7752972030537401643.gal : 109 ms
[2022-05-15 21:38:45] [INFO ] Time to serialize properties into /tmp/LTL13016727775841079535.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7752972030537401643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13016727775841079535.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7752972...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu61.Node53requestsent15<=gu61.Node22requestsent58)"))))
Formula 0 simplified : !GF"(gu61.Node53requestsent15<=gu61.Node22requestsent58)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18201264306056518347
[2022-05-15 21:39:00] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18201264306056518347
Running compilation step : cd /tmp/ltsmin18201264306056518347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18201264306056518347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18201264306056518347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-060-LTLCardinality-08 finished in 92731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(G(F(X((G(p0)&&G(X(p0)))))))))))'
Support contains 2 out of 4470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 4470 transition count 7556
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 4050 transition count 7556
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 866 place count 4024 transition count 7504
Iterating global reduction 2 with 26 rules applied. Total rules applied 892 place count 4024 transition count 7504
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 1012 place count 3964 transition count 7444
Applied a total of 1012 rules in 1606 ms. Remains 3964 /4470 variables (removed 506) and now considering 7444/7976 (removed 532) transitions.
// Phase 1: matrix 7444 rows 3964 cols
[2022-05-15 21:39:04] [INFO ] Computed 121 place invariants in 35 ms
[2022-05-15 21:39:07] [INFO ] Implicit Places using invariants in 2548 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 347, 353, 359]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2554 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3904/4470 places, 7444/7976 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 3904 transition count 7328
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 3788 transition count 7328
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 3784 transition count 7324
Applied a total of 240 rules in 981 ms. Remains 3784 /3904 variables (removed 120) and now considering 7324/7444 (removed 120) transitions.
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:08] [INFO ] Computed 61 place invariants in 78 ms
[2022-05-15 21:39:10] [INFO ] Implicit Places using invariants in 2637 ms returned []
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:11] [INFO ] Computed 61 place invariants in 71 ms
[2022-05-15 21:39:12] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:39:12] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 4118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3784/4470 places, 7324/7976 transitions.
Finished structural reductions, in 2 iterations. Remains : 3784/4470 places, 7324/7976 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3779 s3643)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 241 reset in 1291 ms.
Product exploration explored 100000 steps with 241 reset in 1300 ms.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4219 steps, run visited all 1 properties in 31 ms. (steps per millisecond=136 )
Probabilistic random walk after 4219 steps, saw 4144 distinct states, run finished after 32 ms. (steps per millisecond=131 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 3784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3784/3784 places, 7324/7324 transitions.
Applied a total of 0 rules in 535 ms. Remains 3784 /3784 variables (removed 0) and now considering 7324/7324 (removed 0) transitions.
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:16] [INFO ] Computed 61 place invariants in 74 ms
[2022-05-15 21:39:18] [INFO ] Implicit Places using invariants in 2585 ms returned []
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:18] [INFO ] Computed 61 place invariants in 70 ms
[2022-05-15 21:39:19] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2022-05-15 21:39:20] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 4107 ms to find 0 implicit places.
[2022-05-15 21:39:20] [INFO ] Redundant transitions in 568 ms returned []
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:20] [INFO ] Computed 61 place invariants in 75 ms
[2022-05-15 21:39:25] [INFO ] Dead Transitions using invariants and state equation in 4259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3784/3784 places, 7324/7324 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4219 steps, run visited all 1 properties in 31 ms. (steps per millisecond=136 )
Probabilistic random walk after 4219 steps, saw 4144 distinct states, run finished after 31 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 238 reset in 1254 ms.
Product exploration explored 100000 steps with 241 reset in 1267 ms.
Built C files in :
/tmp/ltsmin1289801889349263171
[2022-05-15 21:39:28] [INFO ] Too many transitions (7324) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:39:28] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1289801889349263171
Running compilation step : cd /tmp/ltsmin1289801889349263171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1289801889349263171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1289801889349263171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3784/3784 places, 7324/7324 transitions.
Applied a total of 0 rules in 497 ms. Remains 3784 /3784 variables (removed 0) and now considering 7324/7324 (removed 0) transitions.
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:31] [INFO ] Computed 61 place invariants in 80 ms
[2022-05-15 21:39:34] [INFO ] Implicit Places using invariants in 2684 ms returned []
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:34] [INFO ] Computed 61 place invariants in 71 ms
[2022-05-15 21:39:38] [INFO ] Implicit Places using invariants and state equation in 4409 ms returned []
Implicit Place search using SMT with State Equation took 7095 ms to find 0 implicit places.
[2022-05-15 21:39:39] [INFO ] Redundant transitions in 578 ms returned []
// Phase 1: matrix 7324 rows 3784 cols
[2022-05-15 21:39:39] [INFO ] Computed 61 place invariants in 76 ms
[2022-05-15 21:39:43] [INFO ] Dead Transitions using invariants and state equation in 4064 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3784/3784 places, 7324/7324 transitions.
Built C files in :
/tmp/ltsmin6969709605853036806
[2022-05-15 21:39:43] [INFO ] Too many transitions (7324) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:39:43] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6969709605853036806
Running compilation step : cd /tmp/ltsmin6969709605853036806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6969709605853036806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6969709605853036806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:39:47] [INFO ] Flatten gal took : 228 ms
[2022-05-15 21:39:47] [INFO ] Flatten gal took : 191 ms
[2022-05-15 21:39:47] [INFO ] Time to serialize gal into /tmp/LTL6007595019167870596.gal : 18 ms
[2022-05-15 21:39:47] [INFO ] Time to serialize properties into /tmp/LTL1326041432946889788.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6007595019167870596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1326041432946889788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6007595...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F(X(G(F(X((G("(Node59GiveAnswer54<=Node57GiveAnswer37)"))&&(G(X("(Node59GiveAnswer54<=Node57GiveAnswer37)"))))))))))))
Formula 0 simplified : !FGFXGFX(G"(Node59GiveAnswer54<=Node57GiveAnswer37)" & GX"(Node59GiveAnswer54<=Node57GiveAnswer37)")
Detected timeout of ITS tools.
[2022-05-15 21:40:02] [INFO ] Flatten gal took : 184 ms
[2022-05-15 21:40:02] [INFO ] Applying decomposition
[2022-05-15 21:40:02] [INFO ] Flatten gal took : 191 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5849120987348064868.txt' '-o' '/tmp/graph5849120987348064868.bin' '-w' '/tmp/graph5849120987348064868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5849120987348064868.bin' '-l' '-1' '-v' '-w' '/tmp/graph5849120987348064868.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:40:02] [INFO ] Decomposing Gal with order
[2022-05-15 21:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:40:03] [INFO ] Removed a total of 7143 redundant transitions.
[2022-05-15 21:40:04] [INFO ] Flatten gal took : 878 ms
[2022-05-15 21:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6956 labels/synchronizations in 613 ms.
[2022-05-15 21:40:05] [INFO ] Time to serialize gal into /tmp/LTL3816980611352801814.gal : 22 ms
[2022-05-15 21:40:05] [INFO ] Time to serialize properties into /tmp/LTL17824290374016336192.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3816980611352801814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17824290374016336192.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3816980...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F(X(G(F(X((G("(gu61.Node59GiveAnswer54<=gu61.Node57GiveAnswer37)"))&&(G(X("(gu61.Node59GiveAnswer54<=gu61.Node57GiveAnswer37)")...166
Formula 0 simplified : !FGFXGFX(G"(gu61.Node59GiveAnswer54<=gu61.Node57GiveAnswer37)" & GX"(gu61.Node59GiveAnswer54<=gu61.Node57GiveAnswer37)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3222753604723317052
[2022-05-15 21:40:20] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3222753604723317052
Running compilation step : cd /tmp/ltsmin3222753604723317052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3222753604723317052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3222753604723317052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-060-LTLCardinality-09 finished in 79981 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 1 out of 4470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4443 transition count 7922
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4443 transition count 7922
Applied a total of 54 rules in 1143 ms. Remains 4443 /4470 variables (removed 27) and now considering 7922/7976 (removed 54) transitions.
// Phase 1: matrix 7922 rows 4443 cols
[2022-05-15 21:40:24] [INFO ] Computed 121 place invariants in 36 ms
[2022-05-15 21:40:26] [INFO ] Implicit Places using invariants in 2587 ms returned []
// Phase 1: matrix 7922 rows 4443 cols
[2022-05-15 21:40:26] [INFO ] Computed 121 place invariants in 32 ms
[2022-05-15 21:40:29] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 5177 ms to find 0 implicit places.
// Phase 1: matrix 7922 rows 4443 cols
[2022-05-15 21:40:29] [INFO ] Computed 121 place invariants in 38 ms
[2022-05-15 21:40:33] [INFO ] Dead Transitions using invariants and state equation in 4072 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4443/4470 places, 7922/7976 transitions.
Finished structural reductions, in 1 iterations. Remains : 4443/4470 places, 7922/7976 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s3763)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-11 finished in 10507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(!(p0 U p1) U (p1 U X(p1))))&&(p0 U p1)))'
Support contains 2 out of 4470 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4445 transition count 7926
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4445 transition count 7926
Applied a total of 50 rules in 1121 ms. Remains 4445 /4470 variables (removed 25) and now considering 7926/7976 (removed 50) transitions.
// Phase 1: matrix 7926 rows 4445 cols
[2022-05-15 21:40:34] [INFO ] Computed 121 place invariants in 42 ms
[2022-05-15 21:40:37] [INFO ] Implicit Places using invariants in 2614 ms returned []
// Phase 1: matrix 7926 rows 4445 cols
[2022-05-15 21:40:37] [INFO ] Computed 121 place invariants in 37 ms
[2022-05-15 21:40:40] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 5207 ms to find 0 implicit places.
// Phase 1: matrix 7926 rows 4445 cols
[2022-05-15 21:40:40] [INFO ] Computed 121 place invariants in 36 ms
[2022-05-15 21:40:44] [INFO ] Dead Transitions using invariants and state equation in 4104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4445/4470 places, 7926/7976 transitions.
Finished structural reductions, in 1 iterations. Remains : 4445/4470 places, 7926/7976 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p1, true]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s33 s2749)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-12 finished in 10544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(!(F(p0) U p1))||p2))))'
Support contains 6 out of 4470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4470/4470 places, 7976/7976 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4445 transition count 7926
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4445 transition count 7926
Applied a total of 50 rules in 1168 ms. Remains 4445 /4470 variables (removed 25) and now considering 7926/7976 (removed 50) transitions.
// Phase 1: matrix 7926 rows 4445 cols
[2022-05-15 21:40:45] [INFO ] Computed 121 place invariants in 37 ms
[2022-05-15 21:40:48] [INFO ] Implicit Places using invariants in 2637 ms returned []
// Phase 1: matrix 7926 rows 4445 cols
[2022-05-15 21:40:48] [INFO ] Computed 121 place invariants in 35 ms
[2022-05-15 21:40:50] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned []
Implicit Place search using SMT with State Equation took 5311 ms to find 0 implicit places.
// Phase 1: matrix 7926 rows 4445 cols
[2022-05-15 21:40:50] [INFO ] Computed 121 place invariants in 34 ms
[2022-05-15 21:40:54] [INFO ] Dead Transitions using invariants and state equation in 3790 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4445/4470 places, 7926/7976 transitions.
Finished structural reductions, in 1 iterations. Remains : 4445/4470 places, 7926/7976 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (AND p1 (NOT p2)), p1, (AND p1 p0), p0, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-060-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=5, aps=[p2:(GT s3515 s3038), p1:(LEQ s3399 s3581), p0:(LEQ s4248 s3297)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-060-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLCardinality-14 finished in 10544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((true U p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(G(F(X((G(p0)&&G(X(p0)))))))))))'
[2022-05-15 21:40:55] [INFO ] Flatten gal took : 199 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10093101606017253671
[2022-05-15 21:40:55] [INFO ] Too many transitions (7976) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:40:55] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10093101606017253671
Running compilation step : cd /tmp/ltsmin10093101606017253671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:40:55] [INFO ] Applying decomposition
[2022-05-15 21:40:55] [INFO ] Flatten gal took : 209 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14873808748915237525.txt' '-o' '/tmp/graph14873808748915237525.bin' '-w' '/tmp/graph14873808748915237525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14873808748915237525.bin' '-l' '-1' '-v' '-w' '/tmp/graph14873808748915237525.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:40:56] [INFO ] Decomposing Gal with order
[2022-05-15 21:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:40:57] [INFO ] Removed a total of 7260 redundant transitions.
[2022-05-15 21:40:57] [INFO ] Flatten gal took : 870 ms
[2022-05-15 21:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 7000 labels/synchronizations in 652 ms.
[2022-05-15 21:40:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality9813265219722982372.gal : 95 ms
[2022-05-15 21:40:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality282688898116169532.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9813265219722982372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality282688898116169532.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...287
Read 3 LTL properties
Checking formula 0 : !((F((G("(gu252.Node4ResZone<=gu252.Node9GiveAnswer29)"))&&("(gu255.Node53GiveAnswer15<=gu255.Node12GiveAnswer42)"))))
Formula 0 simplified : !F("(gu255.Node53GiveAnswer15<=gu255.Node12GiveAnswer42)" & G"(gu252.Node4ResZone<=gu252.Node9GiveAnswer29)")
Compilation finished in 36628 ms.
Running link step : cd /tmp/ltsmin10093101606017253671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin10093101606017253671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10093101606017253671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10093101606017253671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((true U (LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 22:03:59] [INFO ] Flatten gal took : 1411 ms
[2022-05-15 22:03:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality18115227614642173933.gal : 101 ms
[2022-05-15 22:03:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality15719199517243570799.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18115227614642173933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15719199517243570799.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 3 LTL properties
Checking formula 0 : !((F((G("(Node4ResZone<=Node9GiveAnswer29)"))&&("(Node53GiveAnswer15<=Node12GiveAnswer42)"))))
Formula 0 simplified : !F("(Node53GiveAnswer15<=Node12GiveAnswer42)" & G"(Node4ResZone<=Node9GiveAnswer29)")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10093101606017253671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((true U (LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10093101606017253671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>(X([](<>(X(([]((LTLAPp3==true))&&[](X((LTLAPp3==true)))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 22:27:02] [INFO ] Flatten gal took : 2060 ms
[2022-05-15 22:27:08] [INFO ] Input system was already deterministic with 7976 transitions.
[2022-05-15 22:27:08] [INFO ] Transformed 4470 places.
[2022-05-15 22:27:08] [INFO ] Transformed 7976 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 22:27:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality7732725615449348000.gal : 42 ms
[2022-05-15 22:27:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality5225669816667608505.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7732725615449348000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5225669816667608505.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(Node4ResZone<=Node9GiveAnswer29)"))&&("(Node53GiveAnswer15<=Node12GiveAnswer42)"))))
Formula 0 simplified : !F("(Node53GiveAnswer15<=Node12GiveAnswer42)" & G"(Node4ResZone<=Node9GiveAnswer29)")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-060, 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 r024-tall-165251918600531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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