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-171654406300396.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 Philosophers-COL-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406300396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K Apr 13 09:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 09:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 09:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 09:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 09:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 13 09:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K 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 Philosophers-COL-000020-LTLFireability-00
FORMULA_NAME Philosophers-COL-000020-LTLFireability-01
FORMULA_NAME Philosophers-COL-000020-LTLFireability-02
FORMULA_NAME Philosophers-COL-000020-LTLFireability-03
FORMULA_NAME Philosophers-COL-000020-LTLFireability-04
FORMULA_NAME Philosophers-COL-000020-LTLFireability-05
FORMULA_NAME Philosophers-COL-000020-LTLFireability-06
FORMULA_NAME Philosophers-COL-000020-LTLFireability-07
FORMULA_NAME Philosophers-COL-000020-LTLFireability-08
FORMULA_NAME Philosophers-COL-000020-LTLFireability-09
FORMULA_NAME Philosophers-COL-000020-LTLFireability-10
FORMULA_NAME Philosophers-COL-000020-LTLFireability-11
FORMULA_NAME Philosophers-COL-000020-LTLFireability-12
FORMULA_NAME Philosophers-COL-000020-LTLFireability-13
FORMULA_NAME Philosophers-COL-000020-LTLFireability-14
FORMULA_NAME Philosophers-COL-000020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716849627746

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:40:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:40:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:40:30] [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-27 22:40:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:40:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1077 ms
[2024-05-27 22:40:31] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:40:31] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 19 ms.
[2024-05-27 22:40:31] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 26074 steps (1183 resets) in 319 ms. (81 steps per ms) remains 0/4 properties
[2024-05-27 22:40:31] [INFO ] Flatten gal took : 39 ms
[2024-05-27 22:40:31] [INFO ] Flatten gal took : 6 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 20) 20) 20)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 22:40:31] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions 320 arcs in 38 ms.
[2024-05-27 22:40:31] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 39 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2024-05-27 22:40:32] [INFO ] Computed 40 invariants in 18 ms
[2024-05-27 22:40:32] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-27 22:40:32] [INFO ] Invariant cache hit.
[2024-05-27 22:40:32] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3709ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3732ms
Finished structural reductions in LTL mode , in 1 iterations and 4308 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2024-05-27 22:40:36] [INFO ] Flatten gal took : 25 ms
[2024-05-27 22:40:36] [INFO ] Flatten gal took : 30 ms
[2024-05-27 22:40:36] [INFO ] Input system was already deterministic with 100 transitions.
Reduction of identical properties reduced properties to check from 11 to 8
RANDOM walk for 236 steps (0 resets) in 26 ms. (8 steps per ms) remains 0/8 properties
FORMULA Philosophers-COL-000020-LTLFireability-08 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' '!(X(F(p0)))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:40:37] [INFO ] Invariant cache hit.
[2024-05-27 22:40:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 22:40:37] [INFO ] Invariant cache hit.
[2024-05-27 22:40:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:40:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3383ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3386ms
Finished structural reductions in LTL mode , in 1 iterations and 3602 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 746 ms.
Product exploration explored 100000 steps with 50000 reset in 534 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000020-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000020-LTLFireability-00 finished in 5232 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(p1)))||((p0||X(p1))&&F(G(p1))))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:40:42] [INFO ] Invariant cache hit.
[2024-05-27 22:40:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-27 22:40:42] [INFO ] Invariant cache hit.
[2024-05-27 22:40:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:40:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3322ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3325ms
Finished structural reductions in LTL mode , in 1 iterations and 3547 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-01
Product exploration explored 100000 steps with 183 reset in 856 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 Philosophers-COL-000020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-01 finished in 4533 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)||(G(F(!p1)) U G(p2))))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:40:46] [INFO ] Invariant cache hit.
[2024-05-27 22:40:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-27 22:40:46] [INFO ] Invariant cache hit.
[2024-05-27 22:40:46] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-27 22:40:46] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-27 22:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1886 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1921 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3822ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3823ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3969 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND p0 (NOT p2)), p1, (AND p1 p2), (NOT p2), (AND p1 p2 p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-03
Product exploration explored 100000 steps with 4738 reset in 602 ms.
Stack based approach found an accepted trace after 1168 steps with 52 reset with depth 51 and stack size 51 in 9 ms.
FORMULA Philosophers-COL-000020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-03 finished in 4847 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 U (F(p0)&&((!p2 U p3)||p1)))))'
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:40:51] [INFO ] Invariant cache hit.
[2024-05-27 22:40:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 22:40:51] [INFO ] Invariant cache hit.
[2024-05-27 22:40:51] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-27 22:40:51] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-27 22:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3592ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3594ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3736 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-04
Product exploration explored 100000 steps with 10333 reset in 777 ms.
Product exploration explored 100000 steps with 10310 reset in 888 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 p0) (NOT p1) p3 p2), (X p3), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (OR p0 p1 p3 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X p3)), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p0 p1 p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 25 factoid took 772 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (68 resets) in 1344 ms. (29 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40002 steps (16 resets) in 1829 ms. (21 steps per ms) remains 1/1 properties
[2024-05-27 22:40:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf12 is UNSAT
After SMT solving in domain Int declared 100/200 variables, and 40 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/100 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X p3), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (OR p0 p1 p3 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X p3)), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p0 p1 p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (G (OR p0 (NOT p1) p3 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p3 (NOT p2)))), (F (NOT (OR (NOT p0) p1 p3 p2))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F p1), (F (NOT (OR p3 p2))), (F p0), (F (NOT (OR p0 p3 p2))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3 p2))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT p3)), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F (NOT (OR p3 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p3 (NOT p2))))
Knowledge based reduction with 26 factoid took 876 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000020-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000020-LTLFireability-04 finished in 9322 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 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:01] [INFO ] Invariant cache hit.
[2024-05-27 22:41:01] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 22:41:01] [INFO ] Invariant cache hit.
[2024-05-27 22:41:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-27 22:41:01] [INFO ] Redundant transitions in 3 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3607ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3610ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3844 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-05
Product exploration explored 100000 steps with 173 reset in 719 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 56 in 0 ms.
FORMULA Philosophers-COL-000020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-05 finished in 4622 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)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:05] [INFO ] Invariant cache hit.
[2024-05-27 22:41:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 22:41:05] [INFO ] Invariant cache hit.
[2024-05-27 22:41:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2063 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3672ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3673ms
Finished structural reductions in LTL mode , in 1 iterations and 3869 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-09
Stuttering criterion allowed to conclude after 43079 steps with 13702 reset in 236 ms.
FORMULA Philosophers-COL-000020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-09 finished in 4198 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)&&((p2 U p3)||p1))))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:09] [INFO ] Invariant cache hit.
[2024-05-27 22:41:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 22:41:09] [INFO ] Invariant cache hit.
[2024-05-27 22:41:10] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3883ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3884ms
Finished structural reductions in LTL mode , in 1 iterations and 4106 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-10
Product exploration explored 100000 steps with 33330 reset in 1223 ms.
Product exploration explored 100000 steps with 33199 reset in 897 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) p3 (NOT p2) (NOT p0)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-05-27 22:41:17] [INFO ] Invariant cache hit.
[2024-05-27 22:41:17] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-27 22:41:17] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-27 22:41:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:41:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 511 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000020-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000020-LTLFireability-10 finished in 8852 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(!p0)&&G((!p0||G(p0)))))))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:18] [INFO ] Invariant cache hit.
[2024-05-27 22:41:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 22:41:18] [INFO ] Invariant cache hit.
[2024-05-27 22:41:18] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2068 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2060 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4146ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4149ms
Finished structural reductions in LTL mode , in 1 iterations and 4429 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 220 ms :[p0, (NOT p0), p0, p0, false, true]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-11 finished in 4672 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 U X(!p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:23] [INFO ] Invariant cache hit.
[2024-05-27 22:41:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 22:41:23] [INFO ] Invariant cache hit.
[2024-05-27 22:41:23] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3887ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3889ms
Finished structural reductions in LTL mode , in 1 iterations and 4115 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 140 ms :[p1, p1, p1]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-12
Product exploration explored 100000 steps with 5013 reset in 978 ms.
Stack based approach found an accepted trace after 480 steps with 29 reset with depth 29 and stack size 29 in 3 ms.
FORMULA Philosophers-COL-000020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-12 finished in 5265 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)||((!p1&&X(G((!p1||G(!p0))))) U X(!p2))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:28] [INFO ] Invariant cache hit.
[2024-05-27 22:41:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 22:41:28] [INFO ] Invariant cache hit.
[2024-05-27 22:41:28] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3305ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3306ms
Finished structural reductions in LTL mode , in 1 iterations and 3501 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 1408 ms.
Product exploration explored 100000 steps with 50000 reset in 1349 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 p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000020-LTLFireability-13 finished in 6498 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 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:35] [INFO ] Invariant cache hit.
[2024-05-27 22:41:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-27 22:41:35] [INFO ] Invariant cache hit.
[2024-05-27 22:41:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-27 22:41:35] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2317 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3952ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3953ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4114 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-14
Product exploration explored 100000 steps with 2522 reset in 373 ms.
Stack based approach found an accepted trace after 179 steps with 4 reset with depth 44 and stack size 44 in 1 ms.
FORMULA Philosophers-COL-000020-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-14 finished in 4544 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(((G(p1) U p2)||X((G(p2) U p3))||p0)))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 22:41:39] [INFO ] Invariant cache hit.
[2024-05-27 22:41:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 22:41:39] [INFO ] Invariant cache hit.
[2024-05-27 22:41:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-27 22:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3916ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3917ms
Finished structural reductions in LTL mode , in 1 iterations and 4114 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 407 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) p1 (NOT p3)), true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-15
Entered a terminal (fully accepting) state of product in 144 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-15 finished in 4582 ms.
All properties solved by simple procedures.
Total runtime 74470 ms.
ITS solved all properties within timeout

BK_STOP 1716849704318

--------------------
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="Philosophers-COL-000020"
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 Philosophers-COL-000020, 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-171654406300396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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