fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873945200260
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Philosophers-PT-005000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.920 716455.00 781694.00 22920.50 F??T?FTT???TF?F? normal

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-167873945200260.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-PT-005000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945200260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 226M
-rw-r--r-- 1 mcc users 8.4M Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43M Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2M Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 25 17:39 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.2M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1M Feb 26 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41M Feb 26 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9M Feb 26 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46M Feb 26 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 477K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11M 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-PT-005000-LTLFireability-00
FORMULA_NAME Philosophers-PT-005000-LTLFireability-01
FORMULA_NAME Philosophers-PT-005000-LTLFireability-02
FORMULA_NAME Philosophers-PT-005000-LTLFireability-03
FORMULA_NAME Philosophers-PT-005000-LTLFireability-04
FORMULA_NAME Philosophers-PT-005000-LTLFireability-05
FORMULA_NAME Philosophers-PT-005000-LTLFireability-06
FORMULA_NAME Philosophers-PT-005000-LTLFireability-07
FORMULA_NAME Philosophers-PT-005000-LTLFireability-08
FORMULA_NAME Philosophers-PT-005000-LTLFireability-09
FORMULA_NAME Philosophers-PT-005000-LTLFireability-10
FORMULA_NAME Philosophers-PT-005000-LTLFireability-11
FORMULA_NAME Philosophers-PT-005000-LTLFireability-12
FORMULA_NAME Philosophers-PT-005000-LTLFireability-13
FORMULA_NAME Philosophers-PT-005000-LTLFireability-14
FORMULA_NAME Philosophers-PT-005000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678814654320

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-PT-005000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 17:24:15] [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 17:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:24:16] [INFO ] Load time of PNML (sax parser for PT used): 634 ms
[2023-03-14 17:24:16] [INFO ] Transformed 25000 places.
[2023-03-14 17:24:16] [INFO ] Transformed 25000 transitions.
[2023-03-14 17:24:16] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 820 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 243 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Philosophers-PT-005000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 120 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-14 17:24:25] [INFO ] Computed 10000 place invariants in 172 ms
[2023-03-14 17:24:28] [INFO ] Implicit Places using invariants in 3397 ms returned []
Implicit Place search using SMT only with invariants took 3422 ms to find 0 implicit places.
[2023-03-14 17:24:28] [INFO ] Invariant cache hit.
[2023-03-14 17:24:30] [INFO ] Dead Transitions using invariants and state equation in 2205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5756 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 25000 out of 25000 places after structural reductions.
[2023-03-14 17:24:32] [INFO ] Flatten gal took : 1109 ms
[2023-03-14 17:24:34] [INFO ] Flatten gal took : 1027 ms
[2023-03-14 17:24:37] [INFO ] Input system was already deterministic with 25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15235 ms. (steps per millisecond=0 ) properties (out of 20) seen :11
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5478 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5875 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5294 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1578 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1557 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1499 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1633 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1662 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1536 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 17:25:19] [INFO ] Invariant cache hit.
[2023-03-14 17:25:35] [INFO ] [Real]Absence check using 10000 positive place invariants in 8971 ms returned sat
[2023-03-14 17:25:40] [INFO ] After 21441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 17:25:54] [INFO ] [Nat]Absence check using 10000 positive place invariants in 7883 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 17:26:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 17:26:05] [INFO ] After 25207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15004 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 3011 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3014 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15821 ms. (steps per millisecond=0 ) properties (out of 9) seen :3
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5541 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6293 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5538 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1526 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1477 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1490 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 17:26:46] [INFO ] Invariant cache hit.
[2023-03-14 17:26:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 7699 ms returned sat
[2023-03-14 17:27:03] [INFO ] After 16997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 17:27:17] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8235 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 17:27:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 17:27:28] [INFO ] After 25153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15002 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2518 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2519 ms. Remains : 25000/25000 places, 25000/25000 transitions.
FORMULA Philosophers-PT-005000-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1079 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 17:27:35] [INFO ] Invariant cache hit.
[2023-03-14 17:27:37] [INFO ] Implicit Places using invariants in 1874 ms returned []
Implicit Place search using SMT only with invariants took 1876 ms to find 0 implicit places.
[2023-03-14 17:27:37] [INFO ] Invariant cache hit.
[2023-03-14 17:27:38] [INFO ] Dead Transitions using invariants and state equation in 1895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4857 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s6252 1) (LT s12226 1)) (OR (LT s5324 1) (LT s11135 1)) (OR (LT s7453 1) (LT s13112 1)) (OR (LT s5457 1) (LT s9716 1)) (OR (LT s8370 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 17 ms.
FORMULA Philosophers-PT-005000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-005000-LTLFireability-00 finished in 5197 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||X(!p1)))))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1289 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 17:27:40] [INFO ] Invariant cache hit.
[2023-03-14 17:27:42] [INFO ] Implicit Places using invariants in 1875 ms returned []
Implicit Place search using SMT only with invariants took 1876 ms to find 0 implicit places.
[2023-03-14 17:27:42] [INFO ] Invariant cache hit.
[2023-03-14 17:27:44] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5048 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s5339 1) (LT s16139 1)) (OR (LT s6956 1) (LT s17751 1)) (OR (LT s5652 1) (LT s15812 1)) (OR (LT s5606 1) (LT s14420 1)) (OR (LT s8123 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 5290 steps with 1777 reset in 10039 ms.
Product exploration timeout after 5320 steps with 1786 reset in 10050 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 356 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1300 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 17:28:13] [INFO ] Invariant cache hit.
[2023-03-14 17:28:14] [INFO ] Implicit Places using invariants in 1886 ms returned []
Implicit Place search using SMT only with invariants took 1888 ms to find 0 implicit places.
[2023-03-14 17:28:14] [INFO ] Invariant cache hit.
[2023-03-14 17:28:16] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5074 ms. Remains : 25000/25000 places, 25000/25000 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 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration timeout after 4970 steps with 1659 reset in 10022 ms.
Product exploration timeout after 4900 steps with 1652 reset in 10005 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1887 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 17:28:45] [INFO ] Invariant cache hit.
[2023-03-14 17:28:47] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3831 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Built C files in :
/tmp/ltsmin11149561400260698775
[2023-03-14 17:28:48] [INFO ] Built C files in 310ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11149561400260698775
Running compilation step : cd /tmp/ltsmin11149561400260698775;'/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/ltsmin11149561400260698775;'/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/ltsmin11149561400260698775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1307 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 17:28:52] [INFO ] Invariant cache hit.
[2023-03-14 17:28:54] [INFO ] Implicit Places using invariants in 1938 ms returned []
Implicit Place search using SMT only with invariants took 1947 ms to find 0 implicit places.
[2023-03-14 17:28:54] [INFO ] Invariant cache hit.
[2023-03-14 17:28:56] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5129 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Built C files in :
/tmp/ltsmin12279950418760744969
[2023-03-14 17:28:56] [INFO ] Built C files in 278ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12279950418760744969
Running compilation step : cd /tmp/ltsmin12279950418760744969;'/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/ltsmin12279950418760744969;'/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/ltsmin12279950418760744969;'/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 17:29:01] [INFO ] Flatten gal took : 681 ms
[2023-03-14 17:29:01] [INFO ] Flatten gal took : 684 ms
[2023-03-14 17:29:02] [INFO ] Time to serialize gal into /tmp/LTL11679315110981135188.gal : 146 ms
[2023-03-14 17:29:02] [INFO ] Time to serialize properties into /tmp/LTL2890590159796732978.prop : 31 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/LTL11679315110981135188.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4214388876254276195.hoa' '-atoms' '/tmp/LTL2890590159796732978.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/LTL2890590159796732978.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4214388876254276195.hoa
Detected timeout of ITS tools.
[2023-03-14 17:29:20] [INFO ] Flatten gal took : 674 ms
[2023-03-14 17:29:21] [INFO ] Flatten gal took : 672 ms
[2023-03-14 17:29:21] [INFO ] Time to serialize gal into /tmp/LTL8241712495655499823.gal : 387 ms
[2023-03-14 17:29:21] [INFO ] Time to serialize properties into /tmp/LTL13710583079220277714.ltl : 61 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/LTL8241712495655499823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13710583079220277714.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((((((Fork_1591>=1)&&(Catch1_1591>=1))||((Fork_564>=1)&&(Catch1_564>=1)))||(((Fork_2379>=1)&&(Catch1_2379>=1))||((...365609
Formula 0 simplified : XG(!"(((((((((((((((Fork_548<1)||(Catch2_549<1))&&((Fork_1830<1)||(Catch2_1831<1)))&&(((Fork_962<1)||(Catch2_963<1))&&((Fork_255<1)|...365601
Detected timeout of ITS tools.
[2023-03-14 17:29:37] [INFO ] Flatten gal took : 701 ms
[2023-03-14 17:29:37] [INFO ] Applying decomposition
[2023-03-14 17:29:38] [INFO ] Flatten gal took : 666 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/graph7636066370925210876.txt' '-o' '/tmp/graph7636066370925210876.bin' '-w' '/tmp/graph7636066370925210876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7636066370925210876.bin' '-l' '-1' '-v' '-w' '/tmp/graph7636066370925210876.weights' '-q' '0' '-e' '0.001'
[2023-03-14 17:29:40] [INFO ] Decomposing Gal with order
[2023-03-14 17:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 17:31:09] [INFO ] Removed a total of 4938 redundant transitions.
[2023-03-14 17:31:10] [INFO ] Flatten gal took : 1384 ms
[2023-03-14 17:31:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 12994 labels/synchronizations in 373 ms.
[2023-03-14 17:31:48] [INFO ] Time to serialize gal into /tmp/LTL1053861225466464447.gal : 435 ms
[2023-03-14 17:31:48] [INFO ] Time to serialize properties into /tmp/LTL14488130727864456600.ltl : 53 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/LTL1053861225466464447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14488130727864456600.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(F((X("(((((((((((((((i106.i1.i0.i0.i2.u1158.Fork_1591>=1)&&(i106.i1.i0.i0.i1.u1157.Catch1_1591>=1))||((i3.u71.Fork_564>=1)&&(i3.u...655671
Formula 0 simplified : XG(!"(((((((((((((((i3.u3745.Fork_548<1)||(i3.u3745.Catch2_549<1))&&((i13.i1.i1.i1.i1.u3250.Fork_1830<1)||(i13.i1.i1.i1.i1.u3250.Cat...655663
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11011743569173443132
[2023-03-14 17:32:04] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11011743569173443132
Running compilation step : cd /tmp/ltsmin11011743569173443132;'/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/ltsmin11011743569173443132;'/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/ltsmin11011743569173443132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-005000-LTLFireability-01 finished in 267898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&F(p2))))))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 46 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 17:32:07] [INFO ] Invariant cache hit.
[2023-03-14 17:32:09] [INFO ] Implicit Places using invariants in 1884 ms returned []
Implicit Place search using SMT only with invariants took 1886 ms to find 0 implicit places.
[2023-03-14 17:32:09] [INFO ] Invariant cache hit.
[2023-03-14 17:32:10] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3758 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s20785 1) (LT s21305 1) (LT s21825 1) (LT s22345 1) (LT s19225 1) (LT s23385 1) (LT s24425 1) (LT s20606 1) (LT s19404 1) (LT s24246 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 5110 steps with 39 reset in 10013 ms.
Product exploration timeout after 4970 steps with 41 reset in 10008 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15603 ms. (steps per millisecond=0 ) properties (out of 4) seen :1
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6117 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6884 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5167 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 3 properties.
[2023-03-14 17:33:09] [INFO ] Invariant cache hit.
[2023-03-14 17:33:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 7951 ms returned sat
[2023-03-14 17:33:24] [INFO ] After 14816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 17:33:37] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8386 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 17:33:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 17:33:49] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 188 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15486 ms. (steps per millisecond=0 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6090 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7458 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5654 ms. (steps per millisecond=0 ) properties seen 0

BK_STOP 1678815370775

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-PT-005000"
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-PT-005000, 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-167873945200260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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