Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Apr 12 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 45K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716885164949

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 08:32:48] [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]
[2024-05-28 08:32:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:32:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 08:32:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 08:32:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 790 ms
[2024-05-28 08:32:49] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 08:32:49] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-28 08:32:49] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-COL-5-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 184 steps, including 0 resets, run visited all 10 properties in 19 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-28 08:32:49] [INFO ] Flatten gal took : 31 ms
[2024-05-28 08:32:50] [INFO ] Flatten gal took : 6 ms
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 08:32:50] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 104 ms.
[2024-05-28 08:32:50] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 30 places in 30 ms
Reduce places removed 30 places and 60 transitions.
FORMULA Peterson-COL-5-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 49 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:32:50] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-28 08:32:50] [INFO ] Computed 23 invariants in 49 ms
[2024-05-28 08:32:51] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-05-28 08:32:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:32:51] [INFO ] Invariant cache hit.
[2024-05-28 08:32:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:32:52] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2024-05-28 08:32:52] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:32:52] [INFO ] Invariant cache hit.
[2024-05-28 08:32:53] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3446 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2024-05-28 08:32:54] [INFO ] Flatten gal took : 152 ms
[2024-05-28 08:32:54] [INFO ] Flatten gal took : 144 ms
[2024-05-28 08:32:54] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 08:32:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:32:55] [INFO ] Invariant cache hit.
[2024-05-28 08:32:55] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-28 08:32:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 16 ms returned sat
[2024-05-28 08:32:55] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 08:32:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2024-05-28 08:32:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2024-05-28 08:32:56] [INFO ] After 747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 08:32:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:32:57] [INFO ] After 274ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 08:32:57] [INFO ] Deduced a trap composed of 27 places in 541 ms of which 10 ms to minimize.
[2024-05-28 08:32:58] [INFO ] Deduced a trap composed of 36 places in 745 ms of which 2 ms to minimize.
[2024-05-28 08:32:59] [INFO ] Deduced a trap composed of 18 places in 654 ms of which 2 ms to minimize.
[2024-05-28 08:33:00] [INFO ] Deduced a trap composed of 26 places in 826 ms of which 3 ms to minimize.
[2024-05-28 08:33:00] [INFO ] Deduced a trap composed of 19 places in 725 ms of which 3 ms to minimize.
[2024-05-28 08:33:01] [INFO ] Deduced a trap composed of 76 places in 723 ms of which 2 ms to minimize.
[2024-05-28 08:33:02] [INFO ] Deduced a trap composed of 75 places in 666 ms of which 1 ms to minimize.
[2024-05-28 08:33:03] [INFO ] Deduced a trap composed of 71 places in 693 ms of which 2 ms to minimize.
[2024-05-28 08:33:04] [INFO ] Deduced a trap composed of 114 places in 699 ms of which 3 ms to minimize.
[2024-05-28 08:33:04] [INFO ] Deduced a trap composed of 101 places in 698 ms of which 1 ms to minimize.
[2024-05-28 08:33:05] [INFO ] Deduced a trap composed of 97 places in 705 ms of which 1 ms to minimize.
[2024-05-28 08:33:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8687 ms
[2024-05-28 08:33:06] [INFO ] Deduced a trap composed of 123 places in 682 ms of which 1 ms to minimize.
[2024-05-28 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 865 ms
[2024-05-28 08:33:06] [INFO ] After 10030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 220 ms.
[2024-05-28 08:33:07] [INFO ] After 11370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 484 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 484 transition count 707
Deduced a syphon composed of 185 places in 2 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 299 transition count 707
Applied a total of 1070 rules in 195 ms. Remains 299 /834 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 299/834 places, 707/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Finished probabilistic random walk after 61 steps, run visited all 2 properties in 10 ms. (steps per millisecond=6 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 11 ms. (steps per millisecond=5 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(G(p0)) U p1)))'
Support contains 240 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 834 transition count 1036
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 628 transition count 1036
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 412 place count 628 transition count 876
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 732 place count 468 transition count 876
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 744 place count 462 transition count 870
Applied a total of 744 rules in 149 ms. Remains 462 /834 variables (removed 372) and now considering 870/1242 (removed 372) transitions.
[2024-05-28 08:33:08] [INFO ] Flow matrix only has 750 transitions (discarded 120 similar events)
// Phase 1: matrix 750 rows 462 cols
[2024-05-28 08:33:08] [INFO ] Computed 23 invariants in 10 ms
[2024-05-28 08:33:08] [INFO ] Implicit Places using invariants in 271 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 275 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/834 places, 870/1242 transitions.
Applied a total of 0 rules in 36 ms. Remains 456 /456 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 463 ms. Remains : 456/834 places, 870/1242 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 484 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s217 1)) (AND (GEQ s3 1) (GEQ s182 1)) (AND (GEQ s7 1) (GEQ s229 1)) (AND (GEQ s5 1) (GEQ s264 1)) (AND (GEQ s3 1) (GEQ s288 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11437 reset in 1705 ms.
Stack based approach found an accepted trace after 673 steps with 79 reset with depth 7 and stack size 7 in 10 ms.
FORMULA Peterson-COL-5-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-00 finished in 2767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 24 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 62 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2024-05-28 08:33:11] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2024-05-28 08:33:11] [INFO ] Computed 23 invariants in 3 ms
[2024-05-28 08:33:11] [INFO ] Implicit Places using invariants in 293 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 295 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/834 places, 720/1242 transitions.
Applied a total of 0 rules in 20 ms. Remains 306 /306 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 379 ms. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s137 1) (GEQ s138 1) (GEQ s139 1) (GEQ s132 1) (GEQ s133 1) (GEQ s134 1) (GEQ s135 1) (GEQ s144 1) (GEQ s145 1) (GEQ s147 1) (GEQ s140 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8477 reset in 692 ms.
Stack based approach found an accepted trace after 63 steps with 5 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-01 finished in 1188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(!p0) U p1)&&X(G(!p1)))))))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 25 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:33:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-28 08:33:12] [INFO ] Computed 23 invariants in 18 ms
[2024-05-28 08:33:12] [INFO ] Implicit Places using invariants in 669 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 675 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 26 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s743 1) (GEQ s809 1) (GEQ s677 1) (GEQ s683 1) (GEQ s671 1) (GEQ s803 1) (GEQ s797 1) (GEQ s737 1) (GEQ s695 1) (GEQ s761 1) (GEQ s827 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 504 ms.
Product exploration explored 100000 steps with 2 reset in 612 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 08:33:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-28 08:33:15] [INFO ] Computed 17 invariants in 12 ms
[2024-05-28 08:33:16] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-28 08:33:16] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 08:33:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 08:33:17] [INFO ] After 1068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 08:33:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:33:17] [INFO ] After 400ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 08:33:18] [INFO ] Deduced a trap composed of 26 places in 791 ms of which 2 ms to minimize.
[2024-05-28 08:33:19] [INFO ] Deduced a trap composed of 48 places in 819 ms of which 2 ms to minimize.
[2024-05-28 08:33:20] [INFO ] Deduced a trap composed of 16 places in 828 ms of which 1 ms to minimize.
[2024-05-28 08:33:21] [INFO ] Deduced a trap composed of 67 places in 818 ms of which 2 ms to minimize.
[2024-05-28 08:33:22] [INFO ] Deduced a trap composed of 15 places in 777 ms of which 3 ms to minimize.
[2024-05-28 08:33:23] [INFO ] Deduced a trap composed of 45 places in 764 ms of which 1 ms to minimize.
[2024-05-28 08:33:24] [INFO ] Deduced a trap composed of 26 places in 797 ms of which 1 ms to minimize.
[2024-05-28 08:33:24] [INFO ] Deduced a trap composed of 52 places in 737 ms of which 1 ms to minimize.
[2024-05-28 08:33:25] [INFO ] Deduced a trap composed of 41 places in 754 ms of which 2 ms to minimize.
[2024-05-28 08:33:26] [INFO ] Deduced a trap composed of 67 places in 734 ms of which 1 ms to minimize.
[2024-05-28 08:33:27] [INFO ] Deduced a trap composed of 107 places in 784 ms of which 2 ms to minimize.
[2024-05-28 08:33:27] [INFO ] Deduced a trap composed of 53 places in 562 ms of which 2 ms to minimize.
[2024-05-28 08:33:28] [INFO ] Deduced a trap composed of 126 places in 755 ms of which 2 ms to minimize.
[2024-05-28 08:33:29] [INFO ] Deduced a trap composed of 52 places in 741 ms of which 1 ms to minimize.
[2024-05-28 08:33:30] [INFO ] Deduced a trap composed of 22 places in 774 ms of which 2 ms to minimize.
[2024-05-28 08:33:31] [INFO ] Deduced a trap composed of 119 places in 596 ms of which 1 ms to minimize.
[2024-05-28 08:33:31] [INFO ] Deduced a trap composed of 79 places in 609 ms of which 1 ms to minimize.
[2024-05-28 08:33:32] [INFO ] Deduced a trap composed of 55 places in 665 ms of which 1 ms to minimize.
[2024-05-28 08:33:33] [INFO ] Deduced a trap composed of 45 places in 601 ms of which 1 ms to minimize.
[2024-05-28 08:33:34] [INFO ] Deduced a trap composed of 122 places in 639 ms of which 1 ms to minimize.
[2024-05-28 08:33:34] [INFO ] Deduced a trap composed of 56 places in 668 ms of which 2 ms to minimize.
[2024-05-28 08:33:35] [INFO ] Deduced a trap composed of 44 places in 646 ms of which 2 ms to minimize.
[2024-05-28 08:33:36] [INFO ] Deduced a trap composed of 93 places in 619 ms of which 1 ms to minimize.
[2024-05-28 08:33:36] [INFO ] Deduced a trap composed of 67 places in 557 ms of which 1 ms to minimize.
[2024-05-28 08:33:37] [INFO ] Deduced a trap composed of 79 places in 612 ms of which 2 ms to minimize.
[2024-05-28 08:33:38] [INFO ] Deduced a trap composed of 62 places in 649 ms of which 2 ms to minimize.
[2024-05-28 08:33:39] [INFO ] Deduced a trap composed of 70 places in 612 ms of which 2 ms to minimize.
[2024-05-28 08:33:39] [INFO ] Deduced a trap composed of 71 places in 724 ms of which 2 ms to minimize.
[2024-05-28 08:33:40] [INFO ] Deduced a trap composed of 41 places in 673 ms of which 1 ms to minimize.
[2024-05-28 08:33:41] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:33:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:33:41] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 14 ms.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 93 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 593/828 places, 1007/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 309463 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{0=1}
Probabilistic random walk after 309463 steps, saw 124218 distinct states, run finished after 3003 ms. (steps per millisecond=103 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 08:33:44] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-28 08:33:44] [INFO ] Computed 17 invariants in 16 ms
[2024-05-28 08:33:45] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2024-05-28 08:33:45] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:33:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 08:33:46] [INFO ] After 893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:33:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:33:46] [INFO ] After 462ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:33:47] [INFO ] Deduced a trap composed of 53 places in 503 ms of which 2 ms to minimize.
[2024-05-28 08:33:48] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 1 ms to minimize.
[2024-05-28 08:33:48] [INFO ] Deduced a trap composed of 65 places in 487 ms of which 2 ms to minimize.
[2024-05-28 08:33:49] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 1 ms to minimize.
[2024-05-28 08:33:49] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 2 ms to minimize.
[2024-05-28 08:33:49] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 1 ms to minimize.
[2024-05-28 08:33:50] [INFO ] Deduced a trap composed of 55 places in 404 ms of which 0 ms to minimize.
[2024-05-28 08:33:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3460 ms
[2024-05-28 08:33:50] [INFO ] After 4349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 427 ms.
[2024-05-28 08:33:50] [INFO ] After 5881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 44 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 593/593 places, 1007/1007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325353 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325353 steps, saw 126607 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 08:33:54] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:33:54] [INFO ] Invariant cache hit.
[2024-05-28 08:33:54] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 08:33:55] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:33:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-28 08:33:56] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:33:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:33:56] [INFO ] After 495ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:33:57] [INFO ] Deduced a trap composed of 13 places in 457 ms of which 1 ms to minimize.
[2024-05-28 08:33:58] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2024-05-28 08:33:58] [INFO ] Deduced a trap composed of 73 places in 453 ms of which 1 ms to minimize.
[2024-05-28 08:33:59] [INFO ] Deduced a trap composed of 16 places in 434 ms of which 1 ms to minimize.
[2024-05-28 08:33:59] [INFO ] Deduced a trap composed of 85 places in 430 ms of which 2 ms to minimize.
[2024-05-28 08:34:00] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 5 ms to minimize.
[2024-05-28 08:34:00] [INFO ] Deduced a trap composed of 20 places in 399 ms of which 1 ms to minimize.
[2024-05-28 08:34:01] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 2 ms to minimize.
[2024-05-28 08:34:01] [INFO ] Deduced a trap composed of 18 places in 450 ms of which 2 ms to minimize.
[2024-05-28 08:34:02] [INFO ] Deduced a trap composed of 44 places in 417 ms of which 1 ms to minimize.
[2024-05-28 08:34:02] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2024-05-28 08:34:03] [INFO ] Deduced a trap composed of 32 places in 520 ms of which 1 ms to minimize.
[2024-05-28 08:34:03] [INFO ] Deduced a trap composed of 32 places in 502 ms of which 1 ms to minimize.
[2024-05-28 08:34:04] [INFO ] Deduced a trap composed of 57 places in 461 ms of which 1 ms to minimize.
[2024-05-28 08:34:04] [INFO ] Deduced a trap composed of 48 places in 470 ms of which 2 ms to minimize.
[2024-05-28 08:34:05] [INFO ] Deduced a trap composed of 77 places in 486 ms of which 1 ms to minimize.
[2024-05-28 08:34:05] [INFO ] Deduced a trap composed of 69 places in 445 ms of which 1 ms to minimize.
[2024-05-28 08:34:06] [INFO ] Deduced a trap composed of 60 places in 444 ms of which 1 ms to minimize.
[2024-05-28 08:34:06] [INFO ] Deduced a trap composed of 58 places in 445 ms of which 1 ms to minimize.
[2024-05-28 08:34:07] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 1 ms to minimize.
[2024-05-28 08:34:08] [INFO ] Deduced a trap composed of 86 places in 506 ms of which 1 ms to minimize.
[2024-05-28 08:34:08] [INFO ] Deduced a trap composed of 16 places in 513 ms of which 1 ms to minimize.
[2024-05-28 08:34:09] [INFO ] Deduced a trap composed of 34 places in 480 ms of which 1 ms to minimize.
[2024-05-28 08:34:09] [INFO ] Deduced a trap composed of 78 places in 476 ms of which 1 ms to minimize.
[2024-05-28 08:34:10] [INFO ] Deduced a trap composed of 80 places in 457 ms of which 1 ms to minimize.
[2024-05-28 08:34:10] [INFO ] Deduced a trap composed of 89 places in 507 ms of which 1 ms to minimize.
[2024-05-28 08:34:11] [INFO ] Deduced a trap composed of 48 places in 476 ms of which 1 ms to minimize.
[2024-05-28 08:34:11] [INFO ] Deduced a trap composed of 62 places in 472 ms of which 2 ms to minimize.
[2024-05-28 08:34:12] [INFO ] Deduced a trap composed of 91 places in 487 ms of which 1 ms to minimize.
[2024-05-28 08:34:13] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 1 ms to minimize.
[2024-05-28 08:34:13] [INFO ] Deduced a trap composed of 65 places in 476 ms of which 2 ms to minimize.
[2024-05-28 08:34:15] [INFO ] Deduced a trap composed of 29 places in 547 ms of which 1 ms to minimize.
[2024-05-28 08:34:15] [INFO ] Deduced a trap composed of 33 places in 464 ms of which 1 ms to minimize.
[2024-05-28 08:34:16] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 1 ms to minimize.
[2024-05-28 08:34:16] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 1 ms to minimize.
[2024-05-28 08:34:16] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 1 ms to minimize.
[2024-05-28 08:34:17] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 1 ms to minimize.
[2024-05-28 08:34:17] [INFO ] Deduced a trap composed of 65 places in 303 ms of which 1 ms to minimize.
[2024-05-28 08:34:18] [INFO ] Deduced a trap composed of 63 places in 283 ms of which 1 ms to minimize.
[2024-05-28 08:34:18] [INFO ] Deduced a trap composed of 50 places in 437 ms of which 1 ms to minimize.
[2024-05-28 08:34:19] [INFO ] Deduced a trap composed of 61 places in 424 ms of which 1 ms to minimize.
[2024-05-28 08:34:19] [INFO ] Deduced a trap composed of 101 places in 416 ms of which 2 ms to minimize.
[2024-05-28 08:34:20] [INFO ] Deduced a trap composed of 88 places in 255 ms of which 0 ms to minimize.
[2024-05-28 08:34:20] [INFO ] Deduced a trap composed of 79 places in 249 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:34:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:34:20] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 26 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 25 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:34:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:34:20] [INFO ] Invariant cache hit.
[2024-05-28 08:34:20] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-28 08:34:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:34:20] [INFO ] Invariant cache hit.
[2024-05-28 08:34:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:34:23] [INFO ] Implicit Places using invariants and state equation in 2962 ms returned []
Implicit Place search using SMT with State Equation took 3359 ms to find 0 implicit places.
[2024-05-28 08:34:23] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-28 08:34:23] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:34:23] [INFO ] Invariant cache hit.
[2024-05-28 08:34:25] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4685 ms. Remains : 593/593 places, 1007/1007 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 6 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 135 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-28 08:34:25] [INFO ] Computed 6 invariants in 5 ms
[2024-05-28 08:34:25] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 08:34:25] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:34:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 08:34:26] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:34:26] [INFO ] After 1138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 470 ms.
[2024-05-28 08:34:27] [INFO ] After 1725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 390 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-28 08:34:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-28 08:34:28] [INFO ] Computed 17 invariants in 10 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), true]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 28 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:34:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:34:29] [INFO ] Invariant cache hit.
[2024-05-28 08:34:30] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 08:34:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:34:30] [INFO ] Invariant cache hit.
[2024-05-28 08:34:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:34:33] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 3750 ms to find 0 implicit places.
[2024-05-28 08:34:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:34:33] [INFO ] Invariant cache hit.
[2024-05-28 08:34:35] [INFO ] Dead Transitions using invariants and state equation in 1565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5347 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 08:34:36] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:34:36] [INFO ] Invariant cache hit.
[2024-05-28 08:34:36] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-28 08:34:36] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 08:34:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2024-05-28 08:34:37] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 08:34:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:34:38] [INFO ] After 596ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 08:34:39] [INFO ] Deduced a trap composed of 136 places in 726 ms of which 2 ms to minimize.
[2024-05-28 08:34:40] [INFO ] Deduced a trap composed of 28 places in 713 ms of which 2 ms to minimize.
[2024-05-28 08:34:41] [INFO ] Deduced a trap composed of 63 places in 727 ms of which 1 ms to minimize.
[2024-05-28 08:34:41] [INFO ] Deduced a trap composed of 11 places in 734 ms of which 1 ms to minimize.
[2024-05-28 08:34:42] [INFO ] Deduced a trap composed of 37 places in 739 ms of which 1 ms to minimize.
[2024-05-28 08:34:43] [INFO ] Deduced a trap composed of 11 places in 746 ms of which 2 ms to minimize.
[2024-05-28 08:34:44] [INFO ] Deduced a trap composed of 42 places in 802 ms of which 1 ms to minimize.
[2024-05-28 08:34:45] [INFO ] Deduced a trap composed of 77 places in 698 ms of which 2 ms to minimize.
[2024-05-28 08:34:45] [INFO ] Deduced a trap composed of 135 places in 729 ms of which 2 ms to minimize.
[2024-05-28 08:34:46] [INFO ] Deduced a trap composed of 55 places in 681 ms of which 2 ms to minimize.
[2024-05-28 08:34:47] [INFO ] Deduced a trap composed of 48 places in 673 ms of which 2 ms to minimize.
[2024-05-28 08:34:48] [INFO ] Deduced a trap composed of 37 places in 759 ms of which 1 ms to minimize.
[2024-05-28 08:34:49] [INFO ] Deduced a trap composed of 11 places in 840 ms of which 2 ms to minimize.
[2024-05-28 08:34:50] [INFO ] Deduced a trap composed of 52 places in 736 ms of which 1 ms to minimize.
[2024-05-28 08:34:50] [INFO ] Deduced a trap composed of 37 places in 631 ms of which 1 ms to minimize.
[2024-05-28 08:34:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 12427 ms
[2024-05-28 08:34:52] [INFO ] Deduced a trap composed of 71 places in 611 ms of which 2 ms to minimize.
[2024-05-28 08:34:52] [INFO ] Deduced a trap composed of 67 places in 710 ms of which 1 ms to minimize.
[2024-05-28 08:34:53] [INFO ] Deduced a trap composed of 53 places in 752 ms of which 1 ms to minimize.
[2024-05-28 08:34:54] [INFO ] Deduced a trap composed of 39 places in 682 ms of which 1 ms to minimize.
[2024-05-28 08:34:55] [INFO ] Deduced a trap composed of 15 places in 678 ms of which 2 ms to minimize.
[2024-05-28 08:34:56] [INFO ] Deduced a trap composed of 40 places in 631 ms of which 2 ms to minimize.
[2024-05-28 08:34:56] [INFO ] Deduced a trap composed of 63 places in 649 ms of which 1 ms to minimize.
[2024-05-28 08:34:57] [INFO ] Deduced a trap composed of 41 places in 676 ms of which 1 ms to minimize.
[2024-05-28 08:34:58] [INFO ] Deduced a trap composed of 67 places in 791 ms of which 2 ms to minimize.
[2024-05-28 08:34:59] [INFO ] Deduced a trap composed of 41 places in 684 ms of which 1 ms to minimize.
[2024-05-28 08:35:00] [INFO ] Deduced a trap composed of 46 places in 645 ms of which 1 ms to minimize.
[2024-05-28 08:35:00] [INFO ] Deduced a trap composed of 16 places in 783 ms of which 2 ms to minimize.
[2024-05-28 08:35:01] [INFO ] Deduced a trap composed of 28 places in 680 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:35:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:35:01] [INFO ] After 25168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 18 ms.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 69 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 593/828 places, 1007/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 404250 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{0=1}
Probabilistic random walk after 404250 steps, saw 137547 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 08:35:05] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-28 08:35:05] [INFO ] Computed 17 invariants in 6 ms
[2024-05-28 08:35:05] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 08:35:05] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:35:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 08:35:06] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:35:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:35:06] [INFO ] After 418ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:35:07] [INFO ] Deduced a trap composed of 53 places in 499 ms of which 1 ms to minimize.
[2024-05-28 08:35:08] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 2 ms to minimize.
[2024-05-28 08:35:08] [INFO ] Deduced a trap composed of 65 places in 478 ms of which 2 ms to minimize.
[2024-05-28 08:35:09] [INFO ] Deduced a trap composed of 35 places in 368 ms of which 2 ms to minimize.
[2024-05-28 08:35:09] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 1 ms to minimize.
[2024-05-28 08:35:09] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 1 ms to minimize.
[2024-05-28 08:35:10] [INFO ] Deduced a trap composed of 55 places in 496 ms of which 1 ms to minimize.
[2024-05-28 08:35:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3526 ms
[2024-05-28 08:35:10] [INFO ] After 4230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 409 ms.
[2024-05-28 08:35:11] [INFO ] After 5554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 24 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 593/593 places, 1007/1007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 399434 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399434 steps, saw 137254 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 08:35:14] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:35:14] [INFO ] Invariant cache hit.
[2024-05-28 08:35:14] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 08:35:15] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:35:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-28 08:35:16] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:35:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:35:16] [INFO ] After 437ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:35:17] [INFO ] Deduced a trap composed of 13 places in 454 ms of which 1 ms to minimize.
[2024-05-28 08:35:18] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 2 ms to minimize.
[2024-05-28 08:35:18] [INFO ] Deduced a trap composed of 73 places in 433 ms of which 1 ms to minimize.
[2024-05-28 08:35:19] [INFO ] Deduced a trap composed of 16 places in 428 ms of which 1 ms to minimize.
[2024-05-28 08:35:19] [INFO ] Deduced a trap composed of 85 places in 415 ms of which 1 ms to minimize.
[2024-05-28 08:35:20] [INFO ] Deduced a trap composed of 38 places in 445 ms of which 1 ms to minimize.
[2024-05-28 08:35:20] [INFO ] Deduced a trap composed of 20 places in 433 ms of which 1 ms to minimize.
[2024-05-28 08:35:21] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 2 ms to minimize.
[2024-05-28 08:35:21] [INFO ] Deduced a trap composed of 18 places in 494 ms of which 1 ms to minimize.
[2024-05-28 08:35:22] [INFO ] Deduced a trap composed of 44 places in 421 ms of which 1 ms to minimize.
[2024-05-28 08:35:22] [INFO ] Deduced a trap composed of 32 places in 401 ms of which 2 ms to minimize.
[2024-05-28 08:35:23] [INFO ] Deduced a trap composed of 32 places in 512 ms of which 1 ms to minimize.
[2024-05-28 08:35:23] [INFO ] Deduced a trap composed of 32 places in 506 ms of which 1 ms to minimize.
[2024-05-28 08:35:24] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 1 ms to minimize.
[2024-05-28 08:35:24] [INFO ] Deduced a trap composed of 48 places in 431 ms of which 1 ms to minimize.
[2024-05-28 08:35:25] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 1 ms to minimize.
[2024-05-28 08:35:25] [INFO ] Deduced a trap composed of 69 places in 406 ms of which 1 ms to minimize.
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 60 places in 408 ms of which 1 ms to minimize.
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 58 places in 383 ms of which 1 ms to minimize.
[2024-05-28 08:35:27] [INFO ] Deduced a trap composed of 50 places in 399 ms of which 1 ms to minimize.
[2024-05-28 08:35:27] [INFO ] Deduced a trap composed of 86 places in 514 ms of which 2 ms to minimize.
[2024-05-28 08:35:28] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 2 ms to minimize.
[2024-05-28 08:35:28] [INFO ] Deduced a trap composed of 34 places in 451 ms of which 1 ms to minimize.
[2024-05-28 08:35:29] [INFO ] Deduced a trap composed of 78 places in 471 ms of which 1 ms to minimize.
[2024-05-28 08:35:29] [INFO ] Deduced a trap composed of 80 places in 458 ms of which 1 ms to minimize.
[2024-05-28 08:35:30] [INFO ] Deduced a trap composed of 89 places in 479 ms of which 1 ms to minimize.
[2024-05-28 08:35:31] [INFO ] Deduced a trap composed of 48 places in 501 ms of which 2 ms to minimize.
[2024-05-28 08:35:31] [INFO ] Deduced a trap composed of 62 places in 494 ms of which 1 ms to minimize.
[2024-05-28 08:35:32] [INFO ] Deduced a trap composed of 91 places in 495 ms of which 1 ms to minimize.
[2024-05-28 08:35:32] [INFO ] Deduced a trap composed of 54 places in 487 ms of which 1 ms to minimize.
[2024-05-28 08:35:33] [INFO ] Deduced a trap composed of 65 places in 480 ms of which 1 ms to minimize.
[2024-05-28 08:35:34] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 1 ms to minimize.
[2024-05-28 08:35:35] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 1 ms to minimize.
[2024-05-28 08:35:35] [INFO ] Deduced a trap composed of 54 places in 372 ms of which 1 ms to minimize.
[2024-05-28 08:35:36] [INFO ] Deduced a trap composed of 68 places in 374 ms of which 1 ms to minimize.
[2024-05-28 08:35:36] [INFO ] Deduced a trap composed of 54 places in 377 ms of which 1 ms to minimize.
[2024-05-28 08:35:36] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 0 ms to minimize.
[2024-05-28 08:35:37] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 1 ms to minimize.
[2024-05-28 08:35:37] [INFO ] Deduced a trap composed of 63 places in 287 ms of which 1 ms to minimize.
[2024-05-28 08:35:38] [INFO ] Deduced a trap composed of 50 places in 413 ms of which 1 ms to minimize.
[2024-05-28 08:35:38] [INFO ] Deduced a trap composed of 61 places in 415 ms of which 1 ms to minimize.
[2024-05-28 08:35:39] [INFO ] Deduced a trap composed of 101 places in 390 ms of which 1 ms to minimize.
[2024-05-28 08:35:39] [INFO ] Deduced a trap composed of 88 places in 322 ms of which 1 ms to minimize.
[2024-05-28 08:35:39] [INFO ] Deduced a trap composed of 79 places in 299 ms of which 0 ms to minimize.
[2024-05-28 08:35:40] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:35:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:35:40] [INFO ] After 25142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 23 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 21 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:35:40] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:35:40] [INFO ] Invariant cache hit.
[2024-05-28 08:35:40] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-28 08:35:40] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:35:40] [INFO ] Invariant cache hit.
[2024-05-28 08:35:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:35:43] [INFO ] Implicit Places using invariants and state equation in 2841 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
[2024-05-28 08:35:43] [INFO ] Redundant transitions in 191 ms returned []
[2024-05-28 08:35:43] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:35:43] [INFO ] Invariant cache hit.
[2024-05-28 08:35:45] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4797 ms. Remains : 593/593 places, 1007/1007 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 132 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-28 08:35:45] [INFO ] Computed 6 invariants in 3 ms
[2024-05-28 08:35:45] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 08:35:45] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:35:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 08:35:46] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:35:46] [INFO ] After 1177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 446 ms.
[2024-05-28 08:35:47] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 376 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-28 08:35:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-28 08:35:48] [INFO ] Computed 17 invariants in 7 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), true]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 438 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1 reset in 630 ms.
Product exploration explored 100000 steps with 0 reset in 534 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 828 transition count 1242
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 50 place count 828 transition count 1242
Deduced a syphon composed of 211 places in 2 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 211 place count 828 transition count 1242
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 286 place count 753 transition count 1167
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 361 place count 753 transition count 1167
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 385 place count 753 transition count 1167
Deduced a syphon composed of 160 places in 1 ms
Applied a total of 385 rules in 149 ms. Remains 753 /828 variables (removed 75) and now considering 1167/1242 (removed 75) transitions.
[2024-05-28 08:35:52] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-28 08:35:52] [INFO ] Flow matrix only has 1047 transitions (discarded 120 similar events)
// Phase 1: matrix 1047 rows 753 cols
[2024-05-28 08:35:52] [INFO ] Computed 17 invariants in 6 ms
[2024-05-28 08:35:53] [INFO ] Dead Transitions using invariants and state equation in 1358 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/828 places, 1167/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1544 ms. Remains : 753/828 places, 1167/1242 transitions.
Built C files in :
/tmp/ltsmin14879867608201250074
[2024-05-28 08:35:53] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14879867608201250074
Running compilation step : cd /tmp/ltsmin14879867608201250074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14879867608201250074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14879867608201250074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:35:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-28 08:35:56] [INFO ] Computed 17 invariants in 6 ms
[2024-05-28 08:35:57] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-28 08:35:57] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:35:57] [INFO ] Invariant cache hit.
[2024-05-28 08:35:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:36:00] [INFO ] Implicit Places using invariants and state equation in 3540 ms returned []
Implicit Place search using SMT with State Equation took 4036 ms to find 0 implicit places.
[2024-05-28 08:36:00] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:36:00] [INFO ] Invariant cache hit.
[2024-05-28 08:36:02] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5471 ms. Remains : 828/828 places, 1242/1242 transitions.
Built C files in :
/tmp/ltsmin9857737915617660956
[2024-05-28 08:36:02] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9857737915617660956
Running compilation step : cd /tmp/ltsmin9857737915617660956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9857737915617660956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9857737915617660956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-28 08:36:05] [INFO ] Flatten gal took : 105 ms
[2024-05-28 08:36:05] [INFO ] Flatten gal took : 76 ms
[2024-05-28 08:36:05] [INFO ] Time to serialize gal into /tmp/LTL18381518377723945270.gal : 11 ms
[2024-05-28 08:36:05] [INFO ] Time to serialize properties into /tmp/LTL13298756652248530653.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18381518377723945270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2775645353954161508.hoa' '-atoms' '/tmp/LTL13298756652248530653.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13298756652248530653.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2775645353954161508.hoa
Detected timeout of ITS tools.
[2024-05-28 08:36:21] [INFO ] Flatten gal took : 90 ms
[2024-05-28 08:36:21] [INFO ] Flatten gal took : 78 ms
[2024-05-28 08:36:21] [INFO ] Time to serialize gal into /tmp/LTL6679792917859601857.gal : 14 ms
[2024-05-28 08:36:21] [INFO ] Time to serialize properties into /tmp/LTL6495677881541749609.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6679792917859601857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6495677881541749609.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75...4967
Formula 0 simplified : XXG((G"(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75>=1)||(...4950
Detected timeout of ITS tools.
[2024-05-28 08:36:36] [INFO ] Flatten gal took : 46 ms
[2024-05-28 08:36:36] [INFO ] Applying decomposition
[2024-05-28 08:36:36] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17946384514354163896.txt' '-o' '/tmp/graph17946384514354163896.bin' '-w' '/tmp/graph17946384514354163896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17946384514354163896.bin' '-l' '-1' '-v' '-w' '/tmp/graph17946384514354163896.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:36:36] [INFO ] Decomposing Gal with order
[2024-05-28 08:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:36:36] [INFO ] Removed a total of 1038 redundant transitions.
[2024-05-28 08:36:36] [INFO ] Flatten gal took : 163 ms
[2024-05-28 08:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-28 08:36:36] [INFO ] Time to serialize gal into /tmp/LTL12577867446920729112.gal : 30 ms
[2024-05-28 08:36:36] [INFO ] Time to serialize properties into /tmp/LTL16810046912344440457.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12577867446920729112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16810046912344440457.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((i24.u190.TestIdentity_67>=1)||(i1.i0.i1.u147.TestIdentity_2>=1))||((i30.u220.TestIdentity_128>=1)||(i7.u187.T...6883
Formula 0 simplified : XXG((G"(((((((((i24.u190.TestIdentity_67>=1)||(i1.i0.i1.u147.TestIdentity_2>=1))||((i30.u220.TestIdentity_128>=1)||(i7.u187.TestIden...6866
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin708024082248267436
[2024-05-28 08:36:52] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin708024082248267436
Running compilation step : cd /tmp/ltsmin708024082248267436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin708024082248267436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin708024082248267436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 222897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1)||(F(G(p3))&&p2))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 31 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:36:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-28 08:36:55] [INFO ] Computed 23 invariants in 5 ms
[2024-05-28 08:36:55] [INFO ] Implicit Places using invariants in 596 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 599 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 645 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p2), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s313 1)) (OR (LT s1 1) (LT s312 1)) (OR (LT s9 1) (LT s316 1)) (OR (LT s11 1) (LT s317 1)) (OR (LT s5 1) (LT s314 1)) (OR (LT s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 106 reset in 458 ms.
Product exploration explored 100000 steps with 111 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 166 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 411 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (NOT p1)), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p0) (NOT p3)))]
Knowledge based reduction with 14 factoid took 244 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 192 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 828 transition count 1117
Reduce places removed 125 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 155 rules applied. Total rules applied 280 place count 703 transition count 1087
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 310 place count 673 transition count 1087
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 174 Pre rules applied. Total rules applied 310 place count 673 transition count 913
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 658 place count 499 transition count 913
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 708 place count 474 transition count 888
Applied a total of 708 rules in 78 ms. Remains 474 /828 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
[2024-05-28 08:36:58] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 474 cols
[2024-05-28 08:36:58] [INFO ] Computed 17 invariants in 4 ms
[2024-05-28 08:36:58] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-28 08:36:58] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-28 08:36:58] [INFO ] Invariant cache hit.
[2024-05-28 08:36:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:36:59] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2024-05-28 08:36:59] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 08:36:59] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-28 08:36:59] [INFO ] Invariant cache hit.
[2024-05-28 08:37:00] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 474/828 places, 888/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2513 ms. Remains : 474/828 places, 888/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 149 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (NOT p1)), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 10 factoid took 377 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 208 reset in 584 ms.
Stack based approach found an accepted trace after 9999 steps with 22 reset with depth 279 and stack size 274 in 57 ms.
FORMULA Peterson-COL-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-03 finished in 7299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 18 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:37:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-28 08:37:02] [INFO ] Computed 23 invariants in 7 ms
[2024-05-28 08:37:03] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-28 08:37:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:37:03] [INFO ] Invariant cache hit.
[2024-05-28 08:37:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:37:07] [INFO ] Implicit Places using invariants and state equation in 3979 ms returned []
Implicit Place search using SMT with State Equation took 4615 ms to find 0 implicit places.
[2024-05-28 08:37:07] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:37:07] [INFO ] Invariant cache hit.
[2024-05-28 08:37:08] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6256 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s1 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s10 1)) (AND...], 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]]
Product exploration explored 100000 steps with 50000 reset in 1192 ms.
Product exploration explored 100000 steps with 50000 reset in 1001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-04 finished in 8649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:37:11] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:37:11] [INFO ] Invariant cache hit.
[2024-05-28 08:37:11] [INFO ] Implicit Places using invariants in 575 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 577 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 603 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-07 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:(OR (GEQ s255 1) (GEQ s125 1) (GEQ s186 1) (GEQ s129 1) (GEQ s251 1) (GEQ s190 1) (GEQ s133 1) (GEQ s263 1) (GEQ s194 1) (GEQ s137 1) (GEQ s259 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-07 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 834 transition count 1082
Reduce places removed 160 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 310 rules applied. Total rules applied 470 place count 674 transition count 932
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 620 place count 524 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 620 place count 524 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 740 place count 464 transition count 872
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 790 place count 439 transition count 847
Applied a total of 790 rules in 61 ms. Remains 439 /834 variables (removed 395) and now considering 847/1242 (removed 395) transitions.
[2024-05-28 08:37:11] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2024-05-28 08:37:11] [INFO ] Computed 23 invariants in 3 ms
[2024-05-28 08:37:12] [INFO ] Implicit Places using invariants in 550 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 551 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/834 places, 847/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 629 ms. Remains : 433/834 places, 847/1242 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s361 1) (GEQ s418 1) (GEQ s307 1) (GEQ s310 1) (GEQ s364 1) (GEQ s415 1) (GEQ s412 1) (GEQ s300 1) (GEQ s354 1) (GEQ s408 1) (GEQ s303 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3274 reset in 1062 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-10 finished in 1749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||X((F(p2)||p1)))))'
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:37:13] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-28 08:37:13] [INFO ] Computed 23 invariants in 5 ms
[2024-05-28 08:37:13] [INFO ] Implicit Places using invariants in 352 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 354 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s318 1) (LT s448 1) (LT s380 1) (LT s442 1) (LT s392 1) (LT s454 1) (LT s386 1) (LT s324 1) (LT s398 1) (LT s336 1) (LT s330 1) (LT s460 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1503 ms.
Product exploration explored 100000 steps with 33333 reset in 1280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-11 finished in 3469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
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 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 29 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2024-05-28 08:37:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2024-05-28 08:37:17] [INFO ] Computed 23 invariants in 2 ms
[2024-05-28 08:37:17] [INFO ] Implicit Places using invariants in 255 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 257 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s35 1) (LT s75 1)) (OR (LT s18 1) (LT s48 1)) (OR (LT s39 1) (LT s66 1)) (OR (LT s24 1) (LT s49 1)) (OR (LT s38 1) (LT s61 1)) (OR (LT s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-13 finished in 895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((!p0 U !p1)))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:37:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-28 08:37:17] [INFO ] Computed 23 invariants in 11 ms
[2024-05-28 08:37:18] [INFO ] Implicit Places using invariants in 440 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 442 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 460 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s255 1) (GEQ s125 1) (GEQ s186 1) (GEQ s129 1) (GEQ s251 1) (GEQ s190 1) (GEQ s133 1) (GEQ s263 1) (GEQ s194 1) (GEQ s137 1) (GEQ s259 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 119 reset in 1246 ms.
Stack based approach found an accepted trace after 437 steps with 0 reset with depth 438 and stack size 438 in 5 ms.
FORMULA Peterson-COL-5-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-14 finished in 1897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(((p2 U G(p3))||p1))&&p0))))'
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-28 08:37:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-28 08:37:19] [INFO ] Invariant cache hit.
[2024-05-28 08:37:20] [INFO ] Implicit Places using invariants in 360 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 362 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s743 1) (LT s809 1) (LT s677 1) (LT s683 1) (LT s671 1) (LT s803 1) (LT s797 1) (LT s737 1) (LT s695 1) (LT s761 1) (LT s827 1) (LT s821 1) (L...], 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 2399 reset in 2016 ms.
Product exploration explored 100000 steps with 2374 reset in 1268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 08:37:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-28 08:37:24] [INFO ] Computed 17 invariants in 6 ms
[2024-05-28 08:37:24] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 08:37:24] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:37:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 08:37:25] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:37:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:37:25] [INFO ] After 112ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:37:25] [INFO ] Deduced a trap composed of 32 places in 405 ms of which 2 ms to minimize.
[2024-05-28 08:37:26] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 1 ms to minimize.
[2024-05-28 08:37:26] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 1 ms to minimize.
[2024-05-28 08:37:27] [INFO ] Deduced a trap composed of 28 places in 489 ms of which 1 ms to minimize.
[2024-05-28 08:37:28] [INFO ] Deduced a trap composed of 89 places in 581 ms of which 2 ms to minimize.
[2024-05-28 08:37:28] [INFO ] Deduced a trap composed of 63 places in 541 ms of which 1 ms to minimize.
[2024-05-28 08:37:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3337 ms
[2024-05-28 08:37:28] [INFO ] After 3530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-28 08:37:28] [INFO ] After 4485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 30 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 828 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 478 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 478 transition count 707
Deduced a syphon composed of 185 places in 0 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 293 transition count 707
Applied a total of 1070 rules in 44 ms. Remains 293 /828 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 293/828 places, 707/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 6 ms. (steps per millisecond=10 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 6 ms. (steps per millisecond=10 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT p0)), (F (AND (NOT p1) p3)), (F (NOT (AND (NOT p1) p0 (NOT p3))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 406 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-15 finished in 9664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(!p0) U p1)&&X(G(!p1)))))))'
Found a Shortening insensitive property : Peterson-COL-5-LTLFireability-02
Stuttering acceptance computed with spot in 415 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 834 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 759 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 759 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 599 transition count 1007
Applied a total of 470 rules in 51 ms. Remains 599 /834 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
[2024-05-28 08:37:30] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 599 cols
[2024-05-28 08:37:30] [INFO ] Computed 23 invariants in 5 ms
[2024-05-28 08:37:30] [INFO ] Implicit Places using invariants in 547 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 558 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 593/834 places, 1007/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 626 ms. Remains : 593/834 places, 1007/1242 transitions.
Running random walk in product with property : Peterson-COL-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s517 1) (GEQ s574 1) (GEQ s462 1) (GEQ s467 1) (GEQ s457 1) (GEQ s568 1) (GEQ s562 1) (GEQ s512 1) (GEQ s477 1) (GEQ s532 1) (GEQ s592 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 616 ms.
Product exploration explored 100000 steps with 2 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 08:37:32] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-28 08:37:32] [INFO ] Computed 17 invariants in 2 ms
[2024-05-28 08:37:33] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-28 08:37:33] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 08:37:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 08:37:34] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 08:37:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:37:35] [INFO ] After 501ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 08:37:35] [INFO ] Deduced a trap composed of 26 places in 458 ms of which 1 ms to minimize.
[2024-05-28 08:37:36] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 1 ms to minimize.
[2024-05-28 08:37:36] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 1 ms to minimize.
[2024-05-28 08:37:37] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 1 ms to minimize.
[2024-05-28 08:37:37] [INFO ] Deduced a trap composed of 40 places in 466 ms of which 1 ms to minimize.
[2024-05-28 08:37:38] [INFO ] Deduced a trap composed of 34 places in 477 ms of which 1 ms to minimize.
[2024-05-28 08:37:38] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 1 ms to minimize.
[2024-05-28 08:37:39] [INFO ] Deduced a trap composed of 29 places in 489 ms of which 1 ms to minimize.
[2024-05-28 08:37:40] [INFO ] Deduced a trap composed of 47 places in 455 ms of which 0 ms to minimize.
[2024-05-28 08:37:40] [INFO ] Deduced a trap composed of 47 places in 484 ms of which 1 ms to minimize.
[2024-05-28 08:37:41] [INFO ] Deduced a trap composed of 65 places in 448 ms of which 2 ms to minimize.
[2024-05-28 08:37:41] [INFO ] Deduced a trap composed of 65 places in 496 ms of which 1 ms to minimize.
[2024-05-28 08:37:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6456 ms
[2024-05-28 08:37:42] [INFO ] Deduced a trap composed of 52 places in 533 ms of which 2 ms to minimize.
[2024-05-28 08:37:43] [INFO ] Deduced a trap composed of 66 places in 544 ms of which 1 ms to minimize.
[2024-05-28 08:37:43] [INFO ] Deduced a trap composed of 11 places in 530 ms of which 1 ms to minimize.
[2024-05-28 08:37:44] [INFO ] Deduced a trap composed of 56 places in 442 ms of which 1 ms to minimize.
[2024-05-28 08:37:44] [INFO ] Deduced a trap composed of 101 places in 431 ms of which 1 ms to minimize.
[2024-05-28 08:37:45] [INFO ] Deduced a trap composed of 63 places in 440 ms of which 2 ms to minimize.
[2024-05-28 08:37:45] [INFO ] Deduced a trap composed of 47 places in 417 ms of which 1 ms to minimize.
[2024-05-28 08:37:46] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 1 ms to minimize.
[2024-05-28 08:37:46] [INFO ] Deduced a trap composed of 25 places in 432 ms of which 1 ms to minimize.
[2024-05-28 08:37:47] [INFO ] Deduced a trap composed of 11 places in 523 ms of which 1 ms to minimize.
[2024-05-28 08:37:47] [INFO ] Deduced a trap composed of 50 places in 447 ms of which 1 ms to minimize.
[2024-05-28 08:37:48] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 1 ms to minimize.
[2024-05-28 08:37:48] [INFO ] Deduced a trap composed of 85 places in 418 ms of which 1 ms to minimize.
[2024-05-28 08:37:49] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 2 ms to minimize.
[2024-05-28 08:37:49] [INFO ] Deduced a trap composed of 61 places in 494 ms of which 1 ms to minimize.
[2024-05-28 08:37:50] [INFO ] Deduced a trap composed of 56 places in 419 ms of which 1 ms to minimize.
[2024-05-28 08:37:50] [INFO ] Deduced a trap composed of 44 places in 494 ms of which 1 ms to minimize.
[2024-05-28 08:37:51] [INFO ] Deduced a trap composed of 44 places in 456 ms of which 1 ms to minimize.
[2024-05-28 08:37:51] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 1 ms to minimize.
[2024-05-28 08:37:52] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2024-05-28 08:37:53] [INFO ] Deduced a trap composed of 80 places in 502 ms of which 1 ms to minimize.
[2024-05-28 08:37:53] [INFO ] Deduced a trap composed of 32 places in 449 ms of which 1 ms to minimize.
[2024-05-28 08:37:54] [INFO ] Deduced a trap composed of 63 places in 440 ms of which 1 ms to minimize.
[2024-05-28 08:37:54] [INFO ] Deduced a trap composed of 38 places in 451 ms of which 1 ms to minimize.
[2024-05-28 08:37:55] [INFO ] Deduced a trap composed of 66 places in 454 ms of which 1 ms to minimize.
[2024-05-28 08:37:55] [INFO ] Deduced a trap composed of 43 places in 476 ms of which 1 ms to minimize.
[2024-05-28 08:37:56] [INFO ] Deduced a trap composed of 77 places in 395 ms of which 1 ms to minimize.
[2024-05-28 08:37:56] [INFO ] Deduced a trap composed of 59 places in 366 ms of which 1 ms to minimize.
[2024-05-28 08:37:56] [INFO ] Deduced a trap composed of 94 places in 360 ms of which 1 ms to minimize.
[2024-05-28 08:37:57] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 1 ms to minimize.
[2024-05-28 08:37:58] [INFO ] Deduced a trap composed of 79 places in 454 ms of which 2 ms to minimize.
[2024-05-28 08:37:58] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:37:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:37:58] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 13 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 593/593 places, 1007/1007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 436289 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{0=1}
Probabilistic random walk after 436289 steps, saw 142513 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 08:38:02] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:38:02] [INFO ] Invariant cache hit.
[2024-05-28 08:38:02] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 08:38:03] [INFO ] After 1034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:38:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 08:38:04] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:38:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:38:04] [INFO ] After 423ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:38:05] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 2 ms to minimize.
[2024-05-28 08:38:05] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 1 ms to minimize.
[2024-05-28 08:38:05] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 1 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 16 places in 376 ms of which 1 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 85 places in 245 ms of which 1 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 0 ms to minimize.
[2024-05-28 08:38:07] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 1 ms to minimize.
[2024-05-28 08:38:07] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 1 ms to minimize.
[2024-05-28 08:38:08] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 0 ms to minimize.
[2024-05-28 08:38:08] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 1 ms to minimize.
[2024-05-28 08:38:08] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 1 ms to minimize.
[2024-05-28 08:38:09] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 1 ms to minimize.
[2024-05-28 08:38:09] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 1 ms to minimize.
[2024-05-28 08:38:10] [INFO ] Deduced a trap composed of 57 places in 315 ms of which 0 ms to minimize.
[2024-05-28 08:38:10] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 2 ms to minimize.
[2024-05-28 08:38:11] [INFO ] Deduced a trap composed of 77 places in 427 ms of which 1 ms to minimize.
[2024-05-28 08:38:11] [INFO ] Deduced a trap composed of 69 places in 445 ms of which 1 ms to minimize.
[2024-05-28 08:38:12] [INFO ] Deduced a trap composed of 60 places in 448 ms of which 2 ms to minimize.
[2024-05-28 08:38:12] [INFO ] Deduced a trap composed of 58 places in 445 ms of which 1 ms to minimize.
[2024-05-28 08:38:13] [INFO ] Deduced a trap composed of 50 places in 431 ms of which 1 ms to minimize.
[2024-05-28 08:38:13] [INFO ] Deduced a trap composed of 86 places in 367 ms of which 1 ms to minimize.
[2024-05-28 08:38:13] [INFO ] Deduced a trap composed of 16 places in 377 ms of which 2 ms to minimize.
[2024-05-28 08:38:14] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 2 ms to minimize.
[2024-05-28 08:38:14] [INFO ] Deduced a trap composed of 78 places in 450 ms of which 2 ms to minimize.
[2024-05-28 08:38:15] [INFO ] Deduced a trap composed of 80 places in 450 ms of which 1 ms to minimize.
[2024-05-28 08:38:15] [INFO ] Deduced a trap composed of 89 places in 339 ms of which 2 ms to minimize.
[2024-05-28 08:38:16] [INFO ] Deduced a trap composed of 48 places in 453 ms of which 1 ms to minimize.
[2024-05-28 08:38:16] [INFO ] Deduced a trap composed of 62 places in 453 ms of which 1 ms to minimize.
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 91 places in 405 ms of which 1 ms to minimize.
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 54 places in 417 ms of which 1 ms to minimize.
[2024-05-28 08:38:18] [INFO ] Deduced a trap composed of 65 places in 338 ms of which 1 ms to minimize.
[2024-05-28 08:38:19] [INFO ] Deduced a trap composed of 29 places in 533 ms of which 1 ms to minimize.
[2024-05-28 08:38:19] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 0 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 54 places in 283 ms of which 1 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 1 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 1 ms to minimize.
[2024-05-28 08:38:21] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 0 ms to minimize.
[2024-05-28 08:38:21] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 1 ms to minimize.
[2024-05-28 08:38:21] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 1 ms to minimize.
[2024-05-28 08:38:22] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 1 ms to minimize.
[2024-05-28 08:38:22] [INFO ] Deduced a trap composed of 61 places in 349 ms of which 0 ms to minimize.
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 101 places in 307 ms of which 1 ms to minimize.
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 88 places in 200 ms of which 1 ms to minimize.
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 0 ms to minimize.
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 0 ms to minimize.
[2024-05-28 08:38:24] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 0 ms to minimize.
[2024-05-28 08:38:24] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2024-05-28 08:38:25] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 0 ms to minimize.
[2024-05-28 08:38:26] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 1 ms to minimize.
[2024-05-28 08:38:27] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 23036 ms
[2024-05-28 08:38:27] [INFO ] After 23803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 229 ms.
[2024-05-28 08:38:28] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 19 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 593/593 places, 1007/1007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423374 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423374 steps, saw 140223 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 08:38:31] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:38:31] [INFO ] Invariant cache hit.
[2024-05-28 08:38:31] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 08:38:32] [INFO ] After 764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:38:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 08:38:33] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:38:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:38:33] [INFO ] After 461ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:38:34] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2024-05-28 08:38:34] [INFO ] Deduced a trap composed of 35 places in 375 ms of which 1 ms to minimize.
[2024-05-28 08:38:35] [INFO ] Deduced a trap composed of 73 places in 365 ms of which 1 ms to minimize.
[2024-05-28 08:38:35] [INFO ] Deduced a trap composed of 16 places in 367 ms of which 1 ms to minimize.
[2024-05-28 08:38:36] [INFO ] Deduced a trap composed of 85 places in 437 ms of which 1 ms to minimize.
[2024-05-28 08:38:36] [INFO ] Deduced a trap composed of 38 places in 431 ms of which 1 ms to minimize.
[2024-05-28 08:38:37] [INFO ] Deduced a trap composed of 20 places in 442 ms of which 1 ms to minimize.
[2024-05-28 08:38:37] [INFO ] Deduced a trap composed of 17 places in 427 ms of which 1 ms to minimize.
[2024-05-28 08:38:38] [INFO ] Deduced a trap composed of 18 places in 460 ms of which 1 ms to minimize.
[2024-05-28 08:38:38] [INFO ] Deduced a trap composed of 44 places in 401 ms of which 1 ms to minimize.
[2024-05-28 08:38:39] [INFO ] Deduced a trap composed of 32 places in 410 ms of which 1 ms to minimize.
[2024-05-28 08:38:39] [INFO ] Deduced a trap composed of 32 places in 513 ms of which 1 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 1 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 57 places in 457 ms of which 1 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 48 places in 466 ms of which 1 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 77 places in 404 ms of which 1 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 69 places in 442 ms of which 1 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 60 places in 347 ms of which 0 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 58 places in 427 ms of which 1 ms to minimize.
[2024-05-28 08:38:43] [INFO ] Deduced a trap composed of 50 places in 422 ms of which 1 ms to minimize.
[2024-05-28 08:38:44] [INFO ] Deduced a trap composed of 86 places in 355 ms of which 0 ms to minimize.
[2024-05-28 08:38:44] [INFO ] Deduced a trap composed of 16 places in 345 ms of which 1 ms to minimize.
[2024-05-28 08:38:44] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 1 ms to minimize.
[2024-05-28 08:38:45] [INFO ] Deduced a trap composed of 78 places in 269 ms of which 0 ms to minimize.
[2024-05-28 08:38:45] [INFO ] Deduced a trap composed of 80 places in 308 ms of which 0 ms to minimize.
[2024-05-28 08:38:45] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 1 ms to minimize.
[2024-05-28 08:38:46] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 1 ms to minimize.
[2024-05-28 08:38:46] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 1 ms to minimize.
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 91 places in 454 ms of which 1 ms to minimize.
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 54 places in 432 ms of which 1 ms to minimize.
[2024-05-28 08:38:48] [INFO ] Deduced a trap composed of 65 places in 479 ms of which 1 ms to minimize.
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 2 ms to minimize.
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 33 places in 437 ms of which 1 ms to minimize.
[2024-05-28 08:38:50] [INFO ] Deduced a trap composed of 54 places in 359 ms of which 1 ms to minimize.
[2024-05-28 08:38:50] [INFO ] Deduced a trap composed of 68 places in 362 ms of which 1 ms to minimize.
[2024-05-28 08:38:51] [INFO ] Deduced a trap composed of 54 places in 359 ms of which 1 ms to minimize.
[2024-05-28 08:38:51] [INFO ] Deduced a trap composed of 68 places in 272 ms of which 1 ms to minimize.
[2024-05-28 08:38:52] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 0 ms to minimize.
[2024-05-28 08:38:52] [INFO ] Deduced a trap composed of 63 places in 291 ms of which 1 ms to minimize.
[2024-05-28 08:38:53] [INFO ] Deduced a trap composed of 50 places in 439 ms of which 1 ms to minimize.
[2024-05-28 08:38:53] [INFO ] Deduced a trap composed of 61 places in 407 ms of which 1 ms to minimize.
[2024-05-28 08:38:54] [INFO ] Deduced a trap composed of 101 places in 424 ms of which 1 ms to minimize.
[2024-05-28 08:38:54] [INFO ] Deduced a trap composed of 88 places in 280 ms of which 1 ms to minimize.
[2024-05-28 08:38:54] [INFO ] Deduced a trap composed of 79 places in 309 ms of which 0 ms to minimize.
[2024-05-28 08:38:55] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 1 ms to minimize.
[2024-05-28 08:38:55] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 1 ms to minimize.
[2024-05-28 08:38:56] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 1 ms to minimize.
[2024-05-28 08:38:56] [INFO ] Deduced a trap composed of 68 places in 418 ms of which 1 ms to minimize.
[2024-05-28 08:38:57] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 23205 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:38:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:38:57] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 21 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 19 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:38:57] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:38:57] [INFO ] Invariant cache hit.
[2024-05-28 08:38:57] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-28 08:38:57] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:38:57] [INFO ] Invariant cache hit.
[2024-05-28 08:38:58] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:39:00] [INFO ] Implicit Places using invariants and state equation in 2581 ms returned []
Implicit Place search using SMT with State Equation took 3102 ms to find 0 implicit places.
[2024-05-28 08:39:00] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-28 08:39:00] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:00] [INFO ] Invariant cache hit.
[2024-05-28 08:39:01] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4156 ms. Remains : 593/593 places, 1007/1007 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 94 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-28 08:39:01] [INFO ] Computed 6 invariants in 2 ms
[2024-05-28 08:39:01] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 08:39:01] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:39:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-28 08:39:02] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:39:02] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 312 ms.
[2024-05-28 08:39:03] [INFO ] After 1286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 340 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-28 08:39:03] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-28 08:39:03] [INFO ] Computed 17 invariants in 5 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), true]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 6 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:39:05] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:05] [INFO ] Invariant cache hit.
[2024-05-28 08:39:05] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-28 08:39:05] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:05] [INFO ] Invariant cache hit.
[2024-05-28 08:39:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:39:08] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 3052 ms to find 0 implicit places.
[2024-05-28 08:39:08] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:08] [INFO ] Invariant cache hit.
[2024-05-28 08:39:09] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3931 ms. Remains : 593/593 places, 1007/1007 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 08:39:10] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:10] [INFO ] Invariant cache hit.
[2024-05-28 08:39:10] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 08:39:10] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 08:39:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 08:39:11] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 08:39:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:39:11] [INFO ] After 541ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 08:39:12] [INFO ] Deduced a trap composed of 90 places in 513 ms of which 4 ms to minimize.
[2024-05-28 08:39:12] [INFO ] Deduced a trap composed of 70 places in 324 ms of which 1 ms to minimize.
[2024-05-28 08:39:13] [INFO ] Deduced a trap composed of 95 places in 436 ms of which 1 ms to minimize.
[2024-05-28 08:39:13] [INFO ] Deduced a trap composed of 96 places in 327 ms of which 1 ms to minimize.
[2024-05-28 08:39:14] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2024-05-28 08:39:14] [INFO ] Deduced a trap composed of 50 places in 318 ms of which 0 ms to minimize.
[2024-05-28 08:39:15] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 1 ms to minimize.
[2024-05-28 08:39:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3034 ms
[2024-05-28 08:39:15] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 1 ms to minimize.
[2024-05-28 08:39:16] [INFO ] Deduced a trap composed of 26 places in 456 ms of which 1 ms to minimize.
[2024-05-28 08:39:16] [INFO ] Deduced a trap composed of 11 places in 442 ms of which 1 ms to minimize.
[2024-05-28 08:39:17] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 1 ms to minimize.
[2024-05-28 08:39:17] [INFO ] Deduced a trap composed of 34 places in 453 ms of which 1 ms to minimize.
[2024-05-28 08:39:18] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 1 ms to minimize.
[2024-05-28 08:39:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3128 ms
[2024-05-28 08:39:18] [INFO ] After 7028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 473 ms.
[2024-05-28 08:39:18] [INFO ] After 8562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 18 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 593/593 places, 1007/1007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 414918 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{0=1}
Probabilistic random walk after 414918 steps, saw 139051 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-28 08:39:22] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:22] [INFO ] Invariant cache hit.
[2024-05-28 08:39:22] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 08:39:23] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:39:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 08:39:24] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:39:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:39:24] [INFO ] After 502ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:39:25] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2024-05-28 08:39:25] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 1 ms to minimize.
[2024-05-28 08:39:26] [INFO ] Deduced a trap composed of 73 places in 309 ms of which 1 ms to minimize.
[2024-05-28 08:39:26] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 1 ms to minimize.
[2024-05-28 08:39:27] [INFO ] Deduced a trap composed of 85 places in 325 ms of which 1 ms to minimize.
[2024-05-28 08:39:27] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 0 ms to minimize.
[2024-05-28 08:39:27] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2024-05-28 08:39:28] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 0 ms to minimize.
[2024-05-28 08:39:28] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2024-05-28 08:39:28] [INFO ] Deduced a trap composed of 44 places in 359 ms of which 1 ms to minimize.
[2024-05-28 08:39:29] [INFO ] Deduced a trap composed of 32 places in 345 ms of which 1 ms to minimize.
[2024-05-28 08:39:29] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 1 ms to minimize.
[2024-05-28 08:39:30] [INFO ] Deduced a trap composed of 32 places in 451 ms of which 1 ms to minimize.
[2024-05-28 08:39:30] [INFO ] Deduced a trap composed of 57 places in 409 ms of which 1 ms to minimize.
[2024-05-28 08:39:31] [INFO ] Deduced a trap composed of 48 places in 405 ms of which 1 ms to minimize.
[2024-05-28 08:39:31] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 1 ms to minimize.
[2024-05-28 08:39:32] [INFO ] Deduced a trap composed of 69 places in 405 ms of which 1 ms to minimize.
[2024-05-28 08:39:32] [INFO ] Deduced a trap composed of 60 places in 406 ms of which 1 ms to minimize.
[2024-05-28 08:39:33] [INFO ] Deduced a trap composed of 58 places in 410 ms of which 1 ms to minimize.
[2024-05-28 08:39:33] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 1 ms to minimize.
[2024-05-28 08:39:34] [INFO ] Deduced a trap composed of 86 places in 457 ms of which 1 ms to minimize.
[2024-05-28 08:39:34] [INFO ] Deduced a trap composed of 16 places in 440 ms of which 1 ms to minimize.
[2024-05-28 08:39:35] [INFO ] Deduced a trap composed of 34 places in 405 ms of which 1 ms to minimize.
[2024-05-28 08:39:35] [INFO ] Deduced a trap composed of 78 places in 411 ms of which 1 ms to minimize.
[2024-05-28 08:39:36] [INFO ] Deduced a trap composed of 80 places in 410 ms of which 1 ms to minimize.
[2024-05-28 08:39:36] [INFO ] Deduced a trap composed of 89 places in 425 ms of which 1 ms to minimize.
[2024-05-28 08:39:37] [INFO ] Deduced a trap composed of 48 places in 431 ms of which 1 ms to minimize.
[2024-05-28 08:39:37] [INFO ] Deduced a trap composed of 62 places in 425 ms of which 1 ms to minimize.
[2024-05-28 08:39:38] [INFO ] Deduced a trap composed of 91 places in 426 ms of which 1 ms to minimize.
[2024-05-28 08:39:38] [INFO ] Deduced a trap composed of 54 places in 420 ms of which 1 ms to minimize.
[2024-05-28 08:39:39] [INFO ] Deduced a trap composed of 65 places in 415 ms of which 1 ms to minimize.
[2024-05-28 08:39:40] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 1 ms to minimize.
[2024-05-28 08:39:40] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 1 ms to minimize.
[2024-05-28 08:39:40] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 1 ms to minimize.
[2024-05-28 08:39:41] [INFO ] Deduced a trap composed of 68 places in 346 ms of which 1 ms to minimize.
[2024-05-28 08:39:41] [INFO ] Deduced a trap composed of 54 places in 335 ms of which 1 ms to minimize.
[2024-05-28 08:39:42] [INFO ] Deduced a trap composed of 68 places in 288 ms of which 1 ms to minimize.
[2024-05-28 08:39:42] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 1 ms to minimize.
[2024-05-28 08:39:42] [INFO ] Deduced a trap composed of 63 places in 264 ms of which 1 ms to minimize.
[2024-05-28 08:39:43] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 1 ms to minimize.
[2024-05-28 08:39:43] [INFO ] Deduced a trap composed of 61 places in 421 ms of which 1 ms to minimize.
[2024-05-28 08:39:44] [INFO ] Deduced a trap composed of 101 places in 364 ms of which 1 ms to minimize.
[2024-05-28 08:39:44] [INFO ] Deduced a trap composed of 88 places in 266 ms of which 0 ms to minimize.
[2024-05-28 08:39:44] [INFO ] Deduced a trap composed of 79 places in 307 ms of which 1 ms to minimize.
[2024-05-28 08:39:45] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 1 ms to minimize.
[2024-05-28 08:39:45] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 1 ms to minimize.
[2024-05-28 08:39:45] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 1 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 68 places in 441 ms of which 1 ms to minimize.
[2024-05-28 08:39:48] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 1 ms to minimize.
[2024-05-28 08:39:48] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 23347 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:39:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:39:48] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 11 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 593/593 places, 1007/1007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 431627 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431627 steps, saw 141332 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 08:39:51] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:39:51] [INFO ] Invariant cache hit.
[2024-05-28 08:39:51] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 08:39:52] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:39:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 08:39:53] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:39:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:39:53] [INFO ] After 305ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 08:39:54] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 0 ms to minimize.
[2024-05-28 08:39:54] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2024-05-28 08:39:54] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 1 ms to minimize.
[2024-05-28 08:39:55] [INFO ] Deduced a trap composed of 16 places in 392 ms of which 1 ms to minimize.
[2024-05-28 08:39:55] [INFO ] Deduced a trap composed of 85 places in 371 ms of which 1 ms to minimize.
[2024-05-28 08:39:56] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 0 ms to minimize.
[2024-05-28 08:39:56] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 1 ms to minimize.
[2024-05-28 08:39:57] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 1 ms to minimize.
[2024-05-28 08:39:57] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 1 ms to minimize.
[2024-05-28 08:39:57] [INFO ] Deduced a trap composed of 44 places in 352 ms of which 1 ms to minimize.
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 1 ms to minimize.
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 1 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 1 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 57 places in 384 ms of which 1 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 48 places in 412 ms of which 1 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 77 places in 383 ms of which 0 ms to minimize.
[2024-05-28 08:40:01] [INFO ] Deduced a trap composed of 69 places in 377 ms of which 1 ms to minimize.
[2024-05-28 08:40:01] [INFO ] Deduced a trap composed of 60 places in 381 ms of which 1 ms to minimize.
[2024-05-28 08:40:02] [INFO ] Deduced a trap composed of 58 places in 386 ms of which 1 ms to minimize.
[2024-05-28 08:40:02] [INFO ] Deduced a trap composed of 50 places in 410 ms of which 1 ms to minimize.
[2024-05-28 08:40:03] [INFO ] Deduced a trap composed of 86 places in 524 ms of which 2 ms to minimize.
[2024-05-28 08:40:03] [INFO ] Deduced a trap composed of 16 places in 432 ms of which 1 ms to minimize.
[2024-05-28 08:40:04] [INFO ] Deduced a trap composed of 34 places in 389 ms of which 1 ms to minimize.
[2024-05-28 08:40:04] [INFO ] Deduced a trap composed of 78 places in 405 ms of which 1 ms to minimize.
[2024-05-28 08:40:05] [INFO ] Deduced a trap composed of 80 places in 389 ms of which 1 ms to minimize.
[2024-05-28 08:40:05] [INFO ] Deduced a trap composed of 89 places in 398 ms of which 1 ms to minimize.
[2024-05-28 08:40:06] [INFO ] Deduced a trap composed of 48 places in 408 ms of which 1 ms to minimize.
[2024-05-28 08:40:06] [INFO ] Deduced a trap composed of 62 places in 415 ms of which 1 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 91 places in 412 ms of which 1 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 54 places in 405 ms of which 1 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 65 places in 404 ms of which 1 ms to minimize.
[2024-05-28 08:40:08] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 1 ms to minimize.
[2024-05-28 08:40:09] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 1 ms to minimize.
[2024-05-28 08:40:09] [INFO ] Deduced a trap composed of 54 places in 376 ms of which 1 ms to minimize.
[2024-05-28 08:40:10] [INFO ] Deduced a trap composed of 68 places in 357 ms of which 1 ms to minimize.
[2024-05-28 08:40:10] [INFO ] Deduced a trap composed of 54 places in 348 ms of which 1 ms to minimize.
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 2 ms to minimize.
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 1 ms to minimize.
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 63 places in 299 ms of which 1 ms to minimize.
[2024-05-28 08:40:12] [INFO ] Deduced a trap composed of 50 places in 478 ms of which 1 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 61 places in 478 ms of which 2 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 101 places in 420 ms of which 1 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 88 places in 300 ms of which 1 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 79 places in 308 ms of which 1 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2024-05-28 08:40:15] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 1 ms to minimize.
[2024-05-28 08:40:15] [INFO ] Deduced a trap composed of 38 places in 312 ms of which 1 ms to minimize.
[2024-05-28 08:40:16] [INFO ] Deduced a trap composed of 68 places in 417 ms of which 1 ms to minimize.
[2024-05-28 08:40:17] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 08:40:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 08:40:17] [INFO ] After 25118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 10 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 11 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:40:17] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:17] [INFO ] Invariant cache hit.
[2024-05-28 08:40:18] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 08:40:18] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:18] [INFO ] Invariant cache hit.
[2024-05-28 08:40:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:40:20] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 2779 ms to find 0 implicit places.
[2024-05-28 08:40:20] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-28 08:40:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:20] [INFO ] Invariant cache hit.
[2024-05-28 08:40:21] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3787 ms. Remains : 593/593 places, 1007/1007 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 95 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-28 08:40:21] [INFO ] Computed 6 invariants in 2 ms
[2024-05-28 08:40:21] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 08:40:21] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 08:40:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 08:40:22] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 08:40:23] [INFO ] After 956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 441 ms.
[2024-05-28 08:40:23] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 447 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-28 08:40:24] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-28 08:40:24] [INFO ] Computed 17 invariants in 4 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), true]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 403 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 2 reset in 637 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 343 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:40:28] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-28 08:40:28] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:28] [INFO ] Invariant cache hit.
[2024-05-28 08:40:29] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1213 ms. Remains : 593/593 places, 1007/1007 transitions.
Built C files in :
/tmp/ltsmin4912554816416742432
[2024-05-28 08:40:29] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4912554816416742432
Running compilation step : cd /tmp/ltsmin4912554816416742432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2887 ms.
Running link step : cd /tmp/ltsmin4912554816416742432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4912554816416742432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8508814546588209863.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 5 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-28 08:40:44] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:44] [INFO ] Invariant cache hit.
[2024-05-28 08:40:44] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 08:40:44] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:44] [INFO ] Invariant cache hit.
[2024-05-28 08:40:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-28 08:40:46] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2527 ms to find 0 implicit places.
[2024-05-28 08:40:46] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-28 08:40:46] [INFO ] Invariant cache hit.
[2024-05-28 08:40:48] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3644 ms. Remains : 593/593 places, 1007/1007 transitions.
Built C files in :
/tmp/ltsmin13043266277060254447
[2024-05-28 08:40:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13043266277060254447
Running compilation step : cd /tmp/ltsmin13043266277060254447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2879 ms.
Running link step : cd /tmp/ltsmin13043266277060254447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13043266277060254447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16335385949004453999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:41:03] [INFO ] Flatten gal took : 33 ms
[2024-05-28 08:41:03] [INFO ] Flatten gal took : 48 ms
[2024-05-28 08:41:03] [INFO ] Time to serialize gal into /tmp/LTL15151328484101674783.gal : 10 ms
[2024-05-28 08:41:03] [INFO ] Time to serialize properties into /tmp/LTL17132284589196539913.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15151328484101674783.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6822137632071118545.hoa' '-atoms' '/tmp/LTL17132284589196539913.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75...4967
Formula 0 simplified : XXG((G"(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75>=1)||(...4950
Detected timeout of ITS tools.
[2024-05-28 08:41:33] [INFO ] Flatten gal took : 37 ms
[2024-05-28 08:41:33] [INFO ] Applying decomposition
[2024-05-28 08:41:33] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16130132027226844090.txt' '-o' '/tmp/graph16130132027226844090.bin' '-w' '/tmp/graph16130132027226844090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16130132027226844090.bin' '-l' '-1' '-v' '-w' '/tmp/graph16130132027226844090.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:41:33] [INFO ] Decomposing Gal with order
[2024-05-28 08:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:41:33] [INFO ] Removed a total of 1206 redundant transitions.
[2024-05-28 08:41:33] [INFO ] Flatten gal took : 128 ms
[2024-05-28 08:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-28 08:41:34] [INFO ] Time to serialize gal into /tmp/LTL8347368674777238568.gal : 14 ms
[2024-05-28 08:41:34] [INFO ] Time to serialize properties into /tmp/LTL7598058473447363322.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8347368674777238568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7598058473447363322.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((i9.u79.TestIdentity_67>=1)||(i13.i0.u47.TestIdentity_2>=1))||((i14.i1.u116.TestIdentity_128>=1)||(i17.i1.u75....6841
Formula 0 simplified : XXG((G"(((((((((i9.u79.TestIdentity_67>=1)||(i13.i0.u47.TestIdentity_2>=1))||((i14.i1.u116.TestIdentity_128>=1)||(i17.i1.u75.TestIde...6824
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1126758486540736084
[2024-05-28 08:41:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1126758486540736084
Running compilation step : cd /tmp/ltsmin1126758486540736084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2836 ms.
Running link step : cd /tmp/ltsmin1126758486540736084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1126758486540736084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((<>(!(LTLAPp0==true)) U (LTLAPp1==true))&&X([](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 274718 ms.
[2024-05-28 08:42:04] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16005039681010011211
[2024-05-28 08:42:04] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2024-05-28 08:42:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:42:04] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2024-05-28 08:42:04] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:42:04] [INFO ] Applying decomposition
[2024-05-28 08:42:04] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11022274306094849819.txt' '-o' '/tmp/graph11022274306094849819.bin' '-w' '/tmp/graph11022274306094849819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11022274306094849819.bin' '-l' '-1' '-v' '-w' '/tmp/graph11022274306094849819.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:42:04] [INFO ] Decomposing Gal with order
[2024-05-28 08:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:42:04] [INFO ] Removed a total of 1034 redundant transitions.
[2024-05-28 08:42:04] [INFO ] Flatten gal took : 71 ms
[2024-05-28 08:42:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 08:42:04] [INFO ] Time to serialize gal into /tmp/LTLFireability14568636192148151282.gal : 16 ms
[2024-05-28 08:42:04] [INFO ] Time to serialize properties into /tmp/LTLFireability15637454885468749932.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14568636192148151282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15637454885468749932.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
[2024-05-28 08:42:04] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
Checking formula 0 : !((X(X(F(((F(!("(((((((((i27.i0.u135.TestIdentity_67>=1)||(i6.i1.u197.TestIdentity_2>=1))||((i32.i0.u169.TestIdentity_128>=1)||(i3.i0....7111
Formula 0 simplified : XXG((G"(((((((((i27.i0.u135.TestIdentity_67>=1)||(i6.i1.u197.TestIdentity_2>=1))||((i32.i0.u169.TestIdentity_128>=1)||(i3.i0.u132.Te...7090
[2024-05-28 08:42:04] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:42:04] [INFO ] Built C files in 528ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16005039681010011211
Running compilation step : cd /tmp/ltsmin16005039681010011211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 6321 ms.
Running link step : cd /tmp/ltsmin16005039681010011211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 145 ms.
Running LTSmin : cd /tmp/ltsmin16005039681010011211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((<>(!(LTLAPp0==true)) U (LTLAPp1==true))&&X([](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 09:05:12] [INFO ] Applying decomposition
[2024-05-28 09:05:13] [INFO ] Flatten gal took : 548 ms
[2024-05-28 09:05:13] [INFO ] Decomposing Gal with order
[2024-05-28 09:05:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:05:14] [INFO ] Removed a total of 1098 redundant transitions.
[2024-05-28 09:05:15] [INFO ] Flatten gal took : 789 ms
[2024-05-28 09:05:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 50 ms.
[2024-05-28 09:05:15] [INFO ] Time to serialize gal into /tmp/LTLFireability17328165812838973545.gal : 80 ms
[2024-05-28 09:05:15] [INFO ] Time to serialize properties into /tmp/LTLFireability3658648469805670229.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17328165812838973545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3658648469805670229.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((ProcessTourProcess67.TestIdentity_67>=1)||(ProcessTourProcess2.TestIdentity_2>=1))||((ProcessTourProcess128.T...9495
Formula 0 simplified : XXG((G"(((((((((ProcessTourProcess67.TestIdentity_67>=1)||(ProcessTourProcess2.TestIdentity_2>=1))||((ProcessTourProcess128.TestIden...9474
Detected timeout of ITS tools.
[2024-05-28 09:28:22] [INFO ] Flatten gal took : 363 ms
[2024-05-28 09:28:25] [INFO ] Input system was already deterministic with 1242 transitions.
[2024-05-28 09:28:25] [INFO ] Transformed 834 places.
[2024-05-28 09:28:25] [INFO ] Transformed 1242 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 09:28:25] [INFO ] Time to serialize gal into /tmp/LTLFireability5335463790744124140.gal : 39 ms
[2024-05-28 09:28:25] [INFO ] Time to serialize properties into /tmp/LTLFireability11581507463509949004.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5335463790744124140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11581507463509949004.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F(((F(!("(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75...5000
Formula 0 simplified : XXG((G"(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75>=1)||(...4979
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12213516 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15763428 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Peterson-COL-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Peterson-COL-5, 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 r285-smll-171654422000143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;