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.r267-smll-171654406000228.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 greatspnxred
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 r267-smll-171654406000228
=====================================================================

--------------------
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 1716737944888

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 15:39:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 15:39:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 15:39:06] [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-26 15:39:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 15:39:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1289 ms
[2024-05-26 15:39:08] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 15:39:08] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-05-26 15:39:08] [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
RANDOM walk for 718 steps (0 resets) in 28 ms. (24 steps per ms) remains 0/10 properties
[2024-05-26 15:39:08] [INFO ] Flatten gal took : 21 ms
[2024-05-26 15:39:08] [INFO ] Flatten gal took : 4 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-26 15:39:08] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 94 ms.
[2024-05-26 15:39:08] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 30 places in 17 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 27 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:39:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:39:08] [INFO ] Computed 23 invariants in 44 ms
[2024-05-26 15:39:09] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-26 15:39:09] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:39:09] [INFO ] Invariant cache hit.
[2024-05-26 15:39:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:39:10] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 15:39:10] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:39:10] [INFO ] Invariant cache hit.
[2024-05-26 15:39:10] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 15:39:35] [INFO ] Deduced a trap composed of 30 places in 822 ms of which 139 ms to minimize.
[2024-05-26 15:39:36] [INFO ] Deduced a trap composed of 18 places in 884 ms of which 12 ms to minimize.
[2024-05-26 15:39:37] [INFO ] Deduced a trap composed of 41 places in 749 ms of which 10 ms to minimize.
[2024-05-26 15:39:37] [INFO ] Deduced a trap composed of 75 places in 679 ms of which 8 ms to minimize.
[2024-05-26 15:39:38] [INFO ] Deduced a trap composed of 43 places in 684 ms of which 9 ms to minimize.
[2024-05-26 15:39:39] [INFO ] Deduced a trap composed of 61 places in 609 ms of which 8 ms to minimize.
[2024-05-26 15:39:39] [INFO ] Deduced a trap composed of 41 places in 547 ms of which 7 ms to minimize.
[2024-05-26 15:39:40] [INFO ] Deduced a trap composed of 80 places in 482 ms of which 7 ms to minimize.
[2024-05-26 15:39:41] [INFO ] Deduced a trap composed of 27 places in 667 ms of which 11 ms to minimize.
SMT process timed out in 30716ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30776ms
Finished structural reductions in LTL mode , in 1 iterations and 32192 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2024-05-26 15:39:41] [INFO ] Flatten gal took : 159 ms
[2024-05-26 15:39:41] [INFO ] Flatten gal took : 171 ms
[2024-05-26 15:39:41] [INFO ] Input system was already deterministic with 1242 transitions.
Reduction of identical properties reduced properties to check from 18 to 14
RANDOM walk for 40000 steps (8 resets) in 1252 ms. (31 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
[2024-05-26 15:39:42] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:39:42] [INFO ] Invariant cache hit.
[2024-05-26 15:39:42] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1956 variables, 30/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 5/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1926 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1956 variables, 30/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:39:44] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 7 ms to minimize.
[2024-05-26 15:39:45] [INFO ] Deduced a trap composed of 22 places in 635 ms of which 10 ms to minimize.
[2024-05-26 15:39:46] [INFO ] Deduced a trap composed of 180 places in 833 ms of which 11 ms to minimize.
[2024-05-26 15:39:46] [INFO ] Deduced a trap composed of 45 places in 770 ms of which 10 ms to minimize.
[2024-05-26 15:39:47] [INFO ] Deduced a trap composed of 48 places in 734 ms of which 9 ms to minimize.
[2024-05-26 15:39:48] [INFO ] Deduced a trap composed of 11 places in 713 ms of which 11 ms to minimize.
SMT process timed out in 6006ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
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 (Trivial Post-Agglo cleanup.) 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 1 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 199 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 200 ms. Remains : 299/834 places, 707/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 453 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 8 ms. (steps per millisecond=7 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 13 ms. (steps per millisecond=4 ) properties seen :1
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.202405141337/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 (Trivial Post-Agglo cleanup.) 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 129 ms. Remains 462 /834 variables (removed 372) and now considering 870/1242 (removed 372) transitions.
[2024-05-26 15:39:49] [INFO ] Flow matrix only has 750 transitions (discarded 120 similar events)
// Phase 1: matrix 750 rows 462 cols
[2024-05-26 15:39:49] [INFO ] Computed 23 invariants in 9 ms
[2024-05-26 15:39:49] [INFO ] Implicit Places using invariants in 193 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 197 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 24 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 350 ms. Remains : 456/834 places, 870/1242 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-00
Product exploration explored 100000 steps with 11368 reset in 1421 ms.
Stack based approach found an accepted trace after 949 steps with 106 reset with depth 11 and stack size 11 in 18 ms.
FORMULA Peterson-COL-5-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-00 finished in 2162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 2 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-26 15:39:51] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2024-05-26 15:39:51] [INFO ] Computed 23 invariants in 5 ms
[2024-05-26 15:39:51] [INFO ] Implicit Places using invariants in 382 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 385 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 18 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 468 ms. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-01
Product exploration explored 100000 steps with 8509 reset in 408 ms.
Stack based approach found an accepted trace after 44 steps with 3 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-01 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:39:52] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:39:52] [INFO ] Computed 23 invariants in 10 ms
[2024-05-26 15:39:52] [INFO ] Implicit Places using invariants in 449 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 451 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 12 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 479 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 353 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
Product exploration explored 100000 steps with 3 reset in 700 ms.
Product exploration explored 100000 steps with 0 reset in 588 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)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 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 261 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 678 ms. (58 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 869 ms. (45 steps per ms) remains 2/2 properties
[2024-05-26 15:39:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 15:39:55] [INFO ] Computed 17 invariants in 6 ms
[2024-05-26 15:39:55] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:39:57] [INFO ] Deduced a trap composed of 79 places in 596 ms of which 10 ms to minimize.
[2024-05-26 15:39:58] [INFO ] Deduced a trap composed of 119 places in 537 ms of which 8 ms to minimize.
[2024-05-26 15:39:58] [INFO ] Deduced a trap composed of 207 places in 398 ms of which 7 ms to minimize.
[2024-05-26 15:39:58] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 4 ms to minimize.
[2024-05-26 15:39:59] [INFO ] Deduced a trap composed of 159 places in 416 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:39:59] [INFO ] Deduced a trap composed of 179 places in 443 ms of which 7 ms to minimize.
[2024-05-26 15:40:00] [INFO ] Deduced a trap composed of 139 places in 571 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:40:00] [INFO ] Deduced a trap composed of 146 places in 399 ms of which 6 ms to minimize.
[2024-05-26 15:40:01] [INFO ] Deduced a trap composed of 144 places in 395 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:40:02] [INFO ] Deduced a trap composed of 207 places in 628 ms of which 10 ms to minimize.
SMT process timed out in 6591ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
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 (Trivial Post-Agglo cleanup.) 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 7 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 102 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 102 ms. Remains : 593/828 places, 1007/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 649 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 701 ms. (56 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 396480 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :1 out of 2
Probabilistic random walk after 396480 steps, saw 138160 distinct states, run finished after 3008 ms. (steps per millisecond=131 ) properties seen :1
[2024-05-26 15:40:05] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 15:40:05] [INFO ] Computed 17 invariants in 4 ms
[2024-05-26 15:40:05] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:07] [INFO ] Deduced a trap composed of 114 places in 257 ms of which 4 ms to minimize.
[2024-05-26 15:40:07] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 3 ms to minimize.
[2024-05-26 15:40:07] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:08] [INFO ] Deduced a trap composed of 103 places in 304 ms of which 5 ms to minimize.
[2024-05-26 15:40:08] [INFO ] Deduced a trap composed of 144 places in 276 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 887/1450 variables, 563/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 205/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 5/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:10] [INFO ] Deduced a trap composed of 16 places in 527 ms of which 9 ms to minimize.
[2024-05-26 15:40:11] [INFO ] Deduced a trap composed of 32 places in 562 ms of which 8 ms to minimize.
[2024-05-26 15:40:11] [INFO ] Deduced a trap composed of 20 places in 553 ms of which 9 ms to minimize.
[2024-05-26 15:40:12] [INFO ] Deduced a trap composed of 13 places in 545 ms of which 8 ms to minimize.
[2024-05-26 15:40:13] [INFO ] Deduced a trap composed of 60 places in 411 ms of which 14 ms to minimize.
[2024-05-26 15:40:13] [INFO ] Deduced a trap composed of 55 places in 541 ms of which 8 ms to minimize.
[2024-05-26 15:40:14] [INFO ] Deduced a trap composed of 55 places in 515 ms of which 7 ms to minimize.
[2024-05-26 15:40:15] [INFO ] Deduced a trap composed of 17 places in 553 ms of which 8 ms to minimize.
[2024-05-26 15:40:15] [INFO ] Deduced a trap composed of 47 places in 328 ms of which 4 ms to minimize.
[2024-05-26 15:40:16] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 6 ms to minimize.
[2024-05-26 15:40:16] [INFO ] Deduced a trap composed of 126 places in 265 ms of which 4 ms to minimize.
[2024-05-26 15:40:17] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 6 ms to minimize.
[2024-05-26 15:40:17] [INFO ] Deduced a trap composed of 66 places in 393 ms of which 6 ms to minimize.
[2024-05-26 15:40:18] [INFO ] Deduced a trap composed of 19 places in 626 ms of which 8 ms to minimize.
[2024-05-26 15:40:19] [INFO ] Deduced a trap composed of 41 places in 610 ms of which 9 ms to minimize.
[2024-05-26 15:40:19] [INFO ] Deduced a trap composed of 38 places in 619 ms of which 9 ms to minimize.
[2024-05-26 15:40:20] [INFO ] Deduced a trap composed of 42 places in 595 ms of which 9 ms to minimize.
[2024-05-26 15:40:21] [INFO ] Deduced a trap composed of 127 places in 399 ms of which 6 ms to minimize.
[2024-05-26 15:40:21] [INFO ] Deduced a trap composed of 80 places in 388 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 19/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:23] [INFO ] Deduced a trap composed of 67 places in 429 ms of which 7 ms to minimize.
[2024-05-26 15:40:23] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 7 ms to minimize.
[2024-05-26 15:40:24] [INFO ] Deduced a trap composed of 34 places in 456 ms of which 7 ms to minimize.
[2024-05-26 15:40:24] [INFO ] Deduced a trap composed of 16 places in 501 ms of which 8 ms to minimize.
[2024-05-26 15:40:25] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 8 ms to minimize.
[2024-05-26 15:40:26] [INFO ] Deduced a trap composed of 90 places in 502 ms of which 8 ms to minimize.
[2024-05-26 15:40:27] [INFO ] Deduced a trap composed of 79 places in 390 ms of which 7 ms to minimize.
[2024-05-26 15:40:27] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 16 ms to minimize.
[2024-05-26 15:40:28] [INFO ] Deduced a trap composed of 82 places in 386 ms of which 6 ms to minimize.
[2024-05-26 15:40:29] [INFO ] Deduced a trap composed of 88 places in 394 ms of which 6 ms to minimize.
[2024-05-26 15:40:29] [INFO ] Deduced a trap composed of 97 places in 462 ms of which 7 ms to minimize.
[2024-05-26 15:40:30] [INFO ] Deduced a trap composed of 83 places in 436 ms of which 7 ms to minimize.
[2024-05-26 15:40:31] [INFO ] Deduced a trap composed of 57 places in 478 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 13/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26228 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
After SMT, in 27247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 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 29 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 30 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 515 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442106 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442106 steps, saw 144516 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-26 15:40:36] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:40:36] [INFO ] Invariant cache hit.
[2024-05-26 15:40:36] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:37] [INFO ] Deduced a trap composed of 84 places in 423 ms of which 7 ms to minimize.
[2024-05-26 15:40:38] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:38] [INFO ] Deduced a trap composed of 54 places in 338 ms of which 5 ms to minimize.
[2024-05-26 15:40:38] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:39] [INFO ] Deduced a trap composed of 89 places in 264 ms of which 4 ms to minimize.
[2024-05-26 15:40:39] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 5 ms to minimize.
[2024-05-26 15:40:39] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 3 ms to minimize.
[2024-05-26 15:40:39] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:40:41] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 7 ms to minimize.
[2024-05-26 15:40:42] [INFO ] Deduced a trap composed of 11 places in 495 ms of which 7 ms to minimize.
[2024-05-26 15:40:43] [INFO ] Deduced a trap composed of 30 places in 423 ms of which 6 ms to minimize.
[2024-05-26 15:40:43] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 6 ms to minimize.
[2024-05-26 15:40:44] [INFO ] Deduced a trap composed of 65 places in 478 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8343 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9073ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 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 36 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 36 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 36 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 15:40:45] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:40:45] [INFO ] Invariant cache hit.
[2024-05-26 15:40:46] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-26 15:40:46] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:40:46] [INFO ] Invariant cache hit.
[2024-05-26 15:40:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:40:49] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 3166 ms to find 0 implicit places.
[2024-05-26 15:40:49] [INFO ] Redundant transitions in 111 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:40:49] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:40:49] [INFO ] Invariant cache hit.
[2024-05-26 15:40:49] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:41:07] [INFO ] Deduced a trap composed of 74 places in 563 ms of which 9 ms to minimize.
[2024-05-26 15:41:08] [INFO ] Deduced a trap composed of 35 places in 533 ms of which 7 ms to minimize.
[2024-05-26 15:41:08] [INFO ] Deduced a trap composed of 41 places in 521 ms of which 7 ms to minimize.
[2024-05-26 15:41:09] [INFO ] Deduced a trap composed of 55 places in 550 ms of which 8 ms to minimize.
[2024-05-26 15:41:10] [INFO ] Deduced a trap composed of 38 places in 540 ms of which 7 ms to minimize.
[2024-05-26 15:41:10] [INFO ] Deduced a trap composed of 29 places in 585 ms of which 8 ms to minimize.
[2024-05-26 15:41:11] [INFO ] Deduced a trap composed of 17 places in 541 ms of which 7 ms to minimize.
[2024-05-26 15:41:11] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 7 ms to minimize.
[2024-05-26 15:41:12] [INFO ] Deduced a trap composed of 53 places in 524 ms of which 7 ms to minimize.
[2024-05-26 15:41:12] [INFO ] Deduced a trap composed of 16 places in 471 ms of which 7 ms to minimize.
[2024-05-26 15:41:13] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 7 ms to minimize.
[2024-05-26 15:41:13] [INFO ] Deduced a trap composed of 29 places in 452 ms of which 7 ms to minimize.
[2024-05-26 15:41:14] [INFO ] Deduced a trap composed of 16 places in 496 ms of which 8 ms to minimize.
[2024-05-26 15:41:14] [INFO ] Deduced a trap composed of 30 places in 523 ms of which 8 ms to minimize.
[2024-05-26 15:41:15] [INFO ] Deduced a trap composed of 24 places in 447 ms of which 8 ms to minimize.
[2024-05-26 15:41:15] [INFO ] Deduced a trap composed of 29 places in 526 ms of which 8 ms to minimize.
[2024-05-26 15:41:16] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 8 ms to minimize.
[2024-05-26 15:41:16] [INFO ] Deduced a trap composed of 26 places in 545 ms of which 8 ms to minimize.
[2024-05-26 15:41:17] [INFO ] Deduced a trap composed of 32 places in 394 ms of which 6 ms to minimize.
[2024-05-26 15:41:17] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:41:18] [INFO ] Deduced a trap composed of 53 places in 418 ms of which 6 ms to minimize.
[2024-05-26 15:41:19] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 8 ms to minimize.
[2024-05-26 15:41:19] [INFO ] Deduced a trap composed of 20 places in 523 ms of which 7 ms to minimize.
SMT process timed out in 30539ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33889 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
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 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 (Empty/Sink Transition effects.) 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 (Redundant composition of simpler 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.2 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 (Empty/Sink Transition effects.) 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 217 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-26 15:41:19] [INFO ] Computed 6 invariants in 3 ms
[2024-05-26 15:41:20] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:41:20] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 15:41:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:41:20] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 15:41:21] [INFO ] After 871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 15:41:21] [INFO ] After 1307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1756 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 189 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 374 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 263 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 15:41:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 15:41:22] [INFO ] Computed 17 invariants in 4 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 2 factoid took 165 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 322 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 27 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:41:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:41:23] [INFO ] Invariant cache hit.
[2024-05-26 15:41:24] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-26 15:41:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:41:24] [INFO ] Invariant cache hit.
[2024-05-26 15:41:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:41:28] [INFO ] Implicit Places using invariants and state equation in 3471 ms returned []
Implicit Place search using SMT with State Equation took 4164 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 15:41:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:41:28] [INFO ] Invariant cache hit.
[2024-05-26 15:41:28] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1950 variables, and 17 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 15:42:01] [INFO ] Deduced a trap composed of 41 places in 824 ms of which 8 ms to minimize.
[2024-05-26 15:42:02] [INFO ] Deduced a trap composed of 77 places in 725 ms of which 12 ms to minimize.
[2024-05-26 15:42:03] [INFO ] Deduced a trap composed of 51 places in 979 ms of which 11 ms to minimize.
[2024-05-26 15:42:04] [INFO ] Deduced a trap composed of 49 places in 834 ms of which 7 ms to minimize.
[2024-05-26 15:42:05] [INFO ] Deduced a trap composed of 45 places in 777 ms of which 12 ms to minimize.
[2024-05-26 15:42:05] [INFO ] Deduced a trap composed of 52 places in 572 ms of which 7 ms to minimize.
[2024-05-26 15:42:06] [INFO ] Deduced a trap composed of 22 places in 685 ms of which 11 ms to minimize.
[2024-05-26 15:42:07] [INFO ] Deduced a trap composed of 35 places in 660 ms of which 6 ms to minimize.
[2024-05-26 15:42:07] [INFO ] Deduced a trap composed of 20 places in 528 ms of which 7 ms to minimize.
[2024-05-26 15:42:08] [INFO ] Deduced a trap composed of 78 places in 506 ms of which 6 ms to minimize.
[2024-05-26 15:42:08] [INFO ] Deduced a trap composed of 63 places in 505 ms of which 7 ms to minimize.
[2024-05-26 15:42:09] [INFO ] Deduced a trap composed of 62 places in 497 ms of which 6 ms to minimize.
[2024-05-26 15:42:09] [INFO ] Deduced a trap composed of 119 places in 500 ms of which 11 ms to minimize.
[2024-05-26 15:42:10] [INFO ] Deduced a trap composed of 38 places in 771 ms of which 10 ms to minimize.
[2024-05-26 15:42:11] [INFO ] Deduced a trap composed of 35 places in 708 ms of which 9 ms to minimize.
[2024-05-26 15:42:11] [INFO ] Deduced a trap composed of 58 places in 698 ms of which 10 ms to minimize.
[2024-05-26 15:42:12] [INFO ] Deduced a trap composed of 34 places in 715 ms of which 10 ms to minimize.
[2024-05-26 15:42:13] [INFO ] Deduced a trap composed of 18 places in 658 ms of which 9 ms to minimize.
[2024-05-26 15:42:14] [INFO ] Deduced a trap composed of 51 places in 676 ms of which 9 ms to minimize.
[2024-05-26 15:42:14] [INFO ] Deduced a trap composed of 105 places in 771 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 15:42:16] [INFO ] Deduced a trap composed of 72 places in 760 ms of which 10 ms to minimize.
[2024-05-26 15:42:17] [INFO ] Deduced a trap composed of 40 places in 856 ms of which 11 ms to minimize.
[2024-05-26 15:42:18] [INFO ] Deduced a trap composed of 16 places in 788 ms of which 10 ms to minimize.
[2024-05-26 15:42:18] [INFO ] Deduced a trap composed of 27 places in 835 ms of which 12 ms to minimize.
[2024-05-26 15:42:19] [INFO ] Deduced a trap composed of 38 places in 672 ms of which 10 ms to minimize.
[2024-05-26 15:42:20] [INFO ] Deduced a trap composed of 79 places in 488 ms of which 7 ms to minimize.
[2024-05-26 15:42:20] [INFO ] Deduced a trap composed of 47 places in 429 ms of which 6 ms to minimize.
[2024-05-26 15:42:21] [INFO ] Deduced a trap composed of 77 places in 651 ms of which 8 ms to minimize.
[2024-05-26 15:42:21] [INFO ] Deduced a trap composed of 50 places in 649 ms of which 10 ms to minimize.
[2024-05-26 15:42:22] [INFO ] Deduced a trap composed of 72 places in 730 ms of which 10 ms to minimize.
[2024-05-26 15:42:23] [INFO ] Deduced a trap composed of 14 places in 705 ms of which 10 ms to minimize.
[2024-05-26 15:42:24] [INFO ] Deduced a trap composed of 61 places in 724 ms of which 10 ms to minimize.
[2024-05-26 15:42:24] [INFO ] Deduced a trap composed of 26 places in 770 ms of which 10 ms to minimize.
[2024-05-26 15:42:25] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 4 ms to minimize.
[2024-05-26 15:42:26] [INFO ] Deduced a trap composed of 64 places in 927 ms of which 11 ms to minimize.
[2024-05-26 15:42:27] [INFO ] Deduced a trap composed of 115 places in 838 ms of which 12 ms to minimize.
[2024-05-26 15:42:28] [INFO ] Deduced a trap composed of 35 places in 883 ms of which 12 ms to minimize.
[2024-05-26 15:42:29] [INFO ] Deduced a trap composed of 53 places in 854 ms of which 11 ms to minimize.
SMT process timed out in 61004ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61029ms
Finished structural reductions in LTL mode , in 1 iterations and 65225 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))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 123 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 371 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 564 ms. (70 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 2/2 properties
[2024-05-26 15:42:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:42:29] [INFO ] Invariant cache hit.
[2024-05-26 15:42:29] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:42:32] [INFO ] Deduced a trap composed of 79 places in 700 ms of which 10 ms to minimize.
[2024-05-26 15:42:33] [INFO ] Deduced a trap composed of 163 places in 471 ms of which 8 ms to minimize.
[2024-05-26 15:42:33] [INFO ] Deduced a trap composed of 159 places in 536 ms of which 8 ms to minimize.
[2024-05-26 15:42:34] [INFO ] Deduced a trap composed of 119 places in 386 ms of which 7 ms to minimize.
[2024-05-26 15:42:34] [INFO ] Deduced a trap composed of 227 places in 407 ms of which 6 ms to minimize.
[2024-05-26 15:42:34] [INFO ] Deduced a trap composed of 255 places in 265 ms of which 5 ms to minimize.
[2024-05-26 15:42:35] [INFO ] Deduced a trap composed of 199 places in 276 ms of which 6 ms to minimize.
[2024-05-26 15:42:35] [INFO ] Deduced a trap composed of 139 places in 571 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:42:36] [INFO ] Deduced a trap composed of 99 places in 405 ms of which 6 ms to minimize.
[2024-05-26 15:42:36] [INFO ] Deduced a trap composed of 182 places in 232 ms of which 4 ms to minimize.
[2024-05-26 15:42:36] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 5 ms to minimize.
SMT process timed out in 6847ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
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 (Trivial Post-Agglo cleanup.) 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 78 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 79 ms. Remains : 593/828 places, 1007/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 787 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 414757 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :1 out of 2
Probabilistic random walk after 414757 steps, saw 140622 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :1
[2024-05-26 15:42:40] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 15:42:40] [INFO ] Computed 17 invariants in 3 ms
[2024-05-26 15:42:40] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:42:41] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 4 ms to minimize.
[2024-05-26 15:42:41] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-26 15:42:41] [INFO ] Deduced a trap composed of 156 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:42:41] [INFO ] Deduced a trap composed of 103 places in 312 ms of which 5 ms to minimize.
[2024-05-26 15:42:42] [INFO ] Deduced a trap composed of 144 places in 250 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 887/1450 variables, 563/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 205/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 5/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:42:44] [INFO ] Deduced a trap composed of 16 places in 545 ms of which 8 ms to minimize.
[2024-05-26 15:42:45] [INFO ] Deduced a trap composed of 32 places in 582 ms of which 7 ms to minimize.
[2024-05-26 15:42:45] [INFO ] Deduced a trap composed of 20 places in 572 ms of which 8 ms to minimize.
[2024-05-26 15:42:46] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 8 ms to minimize.
[2024-05-26 15:42:47] [INFO ] Deduced a trap composed of 60 places in 504 ms of which 7 ms to minimize.
[2024-05-26 15:42:48] [INFO ] Deduced a trap composed of 55 places in 597 ms of which 8 ms to minimize.
[2024-05-26 15:42:48] [INFO ] Deduced a trap composed of 55 places in 511 ms of which 8 ms to minimize.
[2024-05-26 15:42:49] [INFO ] Deduced a trap composed of 17 places in 532 ms of which 8 ms to minimize.
[2024-05-26 15:42:50] [INFO ] Deduced a trap composed of 47 places in 431 ms of which 6 ms to minimize.
[2024-05-26 15:42:50] [INFO ] Deduced a trap composed of 50 places in 450 ms of which 7 ms to minimize.
[2024-05-26 15:42:51] [INFO ] Deduced a trap composed of 126 places in 454 ms of which 7 ms to minimize.
[2024-05-26 15:42:51] [INFO ] Deduced a trap composed of 24 places in 462 ms of which 7 ms to minimize.
[2024-05-26 15:42:52] [INFO ] Deduced a trap composed of 66 places in 389 ms of which 6 ms to minimize.
[2024-05-26 15:42:53] [INFO ] Deduced a trap composed of 19 places in 635 ms of which 8 ms to minimize.
[2024-05-26 15:42:54] [INFO ] Deduced a trap composed of 41 places in 634 ms of which 9 ms to minimize.
[2024-05-26 15:42:54] [INFO ] Deduced a trap composed of 38 places in 635 ms of which 8 ms to minimize.
[2024-05-26 15:42:55] [INFO ] Deduced a trap composed of 42 places in 656 ms of which 8 ms to minimize.
[2024-05-26 15:42:56] [INFO ] Deduced a trap composed of 127 places in 443 ms of which 6 ms to minimize.
[2024-05-26 15:42:56] [INFO ] Deduced a trap composed of 80 places in 423 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 19/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:42:58] [INFO ] Deduced a trap composed of 67 places in 390 ms of which 6 ms to minimize.
[2024-05-26 15:42:58] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 7 ms to minimize.
[2024-05-26 15:42:59] [INFO ] Deduced a trap composed of 34 places in 451 ms of which 7 ms to minimize.
[2024-05-26 15:43:00] [INFO ] Deduced a trap composed of 16 places in 531 ms of which 8 ms to minimize.
[2024-05-26 15:43:00] [INFO ] Deduced a trap composed of 16 places in 533 ms of which 7 ms to minimize.
[2024-05-26 15:43:01] [INFO ] Deduced a trap composed of 90 places in 512 ms of which 7 ms to minimize.
[2024-05-26 15:43:02] [INFO ] Deduced a trap composed of 79 places in 396 ms of which 6 ms to minimize.
[2024-05-26 15:43:03] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 7 ms to minimize.
[2024-05-26 15:43:03] [INFO ] Deduced a trap composed of 82 places in 384 ms of which 6 ms to minimize.
[2024-05-26 15:43:04] [INFO ] Deduced a trap composed of 88 places in 399 ms of which 7 ms to minimize.
[2024-05-26 15:43:04] [INFO ] Deduced a trap composed of 97 places in 437 ms of which 7 ms to minimize.
[2024-05-26 15:43:05] [INFO ] Deduced a trap composed of 83 places in 473 ms of which 7 ms to minimize.
[2024-05-26 15:43:06] [INFO ] Deduced a trap composed of 57 places in 483 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 13/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27119 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
After SMT, in 27868ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 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 24 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 438662 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438662 steps, saw 143742 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-26 15:43:11] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:43:11] [INFO ] Invariant cache hit.
[2024-05-26 15:43:11] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:43:12] [INFO ] Deduced a trap composed of 84 places in 469 ms of which 9 ms to minimize.
[2024-05-26 15:43:13] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:43:13] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 5 ms to minimize.
[2024-05-26 15:43:13] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:43:14] [INFO ] Deduced a trap composed of 89 places in 238 ms of which 4 ms to minimize.
[2024-05-26 15:43:14] [INFO ] Deduced a trap composed of 105 places in 259 ms of which 4 ms to minimize.
[2024-05-26 15:43:14] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 3 ms to minimize.
[2024-05-26 15:43:14] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:43:16] [INFO ] Deduced a trap composed of 47 places in 430 ms of which 7 ms to minimize.
[2024-05-26 15:43:17] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 7 ms to minimize.
[2024-05-26 15:43:18] [INFO ] Deduced a trap composed of 30 places in 415 ms of which 7 ms to minimize.
[2024-05-26 15:43:18] [INFO ] Deduced a trap composed of 74 places in 396 ms of which 6 ms to minimize.
[2024-05-26 15:43:19] [INFO ] Deduced a trap composed of 65 places in 504 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8206 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8924ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 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 22 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-26 15:43:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:43:20] [INFO ] Invariant cache hit.
[2024-05-26 15:43:21] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-26 15:43:21] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:43:21] [INFO ] Invariant cache hit.
[2024-05-26 15:43:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:43:23] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2738 ms to find 0 implicit places.
[2024-05-26 15:43:23] [INFO ] Redundant transitions in 71 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:43:23] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:43:23] [INFO ] Invariant cache hit.
[2024-05-26 15:43:23] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:43:42] [INFO ] Deduced a trap composed of 74 places in 566 ms of which 8 ms to minimize.
[2024-05-26 15:43:43] [INFO ] Deduced a trap composed of 35 places in 420 ms of which 8 ms to minimize.
[2024-05-26 15:43:43] [INFO ] Deduced a trap composed of 41 places in 563 ms of which 8 ms to minimize.
[2024-05-26 15:43:44] [INFO ] Deduced a trap composed of 55 places in 435 ms of which 7 ms to minimize.
[2024-05-26 15:43:44] [INFO ] Deduced a trap composed of 38 places in 539 ms of which 8 ms to minimize.
[2024-05-26 15:43:45] [INFO ] Deduced a trap composed of 29 places in 571 ms of which 8 ms to minimize.
[2024-05-26 15:43:45] [INFO ] Deduced a trap composed of 17 places in 526 ms of which 7 ms to minimize.
[2024-05-26 15:43:46] [INFO ] Deduced a trap composed of 82 places in 499 ms of which 8 ms to minimize.
[2024-05-26 15:43:46] [INFO ] Deduced a trap composed of 53 places in 493 ms of which 7 ms to minimize.
[2024-05-26 15:43:47] [INFO ] Deduced a trap composed of 16 places in 494 ms of which 7 ms to minimize.
[2024-05-26 15:43:47] [INFO ] Deduced a trap composed of 29 places in 452 ms of which 7 ms to minimize.
[2024-05-26 15:43:48] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 7 ms to minimize.
[2024-05-26 15:43:48] [INFO ] Deduced a trap composed of 16 places in 479 ms of which 7 ms to minimize.
[2024-05-26 15:43:49] [INFO ] Deduced a trap composed of 30 places in 533 ms of which 7 ms to minimize.
[2024-05-26 15:43:50] [INFO ] Deduced a trap composed of 24 places in 552 ms of which 7 ms to minimize.
[2024-05-26 15:43:50] [INFO ] Deduced a trap composed of 29 places in 545 ms of which 7 ms to minimize.
[2024-05-26 15:43:51] [INFO ] Deduced a trap composed of 29 places in 531 ms of which 8 ms to minimize.
[2024-05-26 15:43:51] [INFO ] Deduced a trap composed of 26 places in 551 ms of which 8 ms to minimize.
[2024-05-26 15:43:52] [INFO ] Deduced a trap composed of 32 places in 395 ms of which 6 ms to minimize.
[2024-05-26 15:43:52] [INFO ] Deduced a trap composed of 11 places in 390 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:43:53] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 5 ms to minimize.
[2024-05-26 15:43:53] [INFO ] Deduced a trap composed of 14 places in 452 ms of which 7 ms to minimize.
SMT process timed out in 30465ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33329 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
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 (Empty/Sink Transition effects.) 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 (Redundant composition of simpler 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 (Empty/Sink Transition effects.) 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 131 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-26 15:43:54] [INFO ] Computed 6 invariants in 2 ms
[2024-05-26 15:43:54] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:43:54] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 15:43:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:43:54] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 15:43:55] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 15:43:55] [INFO ] After 1548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1880 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 218 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 369 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 346 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 15:43:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 15:43:56] [INFO ] Computed 17 invariants in 5 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 1 factoid took 157 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 233 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 330 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 619 ms.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 349 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 142 ms. Remains 753 /828 variables (removed 75) and now considering 1167/1242 (removed 75) transitions.
[2024-05-26 15:44:00] [INFO ] Redundant transitions in 40 ms returned []
Running 1161 sub problems to find dead transitions.
[2024-05-26 15:44:00] [INFO ] Flow matrix only has 1047 transitions (discarded 120 similar events)
// Phase 1: matrix 1047 rows 753 cols
[2024-05-26 15:44:00] [INFO ] Computed 17 invariants in 6 ms
[2024-05-26 15:44:00] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-05-26 15:44:27] [INFO ] Deduced a trap composed of 35 places in 871 ms of which 11 ms to minimize.
[2024-05-26 15:44:28] [INFO ] Deduced a trap composed of 55 places in 799 ms of which 11 ms to minimize.
[2024-05-26 15:44:28] [INFO ] Deduced a trap composed of 29 places in 829 ms of which 11 ms to minimize.
[2024-05-26 15:44:29] [INFO ] Deduced a trap composed of 16 places in 669 ms of which 8 ms to minimize.
[2024-05-26 15:44:30] [INFO ] Deduced a trap composed of 16 places in 577 ms of which 9 ms to minimize.
[2024-05-26 15:44:30] [INFO ] Deduced a trap composed of 16 places in 647 ms of which 9 ms to minimize.
[2024-05-26 15:44:31] [INFO ] Deduced a trap composed of 29 places in 746 ms of which 9 ms to minimize.
SMT process timed out in 30790ms, After SMT, problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 30814ms
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 31014 ms. Remains : 753/828 places, 1167/1242 transitions.
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 21 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:44:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 15:44:31] [INFO ] Computed 17 invariants in 5 ms
[2024-05-26 15:44:32] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-26 15:44:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:44:32] [INFO ] Invariant cache hit.
[2024-05-26 15:44:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:44:34] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 3039 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 15:44:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:44:34] [INFO ] Invariant cache hit.
[2024-05-26 15:44:34] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1950 variables, and 17 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 15:45:07] [INFO ] Deduced a trap composed of 41 places in 843 ms of which 12 ms to minimize.
[2024-05-26 15:45:08] [INFO ] Deduced a trap composed of 77 places in 733 ms of which 10 ms to minimize.
[2024-05-26 15:45:09] [INFO ] Deduced a trap composed of 51 places in 644 ms of which 10 ms to minimize.
[2024-05-26 15:45:10] [INFO ] Deduced a trap composed of 49 places in 837 ms of which 11 ms to minimize.
[2024-05-26 15:45:10] [INFO ] Deduced a trap composed of 45 places in 791 ms of which 10 ms to minimize.
[2024-05-26 15:45:11] [INFO ] Deduced a trap composed of 52 places in 782 ms of which 10 ms to minimize.
[2024-05-26 15:45:12] [INFO ] Deduced a trap composed of 22 places in 667 ms of which 10 ms to minimize.
[2024-05-26 15:45:13] [INFO ] Deduced a trap composed of 35 places in 731 ms of which 9 ms to minimize.
[2024-05-26 15:45:13] [INFO ] Deduced a trap composed of 20 places in 665 ms of which 10 ms to minimize.
[2024-05-26 15:45:14] [INFO ] Deduced a trap composed of 78 places in 628 ms of which 9 ms to minimize.
[2024-05-26 15:45:15] [INFO ] Deduced a trap composed of 63 places in 582 ms of which 6 ms to minimize.
[2024-05-26 15:45:15] [INFO ] Deduced a trap composed of 62 places in 512 ms of which 11 ms to minimize.
[2024-05-26 15:45:16] [INFO ] Deduced a trap composed of 119 places in 666 ms of which 6 ms to minimize.
[2024-05-26 15:45:16] [INFO ] Deduced a trap composed of 38 places in 511 ms of which 6 ms to minimize.
[2024-05-26 15:45:17] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 10 ms to minimize.
[2024-05-26 15:45:18] [INFO ] Deduced a trap composed of 58 places in 778 ms of which 10 ms to minimize.
[2024-05-26 15:45:18] [INFO ] Deduced a trap composed of 34 places in 752 ms of which 9 ms to minimize.
[2024-05-26 15:45:19] [INFO ] Deduced a trap composed of 18 places in 768 ms of which 10 ms to minimize.
[2024-05-26 15:45:20] [INFO ] Deduced a trap composed of 51 places in 814 ms of which 10 ms to minimize.
[2024-05-26 15:45:21] [INFO ] Deduced a trap composed of 105 places in 798 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 15:45:22] [INFO ] Deduced a trap composed of 72 places in 808 ms of which 10 ms to minimize.
[2024-05-26 15:45:23] [INFO ] Deduced a trap composed of 40 places in 882 ms of which 11 ms to minimize.
[2024-05-26 15:45:24] [INFO ] Deduced a trap composed of 16 places in 838 ms of which 13 ms to minimize.
[2024-05-26 15:45:25] [INFO ] Deduced a trap composed of 27 places in 679 ms of which 10 ms to minimize.
[2024-05-26 15:45:26] [INFO ] Deduced a trap composed of 38 places in 781 ms of which 9 ms to minimize.
[2024-05-26 15:45:27] [INFO ] Deduced a trap composed of 79 places in 809 ms of which 10 ms to minimize.
[2024-05-26 15:45:27] [INFO ] Deduced a trap composed of 47 places in 828 ms of which 10 ms to minimize.
[2024-05-26 15:45:28] [INFO ] Deduced a trap composed of 77 places in 788 ms of which 10 ms to minimize.
[2024-05-26 15:45:29] [INFO ] Deduced a trap composed of 50 places in 736 ms of which 10 ms to minimize.
[2024-05-26 15:45:30] [INFO ] Deduced a trap composed of 72 places in 640 ms of which 6 ms to minimize.
[2024-05-26 15:45:30] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 6 ms to minimize.
[2024-05-26 15:45:31] [INFO ] Deduced a trap composed of 61 places in 453 ms of which 6 ms to minimize.
[2024-05-26 15:45:31] [INFO ] Deduced a trap composed of 26 places in 495 ms of which 6 ms to minimize.
[2024-05-26 15:45:31] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2024-05-26 15:45:32] [INFO ] Deduced a trap composed of 64 places in 760 ms of which 7 ms to minimize.
[2024-05-26 15:45:33] [INFO ] Deduced a trap composed of 115 places in 568 ms of which 7 ms to minimize.
[2024-05-26 15:45:33] [INFO ] Deduced a trap composed of 35 places in 562 ms of which 7 ms to minimize.
[2024-05-26 15:45:34] [INFO ] Deduced a trap composed of 53 places in 730 ms of which 7 ms to minimize.
[2024-05-26 15:45:35] [INFO ] Deduced a trap composed of 18 places in 579 ms of which 10 ms to minimize.
SMT process timed out in 60549ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Finished structural reductions in LTL mode , in 1 iterations and 63629 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 343242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:45:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:45:35] [INFO ] Computed 23 invariants in 7 ms
[2024-05-26 15:45:36] [INFO ] Implicit Places using invariants in 415 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 418 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 14 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 457 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 287 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
Product exploration explored 100000 steps with 122 reset in 459 ms.
Product exploration explored 100000 steps with 110 reset in 417 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 p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 112 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 103 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 4396 steps (0 resets) in 33 ms. (129 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p3)))), (F (NOT p1)), (F (NOT p3)), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 18 factoid took 279 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 104 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 102 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 (Trivial Post-Agglo cleanup.) 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 0 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-26 15:45:38] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 474 cols
[2024-05-26 15:45:38] [INFO ] Computed 17 invariants in 4 ms
[2024-05-26 15:45:38] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-26 15:45:38] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-26 15:45:38] [INFO ] Invariant cache hit.
[2024-05-26 15:45:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:45:39] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2024-05-26 15:45:39] [INFO ] Redundant transitions in 9 ms returned []
Running 882 sub problems to find dead transitions.
[2024-05-26 15:45:39] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-26 15:45:39] [INFO ] Invariant cache hit.
[2024-05-26 15:45:39] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 15:45:52] [INFO ] Deduced a trap composed of 16 places in 519 ms of which 6 ms to minimize.
[2024-05-26 15:45:52] [INFO ] Deduced a trap composed of 36 places in 501 ms of which 6 ms to minimize.
[2024-05-26 15:45:53] [INFO ] Deduced a trap composed of 46 places in 451 ms of which 6 ms to minimize.
[2024-05-26 15:45:53] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 6 ms to minimize.
[2024-05-26 15:45:54] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 6 ms to minimize.
[2024-05-26 15:45:54] [INFO ] Deduced a trap composed of 28 places in 454 ms of which 6 ms to minimize.
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 5 ms to minimize.
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 6 ms to minimize.
[2024-05-26 15:45:55] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 6 ms to minimize.
[2024-05-26 15:45:56] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 6 ms to minimize.
[2024-05-26 15:45:56] [INFO ] Deduced a trap composed of 38 places in 435 ms of which 6 ms to minimize.
[2024-05-26 15:45:57] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 4 ms to minimize.
[2024-05-26 15:45:57] [INFO ] Deduced a trap composed of 14 places in 320 ms of which 5 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 6 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 6 ms to minimize.
[2024-05-26 15:45:58] [INFO ] Deduced a trap composed of 65 places in 340 ms of which 5 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 46 places in 353 ms of which 5 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 46 places in 355 ms of which 5 ms to minimize.
[2024-05-26 15:45:59] [INFO ] Deduced a trap composed of 46 places in 365 ms of which 5 ms to minimize.
[2024-05-26 15:46:00] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 15:46:01] [INFO ] Deduced a trap composed of 44 places in 517 ms of which 7 ms to minimize.
[2024-05-26 15:46:02] [INFO ] Deduced a trap composed of 63 places in 521 ms of which 6 ms to minimize.
[2024-05-26 15:46:02] [INFO ] Deduced a trap composed of 42 places in 503 ms of which 7 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 16 places in 522 ms of which 7 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 44 places in 479 ms of which 6 ms to minimize.
[2024-05-26 15:46:03] [INFO ] Deduced a trap composed of 65 places in 336 ms of which 5 ms to minimize.
[2024-05-26 15:46:04] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 5 ms to minimize.
[2024-05-26 15:46:04] [INFO ] Deduced a trap composed of 34 places in 416 ms of which 6 ms to minimize.
[2024-05-26 15:46:05] [INFO ] Deduced a trap composed of 34 places in 413 ms of which 6 ms to minimize.
[2024-05-26 15:46:05] [INFO ] Deduced a trap composed of 34 places in 401 ms of which 6 ms to minimize.
[2024-05-26 15:46:06] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 6 ms to minimize.
[2024-05-26 15:46:06] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 6 ms to minimize.
[2024-05-26 15:46:06] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 5 ms to minimize.
[2024-05-26 15:46:07] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 6 ms to minimize.
[2024-05-26 15:46:07] [INFO ] Deduced a trap composed of 45 places in 414 ms of which 6 ms to minimize.
[2024-05-26 15:46:08] [INFO ] Deduced a trap composed of 12 places in 433 ms of which 6 ms to minimize.
[2024-05-26 15:46:08] [INFO ] Deduced a trap composed of 26 places in 434 ms of which 6 ms to minimize.
[2024-05-26 15:46:09] [INFO ] Deduced a trap composed of 22 places in 348 ms of which 5 ms to minimize.
SMT process timed out in 30578ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 30588ms
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 31809 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 p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 221 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 153 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 972 steps (0 resets) in 33 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p3 p0 p1))), (F (NOT p1)), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 570 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 150 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 199 reset in 620 ms.
Stack based approach found an accepted trace after 3328 steps with 9 reset with depth 198 and stack size 192 in 24 ms.
FORMULA Peterson-COL-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-03 finished in 36380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 27 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:46:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:46:12] [INFO ] Computed 23 invariants in 7 ms
[2024-05-26 15:46:12] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-26 15:46:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:46:12] [INFO ] Invariant cache hit.
[2024-05-26 15:46:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:46:15] [INFO ] Implicit Places using invariants and state equation in 2672 ms returned []
Implicit Place search using SMT with State Equation took 3372 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 15:46:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:46:15] [INFO ] Invariant cache hit.
[2024-05-26 15:46:15] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 30418ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30433ms
Finished structural reductions in LTL mode , in 1 iterations and 33836 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
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Product exploration explored 100000 steps with 50000 reset in 406 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 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 35023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:46:47] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:46:47] [INFO ] Invariant cache hit.
[2024-05-26 15:46:47] [INFO ] Implicit Places using invariants in 756 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 758 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 18 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 786 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-07
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 1007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 0 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 63 ms. Remains 439 /834 variables (removed 395) and now considering 847/1242 (removed 395) transitions.
[2024-05-26 15:46:48] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2024-05-26 15:46:48] [INFO ] Computed 23 invariants in 4 ms
[2024-05-26 15:46:48] [INFO ] Implicit Places using invariants in 620 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 622 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 14 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 699 ms. Remains : 433/834 places, 847/1242 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-10
Product exploration explored 100000 steps with 3248 reset in 1010 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-10 finished in 1774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:46:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:46:49] [INFO ] Computed 23 invariants in 4 ms
[2024-05-26 15:46:50] [INFO ] Implicit Places using invariants in 306 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 308 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 14 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 337 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 135 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
Product exploration explored 100000 steps with 33333 reset in 1084 ms.
Product exploration explored 100000 steps with 33333 reset in 880 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 p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 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 2473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 30 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2024-05-26 15:46:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2024-05-26 15:46:52] [INFO ] Computed 23 invariants in 1 ms
[2024-05-26 15:46:52] [INFO ] Implicit Places using invariants in 287 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 290 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 13 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 334 ms. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 556 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-13 finished in 952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 34 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:46:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 15:46:53] [INFO ] Computed 23 invariants in 7 ms
[2024-05-26 15:46:54] [INFO ] Implicit Places using invariants in 705 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 708 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 19 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 764 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-5-LTLFireability-14
Product exploration explored 100000 steps with 129 reset in 1318 ms.
Stack based approach found an accepted trace after 6334 steps with 9 reset with depth 1883 and stack size 1876 in 79 ms.
FORMULA Peterson-COL-5-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-14 finished in 2349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 15:46:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 15:46:55] [INFO ] Invariant cache hit.
[2024-05-26 15:46:56] [INFO ] Implicit Places using invariants in 623 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 625 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 30 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 673 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 185 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
Product exploration explored 100000 steps with 2371 reset in 1471 ms.
Product exploration explored 100000 steps with 2335 reset in 1219 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 p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (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))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 298 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 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
[2024-05-26 15:46:59] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 15:46:59] [INFO ] Computed 17 invariants in 4 ms
[2024-05-26 15:46:59] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 762/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 762/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:01] [INFO ] Deduced a trap composed of 119 places in 675 ms of which 10 ms to minimize.
[2024-05-26 15:47:02] [INFO ] Deduced a trap composed of 155 places in 534 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:02] [INFO ] Deduced a trap composed of 99 places in 533 ms of which 8 ms to minimize.
[2024-05-26 15:47:03] [INFO ] Deduced a trap composed of 79 places in 547 ms of which 8 ms to minimize.
[2024-05-26 15:47:03] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:04] [INFO ] Deduced a trap composed of 202 places in 253 ms of which 4 ms to minimize.
[2024-05-26 15:47:04] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1920 variables, 798/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1920 variables, 205/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1920 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1920 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1950 variables, 30/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1950 variables, 5/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:05] [INFO ] Deduced a trap composed of 31 places in 506 ms of which 7 ms to minimize.
[2024-05-26 15:47:06] [INFO ] Deduced a trap composed of 16 places in 774 ms of which 10 ms to minimize.
SMT process timed out in 6584ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
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 (Trivial Post-Agglo cleanup.) 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 45 ms. Remains : 293/828 places, 707/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 4 ms. (steps per millisecond=15 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 5 ms. (steps per millisecond=12 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (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)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (NOT (OR (NOT p3) p1))), (F p3)]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 544 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 11483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 351 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 (Trivial Post-Agglo cleanup.) 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 52 ms. Remains 599 /834 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
[2024-05-26 15:47:07] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 599 cols
[2024-05-26 15:47:07] [INFO ] Computed 23 invariants in 9 ms
[2024-05-26 15:47:08] [INFO ] Implicit Places using invariants in 677 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 679 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 15 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 747 ms. Remains : 593/834 places, 1007/1242 transitions.
Running random walk in product with property : Peterson-COL-5-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 611 ms.
Product exploration explored 100000 steps with 0 reset in 438 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)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 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 250 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 570 ms. (70 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
[2024-05-26 15:47:10] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 15:47:10] [INFO ] Computed 17 invariants in 3 ms
[2024-05-26 15:47:10] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:47:12] [INFO ] Deduced a trap composed of 114 places in 477 ms of which 7 ms to minimize.
[2024-05-26 15:47:12] [INFO ] Deduced a trap composed of 140 places in 357 ms of which 6 ms to minimize.
[2024-05-26 15:47:12] [INFO ] Deduced a trap composed of 131 places in 517 ms of which 7 ms to minimize.
[2024-05-26 15:47:13] [INFO ] Deduced a trap composed of 54 places in 355 ms of which 4 ms to minimize.
[2024-05-26 15:47:13] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 3 ms to minimize.
[2024-05-26 15:47:13] [INFO ] Deduced a trap composed of 129 places in 224 ms of which 4 ms to minimize.
[2024-05-26 15:47:14] [INFO ] Deduced a trap composed of 84 places in 239 ms of which 4 ms to minimize.
[2024-05-26 15:47:14] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-05-26 15:47:14] [INFO ] Deduced a trap composed of 160 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 887/1450 variables, 563/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/1480 variables, 30/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 5/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:47:15] [INFO ] Deduced a trap composed of 58 places in 461 ms of which 7 ms to minimize.
[2024-05-26 15:47:16] [INFO ] Deduced a trap composed of 32 places in 508 ms of which 7 ms to minimize.
SMT process timed out in 6269ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
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 25 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 1234 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 412937 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :1 out of 2
Probabilistic random walk after 412937 steps, saw 140168 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :1
[2024-05-26 15:47:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:47:20] [INFO ] Invariant cache hit.
[2024-05-26 15:47:20] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:21] [INFO ] Deduced a trap composed of 84 places in 480 ms of which 7 ms to minimize.
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 54 places in 376 ms of which 6 ms to minimize.
[2024-05-26 15:47:22] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 89 places in 269 ms of which 5 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 105 places in 273 ms of which 4 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 117 places in 182 ms of which 3 ms to minimize.
[2024-05-26 15:47:23] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:25] [INFO ] Deduced a trap composed of 47 places in 426 ms of which 6 ms to minimize.
[2024-05-26 15:47:26] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 6 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 30 places in 347 ms of which 5 ms to minimize.
[2024-05-26 15:47:27] [INFO ] Deduced a trap composed of 74 places in 440 ms of which 7 ms to minimize.
[2024-05-26 15:47:28] [INFO ] Deduced a trap composed of 65 places in 515 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8402 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9353ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 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 18 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 479 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 426454 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 426454 steps, saw 142148 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2024-05-26 15:47:32] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:47:32] [INFO ] Invariant cache hit.
[2024-05-26 15:47:32] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:34] [INFO ] Deduced a trap composed of 84 places in 469 ms of which 8 ms to minimize.
[2024-05-26 15:47:34] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 6 ms to minimize.
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:35] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 4 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:47:36] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:47:38] [INFO ] Deduced a trap composed of 47 places in 424 ms of which 7 ms to minimize.
[2024-05-26 15:47:39] [INFO ] Deduced a trap composed of 11 places in 484 ms of which 7 ms to minimize.
[2024-05-26 15:47:39] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 6 ms to minimize.
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 74 places in 412 ms of which 6 ms to minimize.
[2024-05-26 15:47:40] [INFO ] Deduced a trap composed of 65 places in 402 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9059ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 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 17 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.
Starting structural reductions in REACHABILITY 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-26 15:47:42] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:47:42] [INFO ] Invariant cache hit.
[2024-05-26 15:47:42] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-05-26 15:47:42] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:47:42] [INFO ] Invariant cache hit.
[2024-05-26 15:47:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:47:45] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 3044 ms to find 0 implicit places.
[2024-05-26 15:47:45] [INFO ] Redundant transitions in 16 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:47:45] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:47:45] [INFO ] Invariant cache hit.
[2024-05-26 15:47:45] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:48:04] [INFO ] Deduced a trap composed of 74 places in 573 ms of which 8 ms to minimize.
[2024-05-26 15:48:05] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 7 ms to minimize.
[2024-05-26 15:48:05] [INFO ] Deduced a trap composed of 41 places in 325 ms of which 4 ms to minimize.
[2024-05-26 15:48:06] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 4 ms to minimize.
[2024-05-26 15:48:06] [INFO ] Deduced a trap composed of 38 places in 337 ms of which 8 ms to minimize.
[2024-05-26 15:48:07] [INFO ] Deduced a trap composed of 29 places in 472 ms of which 7 ms to minimize.
[2024-05-26 15:48:07] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 7 ms to minimize.
[2024-05-26 15:48:07] [INFO ] Deduced a trap composed of 82 places in 398 ms of which 5 ms to minimize.
[2024-05-26 15:48:08] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 4 ms to minimize.
[2024-05-26 15:48:08] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 4 ms to minimize.
[2024-05-26 15:48:08] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 5 ms to minimize.
[2024-05-26 15:48:09] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 5 ms to minimize.
[2024-05-26 15:48:09] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 5 ms to minimize.
[2024-05-26 15:48:09] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 7 ms to minimize.
[2024-05-26 15:48:10] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 7 ms to minimize.
[2024-05-26 15:48:11] [INFO ] Deduced a trap composed of 29 places in 547 ms of which 8 ms to minimize.
[2024-05-26 15:48:11] [INFO ] Deduced a trap composed of 29 places in 531 ms of which 8 ms to minimize.
[2024-05-26 15:48:12] [INFO ] Deduced a trap composed of 26 places in 498 ms of which 7 ms to minimize.
[2024-05-26 15:48:12] [INFO ] Deduced a trap composed of 32 places in 393 ms of which 6 ms to minimize.
[2024-05-26 15:48:12] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:48:13] [INFO ] Deduced a trap composed of 53 places in 321 ms of which 5 ms to minimize.
[2024-05-26 15:48:14] [INFO ] Deduced a trap composed of 14 places in 482 ms of which 7 ms to minimize.
[2024-05-26 15:48:15] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 8 ms to minimize.
[2024-05-26 15:48:15] [INFO ] Deduced a trap composed of 105 places in 418 ms of which 6 ms to minimize.
[2024-05-26 15:48:16] [INFO ] Deduced a trap composed of 44 places in 543 ms of which 8 ms to minimize.
SMT process timed out in 30788ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33893 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
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 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 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 (Empty/Sink Transition effects.) 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 (Redundant composition of simpler 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 (Empty/Sink Transition effects.) 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 102 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-26 15:48:16] [INFO ] Computed 6 invariants in 2 ms
[2024-05-26 15:48:16] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:48:16] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 15:48:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 15:48:17] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 15:48:17] [INFO ] After 1218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 15:48:18] [INFO ] After 1830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2132 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 219 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 304 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 246 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 15:48:18] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 15:48:18] [INFO ] Computed 17 invariants in 3 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 2 factoid took 164 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)]
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 8 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 15:48:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:48:20] [INFO ] Invariant cache hit.
[2024-05-26 15:48:20] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-26 15:48:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:48:20] [INFO ] Invariant cache hit.
[2024-05-26 15:48:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:48:23] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:48:23] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:48:23] [INFO ] Invariant cache hit.
[2024-05-26 15:48:23] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:48:38] [INFO ] Deduced a trap composed of 74 places in 581 ms of which 8 ms to minimize.
[2024-05-26 15:48:39] [INFO ] Deduced a trap composed of 35 places in 551 ms of which 8 ms to minimize.
[2024-05-26 15:48:39] [INFO ] Deduced a trap composed of 41 places in 561 ms of which 8 ms to minimize.
[2024-05-26 15:48:40] [INFO ] Deduced a trap composed of 55 places in 588 ms of which 7 ms to minimize.
[2024-05-26 15:48:41] [INFO ] Deduced a trap composed of 38 places in 568 ms of which 8 ms to minimize.
[2024-05-26 15:48:41] [INFO ] Deduced a trap composed of 29 places in 604 ms of which 8 ms to minimize.
[2024-05-26 15:48:42] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 7 ms to minimize.
[2024-05-26 15:48:42] [INFO ] Deduced a trap composed of 82 places in 472 ms of which 5 ms to minimize.
[2024-05-26 15:48:43] [INFO ] Deduced a trap composed of 53 places in 347 ms of which 5 ms to minimize.
[2024-05-26 15:48:43] [INFO ] Deduced a trap composed of 16 places in 437 ms of which 7 ms to minimize.
[2024-05-26 15:48:43] [INFO ] Deduced a trap composed of 29 places in 321 ms of which 4 ms to minimize.
[2024-05-26 15:48:44] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 4 ms to minimize.
[2024-05-26 15:48:44] [INFO ] Deduced a trap composed of 16 places in 333 ms of which 5 ms to minimize.
[2024-05-26 15:48:45] [INFO ] Deduced a trap composed of 30 places in 462 ms of which 7 ms to minimize.
[2024-05-26 15:48:45] [INFO ] Deduced a trap composed of 24 places in 387 ms of which 4 ms to minimize.
[2024-05-26 15:48:45] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 7 ms to minimize.
[2024-05-26 15:48:46] [INFO ] Deduced a trap composed of 29 places in 536 ms of which 7 ms to minimize.
[2024-05-26 15:48:46] [INFO ] Deduced a trap composed of 26 places in 551 ms of which 7 ms to minimize.
[2024-05-26 15:48:47] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 6 ms to minimize.
[2024-05-26 15:48:47] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:48:48] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 4 ms to minimize.
[2024-05-26 15:48:48] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 5 ms to minimize.
[2024-05-26 15:48:49] [INFO ] Deduced a trap composed of 20 places in 333 ms of which 7 ms to minimize.
[2024-05-26 15:48:49] [INFO ] Deduced a trap composed of 105 places in 374 ms of which 6 ms to minimize.
[2024-05-26 15:48:49] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 5 ms to minimize.
[2024-05-26 15:48:50] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 4 ms to minimize.
[2024-05-26 15:48:50] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 3 ms to minimize.
[2024-05-26 15:48:50] [INFO ] Deduced a trap composed of 105 places in 289 ms of which 5 ms to minimize.
[2024-05-26 15:48:51] [INFO ] Deduced a trap composed of 59 places in 283 ms of which 5 ms to minimize.
[2024-05-26 15:48:51] [INFO ] Deduced a trap composed of 95 places in 253 ms of which 4 ms to minimize.
[2024-05-26 15:48:51] [INFO ] Deduced a trap composed of 20 places in 333 ms of which 6 ms to minimize.
[2024-05-26 15:48:52] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 7 ms to minimize.
[2024-05-26 15:48:52] [INFO ] Deduced a trap composed of 17 places in 497 ms of which 8 ms to minimize.
[2024-05-26 15:48:53] [INFO ] Deduced a trap composed of 23 places in 576 ms of which 8 ms to minimize.
[2024-05-26 15:48:54] [INFO ] Deduced a trap composed of 17 places in 548 ms of which 8 ms to minimize.
SMT process timed out in 30898ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30914ms
Finished structural reductions in LTL mode , in 1 iterations and 33730 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))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 114 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 358 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 776 ms. (51 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
[2024-05-26 15:48:55] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:48:55] [INFO ] Invariant cache hit.
[2024-05-26 15:48:55] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:48:57] [INFO ] Deduced a trap composed of 84 places in 652 ms of which 8 ms to minimize.
[2024-05-26 15:48:57] [INFO ] Deduced a trap composed of 105 places in 500 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 887/1450 variables, 563/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 205/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/1480 variables, 30/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 5/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:48:59] [INFO ] Deduced a trap composed of 50 places in 438 ms of which 6 ms to minimize.
[2024-05-26 15:49:00] [INFO ] Deduced a trap composed of 68 places in 524 ms of which 7 ms to minimize.
[2024-05-26 15:49:00] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 5 ms to minimize.
[2024-05-26 15:49:01] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 5 ms to minimize.
[2024-05-26 15:49:01] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 6 ms to minimize.
SMT process timed out in 6646ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
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 16 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 17 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 1486 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 451703 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :1 out of 2
Probabilistic random walk after 451703 steps, saw 145878 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :1
[2024-05-26 15:49:05] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:49:05] [INFO ] Invariant cache hit.
[2024-05-26 15:49:05] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:06] [INFO ] Deduced a trap composed of 84 places in 295 ms of which 5 ms to minimize.
[2024-05-26 15:49:06] [INFO ] Deduced a trap composed of 121 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:06] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 3 ms to minimize.
[2024-05-26 15:49:07] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:07] [INFO ] Deduced a trap composed of 89 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:49:07] [INFO ] Deduced a trap composed of 105 places in 249 ms of which 3 ms to minimize.
[2024-05-26 15:49:07] [INFO ] Deduced a trap composed of 117 places in 98 ms of which 2 ms to minimize.
[2024-05-26 15:49:07] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:09] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 5 ms to minimize.
[2024-05-26 15:49:09] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 5 ms to minimize.
[2024-05-26 15:49:09] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 4 ms to minimize.
[2024-05-26 15:49:10] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:49:10] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5644 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 6372ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 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 15 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 15 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 454 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370832 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370832 steps, saw 134184 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-26 15:49:15] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:49:15] [INFO ] Invariant cache hit.
[2024-05-26 15:49:15] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:16] [INFO ] Deduced a trap composed of 84 places in 428 ms of which 6 ms to minimize.
[2024-05-26 15:49:17] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:17] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-05-26 15:49:17] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:17] [INFO ] Deduced a trap composed of 89 places in 204 ms of which 4 ms to minimize.
[2024-05-26 15:49:17] [INFO ] Deduced a trap composed of 105 places in 251 ms of which 5 ms to minimize.
[2024-05-26 15:49:18] [INFO ] Deduced a trap composed of 117 places in 131 ms of which 2 ms to minimize.
[2024-05-26 15:49:18] [INFO ] Deduced a trap composed of 111 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 15:49:20] [INFO ] Deduced a trap composed of 47 places in 437 ms of which 6 ms to minimize.
[2024-05-26 15:49:20] [INFO ] Deduced a trap composed of 11 places in 435 ms of which 7 ms to minimize.
[2024-05-26 15:49:21] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 6 ms to minimize.
[2024-05-26 15:49:21] [INFO ] Deduced a trap composed of 74 places in 423 ms of which 6 ms to minimize.
[2024-05-26 15:49:22] [INFO ] Deduced a trap composed of 65 places in 510 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7668 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8784ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 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.
Starting structural reductions in REACHABILITY 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-26 15:49:24] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:49:24] [INFO ] Invariant cache hit.
[2024-05-26 15:49:24] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-26 15:49:24] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:49:24] [INFO ] Invariant cache hit.
[2024-05-26 15:49:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:49:26] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 2968 ms to find 0 implicit places.
[2024-05-26 15:49:27] [INFO ] Redundant transitions in 14 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:49:27] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:49:27] [INFO ] Invariant cache hit.
[2024-05-26 15:49:27] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:49:46] [INFO ] Deduced a trap composed of 74 places in 639 ms of which 9 ms to minimize.
[2024-05-26 15:49:47] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 7 ms to minimize.
[2024-05-26 15:49:47] [INFO ] Deduced a trap composed of 41 places in 558 ms of which 8 ms to minimize.
[2024-05-26 15:49:48] [INFO ] Deduced a trap composed of 55 places in 581 ms of which 8 ms to minimize.
[2024-05-26 15:49:48] [INFO ] Deduced a trap composed of 38 places in 605 ms of which 8 ms to minimize.
[2024-05-26 15:49:49] [INFO ] Deduced a trap composed of 29 places in 592 ms of which 8 ms to minimize.
[2024-05-26 15:49:50] [INFO ] Deduced a trap composed of 17 places in 569 ms of which 7 ms to minimize.
[2024-05-26 15:49:50] [INFO ] Deduced a trap composed of 82 places in 544 ms of which 7 ms to minimize.
[2024-05-26 15:49:51] [INFO ] Deduced a trap composed of 53 places in 574 ms of which 7 ms to minimize.
[2024-05-26 15:49:51] [INFO ] Deduced a trap composed of 16 places in 558 ms of which 8 ms to minimize.
[2024-05-26 15:49:52] [INFO ] Deduced a trap composed of 29 places in 517 ms of which 7 ms to minimize.
[2024-05-26 15:49:53] [INFO ] Deduced a trap composed of 29 places in 564 ms of which 7 ms to minimize.
[2024-05-26 15:49:53] [INFO ] Deduced a trap composed of 16 places in 512 ms of which 7 ms to minimize.
[2024-05-26 15:49:54] [INFO ] Deduced a trap composed of 30 places in 565 ms of which 8 ms to minimize.
[2024-05-26 15:49:54] [INFO ] Deduced a trap composed of 24 places in 548 ms of which 7 ms to minimize.
[2024-05-26 15:49:55] [INFO ] Deduced a trap composed of 29 places in 550 ms of which 8 ms to minimize.
[2024-05-26 15:49:55] [INFO ] Deduced a trap composed of 29 places in 538 ms of which 7 ms to minimize.
[2024-05-26 15:49:56] [INFO ] Deduced a trap composed of 26 places in 563 ms of which 8 ms to minimize.
[2024-05-26 15:49:56] [INFO ] Deduced a trap composed of 32 places in 432 ms of which 5 ms to minimize.
[2024-05-26 15:49:57] [INFO ] Deduced a trap composed of 11 places in 428 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1480 variables, and 37 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/593 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1001/1001 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:50:00] [INFO ] Deduced a trap composed of 14 places in 543 ms of which 7 ms to minimize.
[2024-05-26 15:50:00] [INFO ] Deduced a trap composed of 20 places in 535 ms of which 7 ms to minimize.
[2024-05-26 15:50:01] [INFO ] Deduced a trap composed of 23 places in 454 ms of which 6 ms to minimize.
[2024-05-26 15:50:01] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 5 ms to minimize.
[2024-05-26 15:50:02] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 5 ms to minimize.
[2024-05-26 15:50:02] [INFO ] Deduced a trap composed of 56 places in 344 ms of which 5 ms to minimize.
[2024-05-26 15:50:03] [INFO ] Deduced a trap composed of 151 places in 499 ms of which 7 ms to minimize.
[2024-05-26 15:50:03] [INFO ] Deduced a trap composed of 157 places in 366 ms of which 5 ms to minimize.
[2024-05-26 15:50:03] [INFO ] Deduced a trap composed of 63 places in 476 ms of which 7 ms to minimize.
[2024-05-26 15:50:04] [INFO ] Deduced a trap composed of 101 places in 488 ms of which 7 ms to minimize.
[2024-05-26 15:50:04] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 3 ms to minimize.
[2024-05-26 15:50:04] [INFO ] Deduced a trap composed of 113 places in 239 ms of which 3 ms to minimize.
[2024-05-26 15:50:05] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 4 ms to minimize.
[2024-05-26 15:50:05] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 6 ms to minimize.
[2024-05-26 15:50:06] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 7 ms to minimize.
[2024-05-26 15:50:06] [INFO ] Deduced a trap composed of 59 places in 420 ms of which 5 ms to minimize.
[2024-05-26 15:50:07] [INFO ] Deduced a trap composed of 78 places in 352 ms of which 4 ms to minimize.
[2024-05-26 15:50:07] [INFO ] Deduced a trap composed of 139 places in 339 ms of which 4 ms to minimize.
[2024-05-26 15:50:07] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 8 ms to minimize.
[2024-05-26 15:50:08] [INFO ] Deduced a trap composed of 77 places in 407 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:50:09] [INFO ] Deduced a trap composed of 92 places in 433 ms of which 6 ms to minimize.
[2024-05-26 15:50:10] [INFO ] Deduced a trap composed of 61 places in 483 ms of which 7 ms to minimize.
[2024-05-26 15:50:10] [INFO ] Deduced a trap composed of 87 places in 483 ms of which 7 ms to minimize.
[2024-05-26 15:50:11] [INFO ] Deduced a trap composed of 56 places in 486 ms of which 6 ms to minimize.
[2024-05-26 15:50:11] [INFO ] Deduced a trap composed of 38 places in 479 ms of which 7 ms to minimize.
[2024-05-26 15:50:12] [INFO ] Deduced a trap composed of 61 places in 489 ms of which 7 ms to minimize.
[2024-05-26 15:50:12] [INFO ] Deduced a trap composed of 50 places in 469 ms of which 6 ms to minimize.
[2024-05-26 15:50:12] [INFO ] Deduced a trap composed of 129 places in 408 ms of which 5 ms to minimize.
[2024-05-26 15:50:13] [INFO ] Deduced a trap composed of 114 places in 332 ms of which 4 ms to minimize.
[2024-05-26 15:50:13] [INFO ] Deduced a trap composed of 95 places in 310 ms of which 4 ms to minimize.
[2024-05-26 15:50:13] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 5 ms to minimize.
[2024-05-26 15:50:14] [INFO ] Deduced a trap composed of 71 places in 351 ms of which 7 ms to minimize.
[2024-05-26 15:50:14] [INFO ] Deduced a trap composed of 129 places in 402 ms of which 4 ms to minimize.
[2024-05-26 15:50:14] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 4 ms to minimize.
[2024-05-26 15:50:15] [INFO ] Deduced a trap composed of 42 places in 330 ms of which 5 ms to minimize.
[2024-05-26 15:50:15] [INFO ] Deduced a trap composed of 83 places in 483 ms of which 8 ms to minimize.
[2024-05-26 15:50:16] [INFO ] Deduced a trap composed of 75 places in 490 ms of which 8 ms to minimize.
[2024-05-26 15:50:16] [INFO ] Deduced a trap composed of 111 places in 477 ms of which 7 ms to minimize.
[2024-05-26 15:50:17] [INFO ] Deduced a trap composed of 62 places in 496 ms of which 7 ms to minimize.
[2024-05-26 15:50:17] [INFO ] Deduced a trap composed of 76 places in 467 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:50:19] [INFO ] Deduced a trap composed of 63 places in 591 ms of which 8 ms to minimize.
[2024-05-26 15:50:20] [INFO ] Deduced a trap composed of 99 places in 525 ms of which 7 ms to minimize.
[2024-05-26 15:50:20] [INFO ] Deduced a trap composed of 119 places in 520 ms of which 7 ms to minimize.
[2024-05-26 15:50:21] [INFO ] Deduced a trap composed of 119 places in 508 ms of which 7 ms to minimize.
[2024-05-26 15:50:21] [INFO ] Deduced a trap composed of 65 places in 504 ms of which 7 ms to minimize.
[2024-05-26 15:50:22] [INFO ] Deduced a trap composed of 70 places in 471 ms of which 7 ms to minimize.
[2024-05-26 15:50:22] [INFO ] Deduced a trap composed of 56 places in 438 ms of which 6 ms to minimize.
[2024-05-26 15:50:23] [INFO ] Deduced a trap composed of 42 places in 476 ms of which 7 ms to minimize.
[2024-05-26 15:50:23] [INFO ] Deduced a trap composed of 56 places in 626 ms of which 9 ms to minimize.
[2024-05-26 15:50:24] [INFO ] Deduced a trap composed of 17 places in 645 ms of which 12 ms to minimize.
[2024-05-26 15:50:25] [INFO ] Deduced a trap composed of 61 places in 606 ms of which 8 ms to minimize.
[2024-05-26 15:50:25] [INFO ] Deduced a trap composed of 57 places in 597 ms of which 8 ms to minimize.
[2024-05-26 15:50:26] [INFO ] Deduced a trap composed of 38 places in 465 ms of which 7 ms to minimize.
[2024-05-26 15:50:27] [INFO ] Deduced a trap composed of 35 places in 633 ms of which 8 ms to minimize.
[2024-05-26 15:50:27] [INFO ] Deduced a trap composed of 47 places in 645 ms of which 8 ms to minimize.
SMT process timed out in 60688ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 60703ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63710 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
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 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 (Empty/Sink Transition effects.) 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 (Redundant composition of simpler 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 (Empty/Sink Transition effects.) 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 98 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-26 15:50:27] [INFO ] Computed 6 invariants in 2 ms
[2024-05-26 15:50:27] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:50:28] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 15:50:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 15:50:28] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 15:50:29] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 15:50:29] [INFO ] After 1748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2050 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 214 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 352 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 353 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 15:50:30] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 15:50:30] [INFO ] Computed 17 invariants in 4 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 1 factoid took 240 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 351 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 356 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 590 ms.
Product exploration explored 100000 steps with 2 reset in 495 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 237 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 11 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 15:50:34] [INFO ] Redundant transitions in 11 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:50:34] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:50:34] [INFO ] Invariant cache hit.
[2024-05-26 15:50:34] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:50:53] [INFO ] Deduced a trap composed of 74 places in 626 ms of which 8 ms to minimize.
[2024-05-26 15:50:53] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 7 ms to minimize.
[2024-05-26 15:50:54] [INFO ] Deduced a trap composed of 41 places in 561 ms of which 8 ms to minimize.
[2024-05-26 15:50:55] [INFO ] Deduced a trap composed of 55 places in 573 ms of which 7 ms to minimize.
[2024-05-26 15:50:55] [INFO ] Deduced a trap composed of 38 places in 594 ms of which 8 ms to minimize.
[2024-05-26 15:50:56] [INFO ] Deduced a trap composed of 29 places in 580 ms of which 8 ms to minimize.
[2024-05-26 15:50:56] [INFO ] Deduced a trap composed of 17 places in 562 ms of which 7 ms to minimize.
[2024-05-26 15:50:57] [INFO ] Deduced a trap composed of 82 places in 546 ms of which 7 ms to minimize.
[2024-05-26 15:50:58] [INFO ] Deduced a trap composed of 53 places in 492 ms of which 7 ms to minimize.
[2024-05-26 15:50:58] [INFO ] Deduced a trap composed of 16 places in 532 ms of which 7 ms to minimize.
[2024-05-26 15:50:59] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 7 ms to minimize.
[2024-05-26 15:50:59] [INFO ] Deduced a trap composed of 29 places in 503 ms of which 7 ms to minimize.
[2024-05-26 15:51:00] [INFO ] Deduced a trap composed of 16 places in 506 ms of which 7 ms to minimize.
[2024-05-26 15:51:00] [INFO ] Deduced a trap composed of 30 places in 561 ms of which 9 ms to minimize.
[2024-05-26 15:51:01] [INFO ] Deduced a trap composed of 24 places in 554 ms of which 8 ms to minimize.
[2024-05-26 15:51:01] [INFO ] Deduced a trap composed of 29 places in 532 ms of which 7 ms to minimize.
[2024-05-26 15:51:02] [INFO ] Deduced a trap composed of 29 places in 507 ms of which 7 ms to minimize.
[2024-05-26 15:51:02] [INFO ] Deduced a trap composed of 26 places in 531 ms of which 7 ms to minimize.
[2024-05-26 15:51:03] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 6 ms to minimize.
[2024-05-26 15:51:03] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:51:04] [INFO ] Deduced a trap composed of 53 places in 382 ms of which 6 ms to minimize.
SMT process timed out in 30278ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30319 ms. Remains : 593/593 places, 1007/1007 transitions.
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 8 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 15:51:04] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:51:04] [INFO ] Invariant cache hit.
[2024-05-26 15:51:05] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-26 15:51:05] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:51:05] [INFO ] Invariant cache hit.
[2024-05-26 15:51:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 15:51:07] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 2964 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-05-26 15:51:07] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 15:51:07] [INFO ] Invariant cache hit.
[2024-05-26 15:51:07] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:51:26] [INFO ] Deduced a trap composed of 74 places in 567 ms of which 7 ms to minimize.
[2024-05-26 15:51:27] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 7 ms to minimize.
[2024-05-26 15:51:27] [INFO ] Deduced a trap composed of 41 places in 550 ms of which 8 ms to minimize.
[2024-05-26 15:51:28] [INFO ] Deduced a trap composed of 55 places in 545 ms of which 7 ms to minimize.
[2024-05-26 15:51:28] [INFO ] Deduced a trap composed of 38 places in 569 ms of which 7 ms to minimize.
[2024-05-26 15:51:29] [INFO ] Deduced a trap composed of 29 places in 577 ms of which 8 ms to minimize.
[2024-05-26 15:51:30] [INFO ] Deduced a trap composed of 17 places in 554 ms of which 8 ms to minimize.
[2024-05-26 15:51:30] [INFO ] Deduced a trap composed of 82 places in 504 ms of which 7 ms to minimize.
[2024-05-26 15:51:31] [INFO ] Deduced a trap composed of 53 places in 546 ms of which 7 ms to minimize.
[2024-05-26 15:51:31] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 6 ms to minimize.
[2024-05-26 15:51:32] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 6 ms to minimize.
[2024-05-26 15:51:32] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 6 ms to minimize.
[2024-05-26 15:51:33] [INFO ] Deduced a trap composed of 16 places in 437 ms of which 6 ms to minimize.
[2024-05-26 15:51:33] [INFO ] Deduced a trap composed of 30 places in 459 ms of which 7 ms to minimize.
[2024-05-26 15:51:34] [INFO ] Deduced a trap composed of 24 places in 466 ms of which 6 ms to minimize.
[2024-05-26 15:51:34] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 6 ms to minimize.
[2024-05-26 15:51:34] [INFO ] Deduced a trap composed of 29 places in 440 ms of which 6 ms to minimize.
[2024-05-26 15:51:35] [INFO ] Deduced a trap composed of 26 places in 401 ms of which 5 ms to minimize.
[2024-05-26 15:51:35] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 5 ms to minimize.
[2024-05-26 15:51:35] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 15:51:36] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 6 ms to minimize.
[2024-05-26 15:51:37] [INFO ] Deduced a trap composed of 14 places in 467 ms of which 7 ms to minimize.
[2024-05-26 15:51:37] [INFO ] Deduced a trap composed of 20 places in 537 ms of which 8 ms to minimize.
[2024-05-26 15:51:38] [INFO ] Deduced a trap composed of 105 places in 425 ms of which 6 ms to minimize.
SMT process timed out in 30715ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30731ms
Finished structural reductions in LTL mode , in 1 iterations and 33707 ms. Remains : 593/593 places, 1007/1007 transitions.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 271318 ms.
[2024-05-26 15:51:38] [INFO ] Flatten gal took : 103 ms
[2024-05-26 15:51:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-26 15:51:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 18 ms.
Total runtime 752001 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-5

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 834
TRANSITIONS: 1242
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.009s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3724
MODEL NAME: /home/mcc/execution/412/model
834 places, 1242 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="greatspnxred"
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 greatspnxred"
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 r267-smll-171654406000228"
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 ;