Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600636.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:22 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-030-LTLFireability-00
FORMULA_NAME CANConstruction-PT-030-LTLFireability-01
FORMULA_NAME CANConstruction-PT-030-LTLFireability-02
FORMULA_NAME CANConstruction-PT-030-LTLFireability-03
FORMULA_NAME CANConstruction-PT-030-LTLFireability-04
FORMULA_NAME CANConstruction-PT-030-LTLFireability-05
FORMULA_NAME CANConstruction-PT-030-LTLFireability-06
FORMULA_NAME CANConstruction-PT-030-LTLFireability-07
FORMULA_NAME CANConstruction-PT-030-LTLFireability-08
FORMULA_NAME CANConstruction-PT-030-LTLFireability-09
FORMULA_NAME CANConstruction-PT-030-LTLFireability-10
FORMULA_NAME CANConstruction-PT-030-LTLFireability-11
FORMULA_NAME CANConstruction-PT-030-LTLFireability-12
FORMULA_NAME CANConstruction-PT-030-LTLFireability-13
FORMULA_NAME CANConstruction-PT-030-LTLFireability-14
FORMULA_NAME CANConstruction-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678367333018

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 13:08:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 13:08:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:08:55] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2023-03-09 13:08:55] [INFO ] Transformed 2162 places.
[2023-03-09 13:08:55] [INFO ] Transformed 3840 transitions.
[2023-03-09 13:08:55] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-030-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 823 places :
Symmetric choice reduction at 0 with 823 rule applications. Total rules 823 place count 1339 transition count 2194
Iterating global reduction 0 with 823 rules applied. Total rules applied 1646 place count 1339 transition count 2194
Applied a total of 1646 rules in 350 ms. Remains 1339 /2162 variables (removed 823) and now considering 2194/3840 (removed 1646) transitions.
// Phase 1: matrix 2194 rows 1339 cols
[2023-03-09 13:08:56] [INFO ] Computed 61 place invariants in 74 ms
[2023-03-09 13:08:58] [INFO ] Implicit Places using invariants in 1588 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1635 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1309/2162 places, 2194/3840 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1279 transition count 2164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1279 transition count 2164
Applied a total of 60 rules in 194 ms. Remains 1279 /1309 variables (removed 30) and now considering 2164/2194 (removed 30) transitions.
// Phase 1: matrix 2164 rows 1279 cols
[2023-03-09 13:08:58] [INFO ] Computed 31 place invariants in 28 ms
[2023-03-09 13:09:03] [INFO ] Implicit Places using invariants in 5296 ms returned []
[2023-03-09 13:09:03] [INFO ] Invariant cache hit.
[2023-03-09 13:09:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:10] [INFO ] Implicit Places using invariants and state equation in 6962 ms returned []
Implicit Place search using SMT with State Equation took 12279 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1279/2162 places, 2164/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14460 ms. Remains : 1279/2162 places, 2164/3840 transitions.
Support contains 48 out of 1279 places after structural reductions.
[2023-03-09 13:09:11] [INFO ] Flatten gal took : 216 ms
[2023-03-09 13:09:11] [INFO ] Flatten gal took : 111 ms
[2023-03-09 13:09:11] [INFO ] Input system was already deterministic with 2164 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 33) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 13:09:12] [INFO ] Invariant cache hit.
[2023-03-09 13:09:12] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2023-03-09 13:09:13] [INFO ] After 1069ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:5
[2023-03-09 13:09:13] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:14] [INFO ] After 491ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 13:09:14] [INFO ] After 2053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 13:09:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-09 13:09:15] [INFO ] After 894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 13:09:16] [INFO ] After 1014ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 13:09:18] [INFO ] After 2575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1032 ms.
[2023-03-09 13:09:19] [INFO ] After 5034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 173 ms.
Support contains 8 out of 1279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 463 place count 1041 transition count 1913
Iterating global reduction 2 with 13 rules applied. Total rules applied 476 place count 1041 transition count 1913
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 486 place count 1041 transition count 1903
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 496 place count 1031 transition count 1903
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 560 place count 999 transition count 1871
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 562 place count 999 transition count 1869
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 564 place count 997 transition count 1869
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 565 place count 997 transition count 1869
Applied a total of 565 rules in 735 ms. Remains 997 /1279 variables (removed 282) and now considering 1869/2164 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 736 ms. Remains : 997/1279 places, 1869/2164 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1869 rows 997 cols
[2023-03-09 13:09:20] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 13:09:20] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-09 13:09:21] [INFO ] After 448ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:09:21] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:21] [INFO ] After 169ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:09:21] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:09:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-09 13:09:21] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:09:22] [INFO ] After 264ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:09:22] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-09 13:09:22] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1869/1869 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 995 transition count 1865
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 995 transition count 1865
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 6 place count 994 transition count 1864
Applied a total of 6 rules in 173 ms. Remains 994 /997 variables (removed 3) and now considering 1864/1869 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 994/997 places, 1864/1869 transitions.
Finished random walk after 9389 steps, including 46 resets, run visited all 1 properties in 62 ms. (steps per millisecond=151 )
Computed a total of 91 stabilizing places and 120 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1262 transition count 2130
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1262 transition count 2130
Applied a total of 34 rules in 121 ms. Remains 1262 /1279 variables (removed 17) and now considering 2130/2164 (removed 34) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-09 13:09:23] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 13:09:24] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2023-03-09 13:09:24] [INFO ] Invariant cache hit.
[2023-03-09 13:09:25] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:32] [INFO ] Implicit Places using invariants and state equation in 7507 ms returned []
Implicit Place search using SMT with State Equation took 8594 ms to find 0 implicit places.
[2023-03-09 13:09:32] [INFO ] Invariant cache hit.
[2023-03-09 13:09:33] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1279 places, 2130/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10365 ms. Remains : 1262/1279 places, 2130/2164 transitions.
Stuttering acceptance computed with spot in 416 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (LT s0 1) (LT s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-00 finished in 10899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(p1) U p2)))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1279 transition count 1968
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1083 transition count 1968
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 392 place count 1083 transition count 1938
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 452 place count 1053 transition count 1938
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 467 place count 1038 transition count 1908
Iterating global reduction 2 with 15 rules applied. Total rules applied 482 place count 1038 transition count 1908
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 494 place count 1038 transition count 1896
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 506 place count 1026 transition count 1896
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 568 place count 995 transition count 1865
Applied a total of 568 rules in 251 ms. Remains 995 /1279 variables (removed 284) and now considering 1865/2164 (removed 299) transitions.
// Phase 1: matrix 1865 rows 995 cols
[2023-03-09 13:09:34] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 13:09:35] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-09 13:09:35] [INFO ] Invariant cache hit.
[2023-03-09 13:09:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:40] [INFO ] Implicit Places using invariants and state equation in 5462 ms returned []
Implicit Place search using SMT with State Equation took 6111 ms to find 0 implicit places.
[2023-03-09 13:09:40] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-09 13:09:40] [INFO ] Invariant cache hit.
[2023-03-09 13:09:41] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1865/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7350 ms. Remains : 995/1279 places, 1865/2164 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s353 1), p1:(GEQ s865 1), p0:(AND (GEQ s28 1) (GEQ s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 226 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-01 finished in 7563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(F(p1)||X(F(p2)))) U (G((p0&&(F(p1)||X(F(p2)))))||(p0&&(F(p1)||X(F(p2)))&&X(!p2)))))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1264 transition count 2134
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1264 transition count 2134
Applied a total of 30 rules in 72 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-09 13:09:41] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:09:42] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-09 13:09:42] [INFO ] Invariant cache hit.
[2023-03-09 13:09:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:09:50] [INFO ] Implicit Places using invariants and state equation in 7685 ms returned []
Implicit Place search using SMT with State Equation took 8394 ms to find 0 implicit places.
[2023-03-09 13:09:50] [INFO ] Invariant cache hit.
[2023-03-09 13:09:51] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1279 places, 2134/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9386 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s620 1), p1:(LT s820 1), p2:(AND (GEQ s258 1) (GEQ s557 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1148 ms.
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLFireability-02 finished in 11867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((p1&&G(p2)))))))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1264 transition count 2134
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1264 transition count 2134
Applied a total of 30 rules in 199 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-09 13:09:53] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-09 13:09:54] [INFO ] Implicit Places using invariants in 956 ms returned []
[2023-03-09 13:09:54] [INFO ] Invariant cache hit.
[2023-03-09 13:09:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:10:01] [INFO ] Implicit Places using invariants and state equation in 7098 ms returned []
Implicit Place search using SMT with State Equation took 8057 ms to find 0 implicit places.
[2023-03-09 13:10:01] [INFO ] Invariant cache hit.
[2023-03-09 13:10:02] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1279 places, 2134/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9255 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s532 1) (GEQ s902 1)), p1:(GEQ s532 1), p2:(OR (LT s0 1) (LT s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-03 finished in 9498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1263 transition count 2132
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1263 transition count 2132
Applied a total of 32 rules in 104 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-09 13:10:03] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-09 13:10:03] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-09 13:10:03] [INFO ] Invariant cache hit.
[2023-03-09 13:10:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:10:11] [INFO ] Implicit Places using invariants and state equation in 7583 ms returned []
Implicit Place search using SMT with State Equation took 8218 ms to find 0 implicit places.
[2023-03-09 13:10:11] [INFO ] Invariant cache hit.
[2023-03-09 13:10:12] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1279 places, 2132/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9404 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s1131 1) (AND (GEQ s186 1) (GEQ s551 1))), p1:(AND (GEQ s186 1) (GEQ s551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 571 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-04 finished in 9602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1&&F(p2)))&&p0))))'
Support contains 5 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1263 transition count 2132
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1263 transition count 2132
Applied a total of 32 rules in 101 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-09 13:10:12] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 13:10:13] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-09 13:10:13] [INFO ] Invariant cache hit.
[2023-03-09 13:10:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:10:23] [INFO ] Implicit Places using invariants and state equation in 10125 ms returned []
Implicit Place search using SMT with State Equation took 10911 ms to find 0 implicit places.
[2023-03-09 13:10:23] [INFO ] Invariant cache hit.
[2023-03-09 13:10:24] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1279 places, 2132/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12065 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s837 1)), p1:(GEQ s963 1), p2:(AND (GEQ s6 1) (GEQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 526 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-05 finished in 12459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1262 transition count 2130
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1262 transition count 2130
Applied a total of 34 rules in 123 ms. Remains 1262 /1279 variables (removed 17) and now considering 2130/2164 (removed 34) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-09 13:10:25] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:10:26] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-09 13:10:26] [INFO ] Invariant cache hit.
[2023-03-09 13:10:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:10:33] [INFO ] Implicit Places using invariants and state equation in 7845 ms returned []
Implicit Place search using SMT with State Equation took 8641 ms to find 0 implicit places.
[2023-03-09 13:10:33] [INFO ] Invariant cache hit.
[2023-03-09 13:10:35] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1279 places, 2130/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10115 ms. Remains : 1262/1279 places, 2130/2164 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-06 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:(AND (GEQ s78 1) (GEQ s659 1) (GEQ s330 1) (GEQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-06 finished in 10260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p0||(p1 U p2))))))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1265 transition count 2136
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1265 transition count 2136
Applied a total of 28 rules in 78 ms. Remains 1265 /1279 variables (removed 14) and now considering 2136/2164 (removed 28) transitions.
// Phase 1: matrix 2136 rows 1265 cols
[2023-03-09 13:10:35] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:10:36] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-09 13:10:36] [INFO ] Invariant cache hit.
[2023-03-09 13:10:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:10:45] [INFO ] Implicit Places using invariants and state equation in 9013 ms returned []
Implicit Place search using SMT with State Equation took 9717 ms to find 0 implicit places.
[2023-03-09 13:10:45] [INFO ] Invariant cache hit.
[2023-03-09 13:10:46] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1265/1279 places, 2136/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11264 ms. Remains : 1265/1279 places, 2136/2164 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s782 1), p2:(GEQ s518 1), p1:(GEQ s923 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7807 steps with 14 reset in 37 ms.
FORMULA CANConstruction-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-07 finished in 11568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||F(p0)))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 466 place count 1038 transition count 1907
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 1038 transition count 1907
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 495 place count 1038 transition count 1894
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 508 place count 1025 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 568 place count 995 transition count 1864
Applied a total of 568 rules in 197 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-09 13:10:47] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-09 13:10:47] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-09 13:10:47] [INFO ] Invariant cache hit.
[2023-03-09 13:10:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:10:55] [INFO ] Implicit Places using invariants and state equation in 7573 ms returned []
Implicit Place search using SMT with State Equation took 8252 ms to find 0 implicit places.
[2023-03-09 13:10:55] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-09 13:10:55] [INFO ] Invariant cache hit.
[2023-03-09 13:10:56] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1864/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9606 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s56 1) (GEQ s74 1)), p1:(GEQ s270 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 710 steps with 3 reset in 5 ms.
FORMULA CANConstruction-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-08 finished in 9744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G((p1||F(p2))))))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1264 transition count 2134
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1264 transition count 2134
Applied a total of 30 rules in 70 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-09 13:10:56] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-09 13:10:57] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-09 13:10:57] [INFO ] Invariant cache hit.
[2023-03-09 13:10:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:11:05] [INFO ] Implicit Places using invariants and state equation in 7749 ms returned []
Implicit Place search using SMT with State Equation took 8487 ms to find 0 implicit places.
[2023-03-09 13:11:05] [INFO ] Invariant cache hit.
[2023-03-09 13:11:06] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1279 places, 2134/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9716 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s752 1), p1:(AND (GEQ s30 1) (GEQ s191 1)), p2:(LT s875 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 194 reset in 795 ms.
Product exploration explored 100000 steps with 194 reset in 796 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:11:09] [INFO ] Invariant cache hit.
[2023-03-09 13:11:09] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2023-03-09 13:11:10] [INFO ] After 993ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:11:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:11:10] [INFO ] After 261ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:11:10] [INFO ] After 1707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:11:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-09 13:11:11] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:11:11] [INFO ] After 197ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:11:12] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-09 13:11:12] [INFO ] After 1290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Applied a total of 0 rules in 40 ms. Remains 1264 /1264 variables (removed 0) and now considering 2134/2134 (removed 0) transitions.
[2023-03-09 13:11:13] [INFO ] Invariant cache hit.
[2023-03-09 13:11:13] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-09 13:11:13] [INFO ] Invariant cache hit.
[2023-03-09 13:11:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:11:21] [INFO ] Implicit Places using invariants and state equation in 7134 ms returned []
Implicit Place search using SMT with State Equation took 8040 ms to find 0 implicit places.
[2023-03-09 13:11:21] [INFO ] Invariant cache hit.
[2023-03-09 13:11:22] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9195 ms. Remains : 1264/1264 places, 2134/2134 transitions.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 447 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 2983 steps, including 5 resets, run visited all 3 properties in 86 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 478 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 196 reset in 410 ms.
Product exploration explored 100000 steps with 192 reset in 678 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1264 transition count 2134
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 119 place count 1264 transition count 2134
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 150 place count 1264 transition count 2134
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 210 place count 1204 transition count 2074
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 270 place count 1204 transition count 2074
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 388 place count 1204 transition count 2074
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 535 place count 1057 transition count 1927
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 682 place count 1057 transition count 1927
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 682 rules in 778 ms. Remains 1057 /1264 variables (removed 207) and now considering 1927/2134 (removed 207) transitions.
[2023-03-09 13:11:26] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 1927 rows 1057 cols
[2023-03-09 13:11:26] [INFO ] Computed 31 place invariants in 25 ms
[2023-03-09 13:11:27] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1057/1264 places, 1927/2134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1892 ms. Remains : 1057/1264 places, 1927/2134 transitions.
Built C files in :
/tmp/ltsmin11207646293187660439
[2023-03-09 13:11:27] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11207646293187660439
Running compilation step : cd /tmp/ltsmin11207646293187660439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11207646293187660439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11207646293187660439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Applied a total of 0 rules in 87 ms. Remains 1264 /1264 variables (removed 0) and now considering 2134/2134 (removed 0) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-09 13:11:31] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 13:11:31] [INFO ] Implicit Places using invariants in 775 ms returned []
[2023-03-09 13:11:31] [INFO ] Invariant cache hit.
[2023-03-09 13:11:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:11:39] [INFO ] Implicit Places using invariants and state equation in 7414 ms returned []
Implicit Place search using SMT with State Equation took 8206 ms to find 0 implicit places.
[2023-03-09 13:11:39] [INFO ] Invariant cache hit.
[2023-03-09 13:11:40] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9232 ms. Remains : 1264/1264 places, 2134/2134 transitions.
Built C files in :
/tmp/ltsmin3849717458019750184
[2023-03-09 13:11:40] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3849717458019750184
Running compilation step : cd /tmp/ltsmin3849717458019750184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin3849717458019750184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3849717458019750184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 13:11:43] [INFO ] Flatten gal took : 98 ms
[2023-03-09 13:11:43] [INFO ] Flatten gal took : 55 ms
[2023-03-09 13:11:43] [INFO ] Time to serialize gal into /tmp/LTL13388323812202330580.gal : 12 ms
[2023-03-09 13:11:43] [INFO ] Time to serialize properties into /tmp/LTL15886875090404496225.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13388323812202330580.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16024592448829227387.hoa' '-atoms' '/tmp/LTL15886875090404496225.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15886875090404496225.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16024592448829227387.hoa
Detected timeout of ITS tools.
[2023-03-09 13:11:58] [INFO ] Flatten gal took : 59 ms
[2023-03-09 13:11:58] [INFO ] Flatten gal took : 51 ms
[2023-03-09 13:11:58] [INFO ] Time to serialize gal into /tmp/LTL10688846817853119209.gal : 9 ms
[2023-03-09 13:11:58] [INFO ] Time to serialize properties into /tmp/LTL6142939936231229631.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10688846817853119209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6142939936231229631.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(Node12GiveAnswer11<1)")))&&(G(("((Node2IsInserted>=1)&&(Node15Request>=1))")||(F("(Node16GiveAnswer18<1)")))))))
Formula 0 simplified : XF(GF!"(Node12GiveAnswer11<1)" | (!"((Node2IsInserted>=1)&&(Node15Request>=1))" & G!"(Node16GiveAnswer18<1)"))
Detected timeout of ITS tools.
[2023-03-09 13:12:14] [INFO ] Flatten gal took : 104 ms
[2023-03-09 13:12:14] [INFO ] Applying decomposition
[2023-03-09 13:12:14] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15244212442239573947.txt' '-o' '/tmp/graph15244212442239573947.bin' '-w' '/tmp/graph15244212442239573947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15244212442239573947.bin' '-l' '-1' '-v' '-w' '/tmp/graph15244212442239573947.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:12:14] [INFO ] Decomposing Gal with order
[2023-03-09 13:12:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:12:15] [INFO ] Removed a total of 1824 redundant transitions.
[2023-03-09 13:12:15] [INFO ] Flatten gal took : 582 ms
[2023-03-09 13:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 3466 labels/synchronizations in 157 ms.
[2023-03-09 13:12:15] [INFO ] Time to serialize gal into /tmp/LTL15066658363377181441.gal : 25 ms
[2023-03-09 13:12:15] [INFO ] Time to serialize properties into /tmp/LTL726505732044113396.ltl : 403 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15066658363377181441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL726505732044113396.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i11.u49.Node12GiveAnswer11<1)")))&&(G(("((i2.u8.Node2IsInserted>=1)&&(i15.u66.Node15Request>=1))")||(F("(i18.u78.Node16Giv...175
Formula 0 simplified : XF(GF!"(i11.u49.Node12GiveAnswer11<1)" | (!"((i2.u8.Node2IsInserted>=1)&&(i15.u66.Node15Request>=1))" & G!"(i18.u78.Node16GiveAnswer...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7571623384781901289
[2023-03-09 13:12:31] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7571623384781901289
Running compilation step : cd /tmp/ltsmin7571623384781901289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7571623384781901289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7571623384781901289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-030-LTLFireability-10 finished in 97371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U G(p1))||(p2 U p3))))'
Support contains 7 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1263 transition count 2132
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1263 transition count 2132
Applied a total of 32 rules in 88 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-09 13:12:34] [INFO ] Computed 31 place invariants in 25 ms
[2023-03-09 13:12:35] [INFO ] Implicit Places using invariants in 1061 ms returned []
[2023-03-09 13:12:35] [INFO ] Invariant cache hit.
[2023-03-09 13:12:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:12:43] [INFO ] Implicit Places using invariants and state equation in 7760 ms returned []
Implicit Place search using SMT with State Equation took 8824 ms to find 0 implicit places.
[2023-03-09 13:12:43] [INFO ] Invariant cache hit.
[2023-03-09 13:12:44] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1279 places, 2132/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10128 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s354 1) (GEQ s1175 1)), p3:(AND (GEQ s246 1) (GEQ s760 1)), p2:(AND (GEQ s470 1) (GEQ s54 1) (GEQ s203 1)), p0:(AND (GEQ s54 1) (GEQ s203 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 9 ms.
FORMULA CANConstruction-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-12 finished in 10475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 466 place count 1038 transition count 1907
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 1038 transition count 1907
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 495 place count 1038 transition count 1894
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 508 place count 1025 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 568 place count 995 transition count 1864
Applied a total of 568 rules in 194 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-09 13:12:44] [INFO ] Computed 31 place invariants in 29 ms
[2023-03-09 13:12:45] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-09 13:12:45] [INFO ] Invariant cache hit.
[2023-03-09 13:12:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:12:51] [INFO ] Implicit Places using invariants and state equation in 6045 ms returned []
Implicit Place search using SMT with State Equation took 6950 ms to find 0 implicit places.
[2023-03-09 13:12:51] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-09 13:12:51] [INFO ] Invariant cache hit.
[2023-03-09 13:12:53] [INFO ] Dead Transitions using invariants and state equation in 1364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1864/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8628 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s709 1), p1:(OR (LT s26 1) (LT s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 464 steps with 2 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-13 finished in 8712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1279 transition count 1968
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1083 transition count 1968
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 392 place count 1083 transition count 1938
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 452 place count 1053 transition count 1938
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 469 place count 1036 transition count 1904
Iterating global reduction 2 with 17 rules applied. Total rules applied 486 place count 1036 transition count 1904
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 500 place count 1036 transition count 1890
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 514 place count 1022 transition count 1890
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 572 place count 993 transition count 1861
Applied a total of 572 rules in 220 ms. Remains 993 /1279 variables (removed 286) and now considering 1861/2164 (removed 303) transitions.
// Phase 1: matrix 1861 rows 993 cols
[2023-03-09 13:12:53] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 13:12:54] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-09 13:12:54] [INFO ] Invariant cache hit.
[2023-03-09 13:12:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:13:00] [INFO ] Implicit Places using invariants and state equation in 5826 ms returned []
Implicit Place search using SMT with State Equation took 6811 ms to find 0 implicit places.
[2023-03-09 13:13:00] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-09 13:13:00] [INFO ] Invariant cache hit.
[2023-03-09 13:13:01] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 993/1279 places, 1861/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7906 ms. Remains : 993/1279 places, 1861/2164 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s73 1) (GEQ s435 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 275 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-14 finished in 7980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1279 transition count 1971
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 387 place count 1086 transition count 1970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 1085 transition count 1970
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 388 place count 1085 transition count 1940
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 448 place count 1055 transition count 1940
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 464 place count 1039 transition count 1908
Iterating global reduction 3 with 16 rules applied. Total rules applied 480 place count 1039 transition count 1908
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 493 place count 1039 transition count 1895
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 506 place count 1026 transition count 1895
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 568 place count 995 transition count 1864
Applied a total of 568 rules in 231 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-09 13:13:01] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-09 13:13:02] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-09 13:13:02] [INFO ] Invariant cache hit.
[2023-03-09 13:13:03] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:13:08] [INFO ] Implicit Places using invariants and state equation in 6289 ms returned []
Implicit Place search using SMT with State Equation took 7034 ms to find 0 implicit places.
[2023-03-09 13:13:08] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-09 13:13:08] [INFO ] Invariant cache hit.
[2023-03-09 13:13:09] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1864/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8267 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s649 1), p0:(LT s89 1)], 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 474 reset in 573 ms.
Stack based approach found an accepted trace after 10954 steps with 51 reset with depth 190 and stack size 190 in 54 ms.
FORMULA CANConstruction-PT-030-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-15 finished in 9047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G((p1||F(p2))))))'
Found a Lengthening insensitive property : CANConstruction-PT-030-LTLFireability-10
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 465 place count 1039 transition count 1909
Iterating global reduction 2 with 15 rules applied. Total rules applied 480 place count 1039 transition count 1909
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 492 place count 1039 transition count 1897
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 504 place count 1027 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 566 place count 996 transition count 1866
Applied a total of 566 rules in 174 ms. Remains 996 /1279 variables (removed 283) and now considering 1866/2164 (removed 298) transitions.
// Phase 1: matrix 1866 rows 996 cols
[2023-03-09 13:13:10] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-09 13:13:11] [INFO ] Implicit Places using invariants in 856 ms returned []
[2023-03-09 13:13:11] [INFO ] Invariant cache hit.
[2023-03-09 13:13:12] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 13:13:17] [INFO ] Implicit Places using invariants and state equation in 5528 ms returned []
Implicit Place search using SMT with State Equation took 6399 ms to find 0 implicit places.
[2023-03-09 13:13:17] [INFO ] Invariant cache hit.
[2023-03-09 13:13:17] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 996/1279 places, 1866/2164 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7343 ms. Remains : 996/1279 places, 1866/2164 transitions.
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s484 1), p1:(AND (GEQ s10 1) (GEQ s51 1)), p2:(LT s607 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 497 reset in 596 ms.
Stack based approach found an accepted trace after 6241 steps with 29 reset with depth 162 and stack size 161 in 40 ms.
Treatment of property CANConstruction-PT-030-LTLFireability-10 finished in 8252 ms.
FORMULA CANConstruction-PT-030-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 13:13:18] [INFO ] Flatten gal took : 47 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 263106 ms.

BK_STOP 1678367598868

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690600636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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