Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945000124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Philosophers-COL-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945000124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18K Mar 5 18:23 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-000200-LTLFireability-00
FORMULA_NAME Philosophers-COL-000200-LTLFireability-01
FORMULA_NAME Philosophers-COL-000200-LTLFireability-02
FORMULA_NAME Philosophers-COL-000200-LTLFireability-03
FORMULA_NAME Philosophers-COL-000200-LTLFireability-04
FORMULA_NAME Philosophers-COL-000200-LTLFireability-05
FORMULA_NAME Philosophers-COL-000200-LTLFireability-06
FORMULA_NAME Philosophers-COL-000200-LTLFireability-07
FORMULA_NAME Philosophers-COL-000200-LTLFireability-08
FORMULA_NAME Philosophers-COL-000200-LTLFireability-09
FORMULA_NAME Philosophers-COL-000200-LTLFireability-10
FORMULA_NAME Philosophers-COL-000200-LTLFireability-11
FORMULA_NAME Philosophers-COL-000200-LTLFireability-12
FORMULA_NAME Philosophers-COL-000200-LTLFireability-13
FORMULA_NAME Philosophers-COL-000200-LTLFireability-14
FORMULA_NAME Philosophers-COL-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678790786937

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-14 10:46:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 10:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:46:28] [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.
[2023-03-14 10:46:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 10:46:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1178 ms
[2023-03-14 10:46:29] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 10:46:29] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 3 ms.
[2023-03-14 10:46:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10099 steps, including 49 resets, run finished after 29 ms. (steps per millisecond=348 ) properties (out of 4) seen :2
Finished Best-First random walk after 25 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
[2023-03-14 10:46:29] [INFO ] Flatten gal took : 12 ms
[2023-03-14 10:46:29] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 10:46:29] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 27 ms.
[2023-03-14 10:46:29] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 10:46:30] [INFO ] Computed 400 place invariants in 21 ms
[2023-03-14 10:46:30] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-14 10:46:30] [INFO ] Invariant cache hit.
[2023-03-14 10:46:30] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-14 10:46:30] [INFO ] Invariant cache hit.
[2023-03-14 10:46:31] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1409 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2023-03-14 10:46:31] [INFO ] Flatten gal took : 129 ms
[2023-03-14 10:46:32] [INFO ] Flatten gal took : 112 ms
[2023-03-14 10:46:32] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 2507 steps, including 0 resets, run visited all 13 properties in 181 ms. (steps per millisecond=13 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 45 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:46:33] [INFO ] Invariant cache hit.
[2023-03-14 10:46:33] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-14 10:46:33] [INFO ] Invariant cache hit.
[2023-03-14 10:46:34] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-14 10:46:34] [INFO ] Invariant cache hit.
[2023-03-14 10:46:34] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1471 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s316 1) (GEQ s516 1)) (AND (GEQ s321 1) (GEQ s521 1)) (AND (GEQ s331 1) (GEQ s531 1)) (AND (GEQ s301 1) (GEQ s501 1)) (AND (GEQ s311 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33184 reset in 5619 ms.
Product exploration explored 100000 steps with 33120 reset in 5744 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) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2193 steps, including 0 resets, run visited all 3 properties in 33 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:46:50] [INFO ] Invariant cache hit.
[2023-03-14 10:46:50] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-14 10:46:50] [INFO ] Invariant cache hit.
[2023-03-14 10:46:51] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-14 10:46:51] [INFO ] Invariant cache hit.
[2023-03-14 10:46:51] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1380 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2390 steps, including 0 resets, run visited all 3 properties in 35 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33378 reset in 4785 ms.
Product exploration explored 100000 steps with 33189 reset in 5038 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:47:03] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-14 10:47:03] [INFO ] Invariant cache hit.
[2023-03-14 10:47:04] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin17042318707521105145
[2023-03-14 10:47:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17042318707521105145
Running compilation step : cd /tmp/ltsmin17042318707521105145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1843 ms.
Running link step : cd /tmp/ltsmin17042318707521105145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17042318707521105145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16169638057435562736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:47:19] [INFO ] Invariant cache hit.
[2023-03-14 10:47:19] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-14 10:47:19] [INFO ] Invariant cache hit.
[2023-03-14 10:47:20] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-14 10:47:20] [INFO ] Invariant cache hit.
[2023-03-14 10:47:20] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1396 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin17755683757291523438
[2023-03-14 10:47:20] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17755683757291523438
Running compilation step : cd /tmp/ltsmin17755683757291523438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1910 ms.
Running link step : cd /tmp/ltsmin17755683757291523438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17755683757291523438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1997651237767874674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-14 10:47:36] [INFO ] Flatten gal took : 44 ms
[2023-03-14 10:47:36] [INFO ] Flatten gal took : 46 ms
[2023-03-14 10:47:36] [INFO ] Time to serialize gal into /tmp/LTL1189906746788243273.gal : 11 ms
[2023-03-14 10:47:36] [INFO ] Time to serialize properties into /tmp/LTL16155664360785066022.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1189906746788243273.gal' '-t' 'CGAL' '-hoa' '/tmp/aut294955241720472829.hoa' '-atoms' '/tmp/LTL16155664360785066022.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16155664360785066022.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut294955241720472829.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 10:47:51] [INFO ] Flatten gal took : 41 ms
[2023-03-14 10:47:51] [INFO ] Flatten gal took : 37 ms
[2023-03-14 10:47:51] [INFO ] Time to serialize gal into /tmp/LTL191912526060425507.gal : 6 ms
[2023-03-14 10:47:51] [INFO ] Time to serialize properties into /tmp/LTL11382510214135355315.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL191912526060425507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11382510214135355315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((((((((((Think_83>=1)&&(Fork_82>=1))||((Think_88>=1)&&(Fork_87>=1)))||(((Think_73>=1)&&(Fork_72>=1))||((Think_78>=1)&&(For...13800
Formula 0 simplified : X(XF!"((((((((((Think_83>=1)&&(Fork_82>=1))||((Think_88>=1)&&(Fork_87>=1)))||(((Think_73>=1)&&(Fork_72>=1))||((Think_78>=1)&&(Fork_7...13790
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 10:48:06] [INFO ] Flatten gal took : 34 ms
[2023-03-14 10:48:06] [INFO ] Applying decomposition
[2023-03-14 10:48:06] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10598777849180728937.txt' '-o' '/tmp/graph10598777849180728937.bin' '-w' '/tmp/graph10598777849180728937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10598777849180728937.bin' '-l' '-1' '-v' '-w' '/tmp/graph10598777849180728937.weights' '-q' '0' '-e' '0.001'
[2023-03-14 10:48:06] [INFO ] Decomposing Gal with order
[2023-03-14 10:48:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 10:48:06] [INFO ] Removed a total of 199 redundant transitions.
[2023-03-14 10:48:06] [INFO ] Flatten gal took : 87 ms
[2023-03-14 10:48:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 562 labels/synchronizations in 23 ms.
[2023-03-14 10:48:06] [INFO ] Time to serialize gal into /tmp/LTL7540361288059803837.gal : 10 ms
[2023-03-14 10:48:07] [INFO ] Time to serialize properties into /tmp/LTL14622697679505680868.ltl : 398 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7540361288059803837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14622697679505680868.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((((((((((i8.u147.Think_83>=1)&&(i8.u59.Fork_82>=1))||((i9.u149.Think_88>=1)&&(i9.u149.Fork_87>=1)))||(((i21.u9.Think_73>=1...22328
Formula 0 simplified : X(XF!"((((((((((i8.u147.Think_83>=1)&&(i8.u59.Fork_82>=1))||((i9.u149.Think_88>=1)&&(i9.u149.Fork_87>=1)))||(((i21.u9.Think_73>=1)&&...22318
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10147209364039141205
[2023-03-14 10:48:22] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10147209364039141205
Running compilation step : cd /tmp/ltsmin10147209364039141205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1837 ms.
Running link step : cd /tmp/ltsmin10147209364039141205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10147209364039141205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Philosophers-COL-000200-LTLFireability-00 finished in 124128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(!p2)&&p1))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:48:37] [INFO ] Invariant cache hit.
[2023-03-14 10:48:37] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-14 10:48:37] [INFO ] Invariant cache hit.
[2023-03-14 10:48:38] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2023-03-14 10:48:38] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-14 10:48:38] [INFO ] Invariant cache hit.
[2023-03-14 10:48:38] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1221 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (NOT p0), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-03 finished in 1473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))&&F(((p2 U X(p2))||p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:48:38] [INFO ] Invariant cache hit.
[2023-03-14 10:48:39] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-14 10:48:39] [INFO ] Invariant cache hit.
[2023-03-14 10:48:39] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-14 10:48:39] [INFO ] Invariant cache hit.
[2023-03-14 10:48:40] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1334 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 88 reset in 1289 ms.
Stack based approach found an accepted trace after 1265 steps with 0 reset with depth 1266 and stack size 1266 in 22 ms.
FORMULA Philosophers-COL-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-04 finished in 2791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(!p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:48:41] [INFO ] Invariant cache hit.
[2023-03-14 10:48:42] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-14 10:48:42] [INFO ] Invariant cache hit.
[2023-03-14 10:48:42] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-14 10:48:42] [INFO ] Invariant cache hit.
[2023-03-14 10:48:43] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1312 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-05 finished in 1454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (p1||G(p0)))||F((G(p2)||(X(p2)&&p3))))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:48:43] [INFO ] Invariant cache hit.
[2023-03-14 10:48:43] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-14 10:48:43] [INFO ] Invariant cache hit.
[2023-03-14 10:48:44] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-03-14 10:48:44] [INFO ] Invariant cache hit.
[2023-03-14 10:48:44] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1325 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (LT s846 1) (LT s911 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s854 1) (LT s919 1) (LT s976 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 52 reset in 1536 ms.
Product exploration explored 100000 steps with 47 reset in 1695 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 389 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 10:48:53] [INFO ] Invariant cache hit.
[2023-03-14 10:48:53] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 9 factoid took 529 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 10:48:55] [INFO ] Invariant cache hit.
[2023-03-14 10:49:08] [INFO ] [Real]Absence check using 400 positive place invariants in 626 ms returned sat
[2023-03-14 10:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:49:10] [INFO ] [Real]Absence check using state equation in 1310 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:49:10] [INFO ] Invariant cache hit.
[2023-03-14 10:49:10] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-14 10:49:10] [INFO ] Invariant cache hit.
[2023-03-14 10:49:10] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-14 10:49:10] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-14 10:49:10] [INFO ] Invariant cache hit.
[2023-03-14 10:49:11] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1)))))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Finished random walk after 4909 steps, including 1 resets, run visited all 5 properties in 70 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1))))), (F (NOT p3)), (F (OR (AND p0 p3) (AND p1 p3))), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 4 factoid took 397 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 10:49:17] [INFO ] Invariant cache hit.
[2023-03-14 10:49:31] [INFO ] [Real]Absence check using 400 positive place invariants in 604 ms returned sat
[2023-03-14 10:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:49:32] [INFO ] [Real]Absence check using state equation in 1504 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Product exploration explored 100000 steps with 106 reset in 1609 ms.
Product exploration explored 100000 steps with 129 reset in 1774 ms.
Built C files in :
/tmp/ltsmin8624986600250897422
[2023-03-14 10:49:36] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:49:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:49:36] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:49:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:49:36] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:49:36] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:49:36] [INFO ] Built C files in 345ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8624986600250897422
Running compilation step : cd /tmp/ltsmin8624986600250897422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2996 ms.
Running link step : cd /tmp/ltsmin8624986600250897422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8624986600250897422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9160283426512787339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:49:51] [INFO ] Invariant cache hit.
[2023-03-14 10:49:51] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-14 10:49:51] [INFO ] Invariant cache hit.
[2023-03-14 10:49:52] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2023-03-14 10:49:52] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 10:49:52] [INFO ] Invariant cache hit.
[2023-03-14 10:49:52] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1431 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin18008462933739387672
[2023-03-14 10:49:52] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:49:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:49:52] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:49:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:49:53] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:49:53] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:49:53] [INFO ] Built C files in 297ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18008462933739387672
Running compilation step : cd /tmp/ltsmin18008462933739387672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18008462933739387672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18008462933739387672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 10:49:56] [INFO ] Flatten gal took : 32 ms
[2023-03-14 10:49:56] [INFO ] Flatten gal took : 32 ms
[2023-03-14 10:49:56] [INFO ] Time to serialize gal into /tmp/LTL17861869649760019883.gal : 4 ms
[2023-03-14 10:49:56] [INFO ] Time to serialize properties into /tmp/LTL4686140882776834835.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17861869649760019883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14017618293009273815.hoa' '-atoms' '/tmp/LTL4686140882776834835.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4686140882776834835.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14017618293009273815.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 10:50:11] [INFO ] Flatten gal took : 33 ms
[2023-03-14 10:50:11] [INFO ] Flatten gal took : 32 ms
[2023-03-14 10:50:11] [INFO ] Time to serialize gal into /tmp/LTL8036751306818990812.gal : 5 ms
[2023-03-14 10:50:11] [INFO ] Time to serialize properties into /tmp/LTL16158549313532664788.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8036751306818990812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16158549313532664788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("((((((((((Fork_116>=1)&&(Catch1_116>=1))||((Fork_121>=1)&&(Catch1_121>=1)))||(((Fork_131>=1)&&(Catch1_131>=1))||((Fork_101>=1)...37056
Formula 0 simplified : F(G(F!"(((((((((Eat_46>=1)||(Eat_111>=1))||((Eat_168>=1)||(Eat_38>=1)))||(((Eat_103>=1)||(Eat_160>=1))||((Eat_127>=1)||(Eat_62>=1)))...30056
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 10:50:26] [INFO ] Flatten gal took : 31 ms
[2023-03-14 10:50:26] [INFO ] Applying decomposition
[2023-03-14 10:50:26] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5841361964092572761.txt' '-o' '/tmp/graph5841361964092572761.bin' '-w' '/tmp/graph5841361964092572761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5841361964092572761.bin' '-l' '-1' '-v' '-w' '/tmp/graph5841361964092572761.weights' '-q' '0' '-e' '0.001'
[2023-03-14 10:50:26] [INFO ] Decomposing Gal with order
[2023-03-14 10:50:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 10:50:26] [INFO ] Removed a total of 199 redundant transitions.
[2023-03-14 10:50:26] [INFO ] Flatten gal took : 62 ms
[2023-03-14 10:50:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 13 ms.
[2023-03-14 10:50:27] [INFO ] Time to serialize gal into /tmp/LTL16747106643407597424.gal : 8 ms
[2023-03-14 10:50:27] [INFO ] Time to serialize properties into /tmp/LTL3632760746097402271.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16747106643407597424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3632760746097402271.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("((((((((((i11.i1.i1.u80.Fork_116>=1)&&(i11.i0.i0.u79.Catch1_116>=1))||((i22.u174.Fork_121>=1)&&(i22.u174.Catch1_121>=1)))||(((...63273
Formula 0 simplified : F(G(F!"(((((((((i5.i1.i0.u51.Eat_46>=1)||(i10.u18.Eat_111>=1))||((i14.u191.Eat_168>=1)||(i1.u48.Eat_38>=1)))||(((i9.u167.Eat_103>=1)...51503
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9231818202357421372
[2023-03-14 10:50:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9231818202357421372
Running compilation step : cd /tmp/ltsmin9231818202357421372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1901 ms.
Running link step : cd /tmp/ltsmin9231818202357421372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9231818202357421372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))||<>(([]((LTLAPp2==true))||(X((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Philosophers-COL-000200-LTLFireability-08 finished in 134172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(G(!p1)))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:50:57] [INFO ] Invariant cache hit.
[2023-03-14 10:50:57] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-14 10:50:57] [INFO ] Invariant cache hit.
[2023-03-14 10:50:58] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-14 10:50:58] [INFO ] Invariant cache hit.
[2023-03-14 10:50:58] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (OR (LT s83 1) (LT s282 1)) (OR (LT s88 1) (LT s287 1)) (OR (LT s73 1) (LT s272 1)) (OR (LT s78 1) (LT s277 1)) (OR (LT s103 1) (LT s302 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 2743 ms.
Stack based approach found an accepted trace after 2688 steps with 0 reset with depth 2689 and stack size 2689 in 50 ms.
FORMULA Philosophers-COL-000200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-09 finished in 4648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:51:02] [INFO ] Invariant cache hit.
[2023-03-14 10:51:02] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-14 10:51:02] [INFO ] Invariant cache hit.
[2023-03-14 10:51:03] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-03-14 10:51:03] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 10:51:03] [INFO ] Invariant cache hit.
[2023-03-14 10:51:03] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1645 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5711 reset in 5560 ms.
Product exploration explored 100000 steps with 5326 reset in 5430 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)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 10:51:16] [INFO ] Invariant cache hit.
[2023-03-14 10:51:22] [INFO ] [Real]Absence check using 400 positive place invariants in 476 ms returned sat
[2023-03-14 10:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:51:28] [INFO ] [Real]Absence check using state equation in 6227 ms returned sat
[2023-03-14 10:51:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:51:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 366 ms returned sat
[2023-03-14 10:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:51:35] [INFO ] [Nat]Absence check using state equation in 1824 ms returned sat
[2023-03-14 10:51:35] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-14 10:51:36] [INFO ] Added : 40 causal constraints over 8 iterations in 644 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 10:51:36] [INFO ] Invariant cache hit.
[2023-03-14 10:51:38] [INFO ] [Real]Absence check using 400 positive place invariants in 543 ms returned sat
[2023-03-14 10:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:51:47] [INFO ] [Real]Absence check using state equation in 9116 ms returned sat
[2023-03-14 10:51:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:51:48] [INFO ] [Nat]Absence check using 400 positive place invariants in 283 ms returned sat
[2023-03-14 10:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:51:50] [INFO ] [Nat]Absence check using state equation in 1463 ms returned sat
[2023-03-14 10:51:50] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-14 10:51:50] [INFO ] Added : 0 causal constraints over 0 iterations in 141 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:51:50] [INFO ] Invariant cache hit.
[2023-03-14 10:51:50] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-14 10:51:50] [INFO ] Invariant cache hit.
[2023-03-14 10:51:51] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2023-03-14 10:51:51] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 10:51:51] [INFO ] Invariant cache hit.
[2023-03-14 10:51:51] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1519 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 36 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 10:51:53] [INFO ] Invariant cache hit.
[2023-03-14 10:51:59] [INFO ] [Real]Absence check using 400 positive place invariants in 463 ms returned sat
[2023-03-14 10:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:52:05] [INFO ] [Real]Absence check using state equation in 6305 ms returned sat
[2023-03-14 10:52:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:52:10] [INFO ] [Nat]Absence check using 400 positive place invariants in 368 ms returned sat
[2023-03-14 10:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:52:12] [INFO ] [Nat]Absence check using state equation in 1818 ms returned sat
[2023-03-14 10:52:12] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-14 10:52:13] [INFO ] Added : 40 causal constraints over 8 iterations in 565 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 10:52:13] [INFO ] Invariant cache hit.
[2023-03-14 10:52:14] [INFO ] [Real]Absence check using 400 positive place invariants in 515 ms returned sat
[2023-03-14 10:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:52:23] [INFO ] [Real]Absence check using state equation in 9025 ms returned sat
[2023-03-14 10:52:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:52:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 313 ms returned sat
[2023-03-14 10:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:52:26] [INFO ] [Nat]Absence check using state equation in 1506 ms returned sat
[2023-03-14 10:52:26] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-14 10:52:27] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5596 reset in 5289 ms.
Product exploration explored 100000 steps with 5537 reset in 5609 ms.
Built C files in :
/tmp/ltsmin9652424656108464159
[2023-03-14 10:52:38] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:52:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:52:38] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:52:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:52:38] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:52:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:52:38] [INFO ] Built C files in 228ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9652424656108464159
Running compilation step : cd /tmp/ltsmin9652424656108464159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2891 ms.
Running link step : cd /tmp/ltsmin9652424656108464159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9652424656108464159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6815875840232176916.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:52:53] [INFO ] Invariant cache hit.
[2023-03-14 10:52:53] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-14 10:52:53] [INFO ] Invariant cache hit.
[2023-03-14 10:52:53] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-14 10:52:53] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 10:52:53] [INFO ] Invariant cache hit.
[2023-03-14 10:52:54] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1432 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin16022956139097984565
[2023-03-14 10:52:54] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:52:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:52:54] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:52:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:52:54] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:52:54] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:52:54] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16022956139097984565
Running compilation step : cd /tmp/ltsmin16022956139097984565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2831 ms.
Running link step : cd /tmp/ltsmin16022956139097984565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16022956139097984565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3689384581825420542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-14 10:53:09] [INFO ] Flatten gal took : 24 ms
[2023-03-14 10:53:09] [INFO ] Flatten gal took : 23 ms
[2023-03-14 10:53:09] [INFO ] Time to serialize gal into /tmp/LTL5097778550983914567.gal : 4 ms
[2023-03-14 10:53:09] [INFO ] Time to serialize properties into /tmp/LTL4659216028089847494.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5097778550983914567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9730963769015678254.hoa' '-atoms' '/tmp/LTL4659216028089847494.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4659216028089847494.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9730963769015678254.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1250 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.586,381272,1,0,12,2.71581e+06,27,8,26600,143387,27
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000200-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-COL-000200-LTLFireability-10 finished in 141755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p1))&&p0)))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:53:23] [INFO ] Invariant cache hit.
[2023-03-14 10:53:24] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-14 10:53:24] [INFO ] Invariant cache hit.
[2023-03-14 10:53:24] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-14 10:53:24] [INFO ] Invariant cache hit.
[2023-03-14 10:53:25] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1300 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s83 1) (LT s282 1)) (OR (LT s88 1) (LT s287 1)) (OR (LT s73 1) (LT s272 1)) (OR (LT s78 1) (LT s277 1)) (OR (LT s103 1) (LT s302 1)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-11 finished in 1493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F((p1&&G(p2)))||p0))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:53:25] [INFO ] Invariant cache hit.
[2023-03-14 10:53:25] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-14 10:53:25] [INFO ] Invariant cache hit.
[2023-03-14 10:53:26] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-14 10:53:26] [INFO ] Invariant cache hit.
[2023-03-14 10:53:26] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1440 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24410 steps with 0 reset in 345 ms.
FORMULA Philosophers-COL-000200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-12 finished in 2046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:53:27] [INFO ] Invariant cache hit.
[2023-03-14 10:53:27] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-14 10:53:27] [INFO ] Invariant cache hit.
[2023-03-14 10:53:28] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-14 10:53:28] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 10:53:28] [INFO ] Invariant cache hit.
[2023-03-14 10:53:28] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1504 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1405 ms.
Stack based approach found an accepted trace after 1331 steps with 0 reset with depth 1332 and stack size 1332 in 24 ms.
FORMULA Philosophers-COL-000200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-13 finished in 2984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p0))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:53:30] [INFO ] Invariant cache hit.
[2023-03-14 10:53:30] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-14 10:53:30] [INFO ] Invariant cache hit.
[2023-03-14 10:53:31] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2023-03-14 10:53:31] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 10:53:31] [INFO ] Invariant cache hit.
[2023-03-14 10:53:31] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1429 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 111 ms :[false, p0, p0]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 47 reset in 1464 ms.
Stack based approach found an accepted trace after 14242 steps with 6 reset with depth 1797 and stack size 1797 in 232 ms.
FORMULA Philosophers-COL-000200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-14 finished in 3257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (F(!p1)&&G(p2))) U (p1&&(p0 U (F(!p1)&&G(p2)))))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:53:33] [INFO ] Invariant cache hit.
[2023-03-14 10:53:33] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-14 10:53:33] [INFO ] Invariant cache hit.
[2023-03-14 10:53:34] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-14 10:53:34] [INFO ] Invariant cache hit.
[2023-03-14 10:53:34] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1310 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, true, true, p1, (NOT p2), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4340 steps with 0 reset in 67 ms.
FORMULA Philosophers-COL-000200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-15 finished in 1691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (p1||G(p0)))||F((G(p2)||(X(p2)&&p3))))))'
Found a Shortening insensitive property : Philosophers-COL-000200-LTLFireability-08
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:53:35] [INFO ] Invariant cache hit.
[2023-03-14 10:53:35] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-14 10:53:35] [INFO ] Invariant cache hit.
[2023-03-14 10:53:36] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-14 10:53:36] [INFO ] Invariant cache hit.
[2023-03-14 10:53:36] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1308 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (LT s846 1) (LT s911 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s854 1) (LT s919 1) (LT s976 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 53 reset in 1513 ms.
Product exploration explored 100000 steps with 50 reset in 1690 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 10:53:45] [INFO ] Invariant cache hit.
[2023-03-14 10:53:45] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 9 factoid took 518 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 10:53:46] [INFO ] Invariant cache hit.
[2023-03-14 10:54:00] [INFO ] [Real]Absence check using 400 positive place invariants in 587 ms returned sat
[2023-03-14 10:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:54:01] [INFO ] [Real]Absence check using state equation in 1740 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:54:01] [INFO ] Invariant cache hit.
[2023-03-14 10:54:02] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-14 10:54:02] [INFO ] Invariant cache hit.
[2023-03-14 10:54:02] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2023-03-14 10:54:02] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 10:54:02] [INFO ] Invariant cache hit.
[2023-03-14 10:54:03] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1464 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1)))))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Finished random walk after 2439 steps, including 0 resets, run visited all 5 properties in 36 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1))))), (F (NOT p3)), (F (OR (AND p0 p3) (AND p1 p3))), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 4 factoid took 431 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 10:54:09] [INFO ] Invariant cache hit.
[2023-03-14 10:54:23] [INFO ] [Real]Absence check using 400 positive place invariants in 638 ms returned sat
[2023-03-14 10:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:54:24] [INFO ] [Real]Absence check using state equation in 1635 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Product exploration explored 100000 steps with 97 reset in 1629 ms.
Product exploration explored 100000 steps with 112 reset in 1711 ms.
Built C files in :
/tmp/ltsmin4180827294344431267
[2023-03-14 10:54:28] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:54:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:54:28] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:54:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:54:28] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:54:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:54:28] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4180827294344431267
Running compilation step : cd /tmp/ltsmin4180827294344431267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2929 ms.
Running link step : cd /tmp/ltsmin4180827294344431267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4180827294344431267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2920444871646101500.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 10:54:43] [INFO ] Invariant cache hit.
[2023-03-14 10:54:43] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-14 10:54:43] [INFO ] Invariant cache hit.
[2023-03-14 10:54:44] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-14 10:54:44] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 10:54:44] [INFO ] Invariant cache hit.
[2023-03-14 10:54:44] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1348 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin5127554730387797216
[2023-03-14 10:54:44] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:54:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:54:44] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:54:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:54:44] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:54:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:54:44] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5127554730387797216
Running compilation step : cd /tmp/ltsmin5127554730387797216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5127554730387797216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5127554730387797216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 10:54:48] [INFO ] Flatten gal took : 24 ms
[2023-03-14 10:54:48] [INFO ] Flatten gal took : 24 ms
[2023-03-14 10:54:48] [INFO ] Time to serialize gal into /tmp/LTL16035340205083503215.gal : 4 ms
[2023-03-14 10:54:48] [INFO ] Time to serialize properties into /tmp/LTL1642355578049668873.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16035340205083503215.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5338632711211116377.hoa' '-atoms' '/tmp/LTL1642355578049668873.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1642355578049668873.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5338632711211116377.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 10:55:03] [INFO ] Flatten gal took : 29 ms
[2023-03-14 10:55:03] [INFO ] Flatten gal took : 29 ms
[2023-03-14 10:55:03] [INFO ] Time to serialize gal into /tmp/LTL941444744244631133.gal : 4 ms
[2023-03-14 10:55:03] [INFO ] Time to serialize properties into /tmp/LTL11302276808963112009.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL941444744244631133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11302276808963112009.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((("((((((((((Fork_116>=1)&&(Catch1_116>=1))||((Fork_121>=1)&&(Catch1_121>=1)))||(((Fork_131>=1)&&(Catch1_131>=1))||((Fork_101>=1)...37056
Formula 0 simplified : F(G(F!"(((((((((Eat_46>=1)||(Eat_111>=1))||((Eat_168>=1)||(Eat_38>=1)))||(((Eat_103>=1)||(Eat_160>=1))||((Eat_127>=1)||(Eat_62>=1)))...30056
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 10:55:18] [INFO ] Flatten gal took : 36 ms
[2023-03-14 10:55:18] [INFO ] Applying decomposition
[2023-03-14 10:55:18] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4274261058842618226.txt' '-o' '/tmp/graph4274261058842618226.bin' '-w' '/tmp/graph4274261058842618226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4274261058842618226.bin' '-l' '-1' '-v' '-w' '/tmp/graph4274261058842618226.weights' '-q' '0' '-e' '0.001'
[2023-03-14 10:55:18] [INFO ] Decomposing Gal with order
[2023-03-14 10:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 10:55:18] [INFO ] Removed a total of 198 redundant transitions.
[2023-03-14 10:55:18] [INFO ] Flatten gal took : 53 ms
[2023-03-14 10:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 12 ms.
[2023-03-14 10:55:18] [INFO ] Time to serialize gal into /tmp/LTL11873940903223232685.gal : 6 ms
[2023-03-14 10:55:18] [INFO ] Time to serialize properties into /tmp/LTL6589852016241969566.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11873940903223232685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6589852016241969566.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("((((((((((i13.u153.Fork_116>=1)&&(i13.u67.Catch1_116>=1))||((i14.i0.i1.u156.Fork_121>=1)&&(i14.i0.i0.u155.Catch1_121>=1)))||((...63276
Formula 0 simplified : F(G(F!"(((((((((i8.u123.Eat_46>=1)||(i22.i0.i1.u64.Eat_111>=1))||((i17.i1.i0.u182.Eat_168>=1)||(i2.u4.Eat_38>=1)))||(((i4.u14.Eat_10...51506
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1103995771404533340
[2023-03-14 10:55:33] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1103995771404533340
Running compilation step : cd /tmp/ltsmin1103995771404533340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1838 ms.
Running link step : cd /tmp/ltsmin1103995771404533340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1103995771404533340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))||<>(([]((LTLAPp2==true))||(X((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Philosophers-COL-000200-LTLFireability-08 finished in 133618 ms.
[2023-03-14 10:55:49] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6118663317011421885
[2023-03-14 10:55:49] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-14 10:55:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:55:49] [INFO ] Applying decomposition
[2023-03-14 10:55:49] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-14 10:55:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:55:49] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10890822391544754276.txt' '-o' '/tmp/graph10890822391544754276.bin' '-w' '/tmp/graph10890822391544754276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10890822391544754276.bin' '-l' '-1' '-v' '-w' '/tmp/graph10890822391544754276.weights' '-q' '0' '-e' '0.001'
[2023-03-14 10:55:49] [INFO ] Decomposing Gal with order
[2023-03-14 10:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 10:55:49] [INFO ] Removed a total of 199 redundant transitions.
[2023-03-14 10:55:49] [INFO ] Flatten gal took : 64 ms
[2023-03-14 10:55:49] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-14 10:55:49] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 10:55:49] [INFO ] Built C files in 336ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6118663317011421885
Running compilation step : cd /tmp/ltsmin6118663317011421885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-14 10:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 11 ms.
[2023-03-14 10:55:49] [INFO ] Time to serialize gal into /tmp/LTLFireability11795028461195564766.gal : 8 ms
[2023-03-14 10:55:49] [INFO ] Time to serialize properties into /tmp/LTLFireability8759519640821671372.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11795028461195564766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8759519640821671372.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((X(G("((((((((((i17.i0.i0.u61.Think_83>=1)&&(i17.i0.i0.u61.Fork_82>=1))||((i0.u150.Think_88>=1)&&(i0.u150.Fork_87>=1)))||(((i8.i1...23024
Formula 0 simplified : X(XF!"((((((((((i17.i0.i0.u61.Think_83>=1)&&(i17.i0.i0.u61.Fork_82>=1))||((i0.u150.Think_88>=1)&&(i0.u150.Fork_87>=1)))||(((i8.i1.i1...23014
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 3223 ms.
Running link step : cd /tmp/ltsmin6118663317011421885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin6118663317011421885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.209: LTL layer: formula: X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.209: "X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.210: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.369: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.372: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.379: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.378: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.444: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.448: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.459: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.503: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.013: DFS-FIFO for weak LTL, using special progress label 1006
pins2lts-mc-linux64( 0/ 8), 1.013: There are 1007 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.013: State length is 1001, there are 1005 groups
pins2lts-mc-linux64( 0/ 8), 1.013: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.013: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.013: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.013: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.999: ~1 levels ~960 states ~98688 transitions
pins2lts-mc-linux64( 1/ 8), 2.182: ~1 levels ~1920 states ~140104 transitions
pins2lts-mc-linux64( 1/ 8), 2.355: ~1 levels ~3840 states ~146448 transitions
pins2lts-mc-linux64( 1/ 8), 2.661: ~1 levels ~7680 states ~171808 transitions
pins2lts-mc-linux64( 1/ 8), 3.537: ~1 levels ~15360 states ~292232 transitions
pins2lts-mc-linux64( 1/ 8), 6.460: ~1 levels ~30720 states ~1011432 transitions
pins2lts-mc-linux64( 1/ 8), 16.215: ~1 levels ~61440 states ~4413976 transitions
pins2lts-mc-linux64( 6/ 8), 27.999: ~1 levels ~122880 states ~8026120 transitions
pins2lts-mc-linux64( 1/ 8), 38.248: ~1 levels ~245760 states ~9897872 transitions
pins2lts-mc-linux64( 1/ 8), 52.067: ~1 levels ~491520 states ~10693768 transitions
pins2lts-mc-linux64( 1/ 8), 67.954: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 76.733:
pins2lts-mc-linux64( 0/ 8), 76.733: mean standard work distribution: 29.9% (states) 16.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 76.733:
pins2lts-mc-linux64( 0/ 8), 76.733: Explored 478869 states 16056624 transitions, fanout: 33.530
pins2lts-mc-linux64( 0/ 8), 76.733: Total exploration time 75.710 sec (67.690 sec minimum, 73.632 sec on average)
pins2lts-mc-linux64( 0/ 8), 76.733: States per second: 6325, Transitions per second: 212081
pins2lts-mc-linux64( 0/ 8), 76.733:
pins2lts-mc-linux64( 0/ 8), 76.733: Progress states detected: 11625122
pins2lts-mc-linux64( 0/ 8), 76.733: Redundant explorations: -95.8810
pins2lts-mc-linux64( 0/ 8), 76.733:
pins2lts-mc-linux64( 0/ 8), 76.733: Queue width: 8B, total height: 16439391, memory: 125.42MB
pins2lts-mc-linux64( 0/ 8), 76.733: Tree memory: 344.7MB, 31.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 76.733: Tree fill ratio (roots/leafs): 8.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 76.733: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 76.733: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 76.733: Est. total memory use: 470.1MB (~1149.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6118663317011421885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6118663317011421885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-14 11:18:55] [INFO ] Applying decomposition
[2023-03-14 11:18:55] [INFO ] Flatten gal took : 32 ms
[2023-03-14 11:18:55] [INFO ] Decomposing Gal with order
[2023-03-14 11:18:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 11:18:55] [INFO ] Removed a total of 200 redundant transitions.
[2023-03-14 11:18:55] [INFO ] Flatten gal took : 54 ms
[2023-03-14 11:18:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 7 ms.
[2023-03-14 11:18:55] [INFO ] Time to serialize gal into /tmp/LTLFireability5877313268502551136.gal : 6 ms
[2023-03-14 11:18:55] [INFO ] Time to serialize properties into /tmp/LTLFireability11866690165684062984.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5877313268502551136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11866690165684062984.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((X(G("((((((((((Philo83.Think_83>=1)&&(Philo82.Fork_82>=1))||((Philo88.Think_88>=1)&&(Philo87.Fork_87>=1)))||(((Philo73.Think_73>...20560
Formula 0 simplified : X(XF!"((((((((((Philo83.Think_83>=1)&&(Philo82.Fork_82>=1))||((Philo88.Think_88>=1)&&(Philo87.Fork_87>=1)))||(((Philo73.Think_73>=1)...20550
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
15855 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,158.681,2450280,1,0,4.73769e+06,450,4454,9.27423e+06,77,269,2963544
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000200-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((("((((((((((Philo116.Fork_116>=1)&&(Philo116.Catch1_116>=1))||((Philo121.Fork_121>=1)&&(Philo121.Catch1_121>=1)))||(((Philo131.F...55646
Formula 1 simplified : F(G(F!"(((((((((Philo46.Eat_46>=1)||(Philo111.Eat_111>=1))||((Philo168.Eat_168>=1)||(Philo38.Eat_38>=1)))||(((Philo103.Eat_103>=1)||...45266
Computing Next relation with stutter on 2 deadlock states
203 unique states visited
203 strongly connected components in search stack
205 transitions explored
203 items max in DFS search stack
61098 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,769.668,4501404,1,0,1.11736e+07,450,5480,1.75377e+07,79,269,21023367
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000200-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2737820 ms.

BK_STOP 1678793527200

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000200, 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 r293-tall-167873945000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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