Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 190K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 859K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 153K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 637K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 502K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 783K Jun 7 06:26 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 BlocksWorld-PT-05-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717779084594

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 16:51:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 16:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 16:51:26] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-06-07 16:51:26] [INFO ] Transformed 869 places.
[2024-06-07 16:51:26] [INFO ] Transformed 1625 transitions.
[2024-06-07 16:51:26] [INFO ] Found NUPN structural information;
[2024-06-07 16:51:26] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27]
[2024-06-07 16:51:26] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 869 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1625/1625 transitions.
Applied a total of 0 rules in 26 ms. Remains 869 /869 variables (removed 0) and now considering 1625/1625 (removed 0) transitions.
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 16:51:27] [INFO ] Computed 57 invariants in 45 ms
[2024-06-07 16:51:27] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-07 16:51:27] [INFO ] Invariant cache hit.
[2024-06-07 16:51:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-07 16:51:28] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2024-06-07 16:51:28] [INFO ] Invariant cache hit.
[2024-06-07 16:51:28] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 56 transitions.
Found 56 dead transitions using SMT.
Drop transitions removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in LTL mode, iteration 1 : 869/869 places, 1569/1625 transitions.
Deduced a syphon composed of 28 places in 2 ms
Applied a total of 0 rules in 10 ms. Remains 869 /869 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1664 ms. Remains : 869/869 places, 1569/1625 transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Support contains 841 out of 841 places after structural reductions.
[2024-06-07 16:51:29] [INFO ] Flatten gal took : 315 ms
[2024-06-07 16:51:30] [INFO ] Flatten gal took : 193 ms
[2024-06-07 16:51:30] [INFO ] Input system was already deterministic with 1569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1194 ms. (steps per millisecond=8 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1448 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 16:51:35] [INFO ] Computed 57 invariants in 19 ms
[2024-06-07 16:51:39] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2024-06-07 16:51:39] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-06-07 16:51:40] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2024-06-07 16:51:40] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-06-07 16:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:51:41] [INFO ] After 181ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-06-07 16:51:41] [INFO ] Deduced a trap composed of 216 places in 373 ms of which 5 ms to minimize.
[2024-06-07 16:51:42] [INFO ] Deduced a trap composed of 224 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:51:42] [INFO ] Deduced a trap composed of 176 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:51:42] [INFO ] Deduced a trap composed of 200 places in 386 ms of which 2 ms to minimize.
[2024-06-07 16:51:43] [INFO ] Deduced a trap composed of 81 places in 359 ms of which 2 ms to minimize.
[2024-06-07 16:51:43] [INFO ] Deduced a trap composed of 161 places in 347 ms of which 1 ms to minimize.
[2024-06-07 16:51:44] [INFO ] Deduced a trap composed of 225 places in 363 ms of which 1 ms to minimize.
[2024-06-07 16:51:44] [INFO ] Deduced a trap composed of 161 places in 387 ms of which 2 ms to minimize.
[2024-06-07 16:51:45] [INFO ] Deduced a trap composed of 125 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:51:45] [INFO ] Deduced a trap composed of 144 places in 459 ms of which 1 ms to minimize.
[2024-06-07 16:51:46] [INFO ] Deduced a trap composed of 125 places in 400 ms of which 0 ms to minimize.
[2024-06-07 16:51:46] [INFO ] Deduced a trap composed of 104 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:51:47] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 0 ms to minimize.
[2024-06-07 16:51:47] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:51:47] [INFO ] Deduced a trap composed of 56 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:51:48] [INFO ] Deduced a trap composed of 81 places in 404 ms of which 0 ms to minimize.
[2024-06-07 16:51:48] [INFO ] Deduced a trap composed of 104 places in 431 ms of which 1 ms to minimize.
[2024-06-07 16:51:49] [INFO ] Deduced a trap composed of 81 places in 407 ms of which 1 ms to minimize.
[2024-06-07 16:51:49] [INFO ] Deduced a trap composed of 144 places in 396 ms of which 3 ms to minimize.
[2024-06-07 16:51:50] [INFO ] Deduced a trap composed of 144 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:51:50] [INFO ] Deduced a trap composed of 56 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:51:51] [INFO ] Deduced a trap composed of 144 places in 406 ms of which 1 ms to minimize.
[2024-06-07 16:51:51] [INFO ] Deduced a trap composed of 104 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:51:52] [INFO ] Deduced a trap composed of 81 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:51:52] [INFO ] Deduced a trap composed of 56 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:51:53] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:51:53] [INFO ] Deduced a trap composed of 81 places in 418 ms of which 1 ms to minimize.
[2024-06-07 16:51:54] [INFO ] Deduced a trap composed of 104 places in 461 ms of which 1 ms to minimize.
[2024-06-07 16:51:54] [INFO ] Deduced a trap composed of 104 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:51:55] [INFO ] Deduced a trap composed of 81 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:51:55] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 0 ms to minimize.
[2024-06-07 16:51:56] [INFO ] Deduced a trap composed of 81 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:51:56] [INFO ] Deduced a trap composed of 56 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:51:56] [INFO ] Deduced a trap composed of 81 places in 377 ms of which 1 ms to minimize.
[2024-06-07 16:51:57] [INFO ] Deduced a trap composed of 216 places in 394 ms of which 4 ms to minimize.
[2024-06-07 16:51:57] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 1 ms to minimize.
[2024-06-07 16:51:58] [INFO ] Deduced a trap composed of 176 places in 387 ms of which 0 ms to minimize.
[2024-06-07 16:51:58] [INFO ] Deduced a trap composed of 209 places in 408 ms of which 1 ms to minimize.
[2024-06-07 16:51:59] [INFO ] Deduced a trap composed of 125 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:51:59] [INFO ] Deduced a trap composed of 81 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:52:00] [INFO ] Deduced a trap composed of 176 places in 384 ms of which 3 ms to minimize.
[2024-06-07 16:52:00] [INFO ] Deduced a trap composed of 81 places in 400 ms of which 0 ms to minimize.
[2024-06-07 16:52:01] [INFO ] Deduced a trap composed of 81 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:52:01] [INFO ] Deduced a trap composed of 81 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:52:02] [INFO ] Deduced a trap composed of 81 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:52:02] [INFO ] Deduced a trap composed of 81 places in 386 ms of which 1 ms to minimize.
[2024-06-07 16:52:02] [INFO ] Deduced a trap composed of 81 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:52:03] [INFO ] Deduced a trap composed of 176 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:52:03] [INFO ] Deduced a trap composed of 125 places in 401 ms of which 2 ms to minimize.
[2024-06-07 16:52:04] [INFO ] Deduced a trap composed of 81 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:52:04] [INFO ] Deduced a trap composed of 176 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:52:05] [INFO ] Deduced a trap composed of 29 places in 475 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 16:52:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 16:52:05] [INFO ] After 25497ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 841 transition count 1568
Applied a total of 1 rules in 227 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 841/841 places, 1568/1569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1550 ms. (steps per millisecond=6 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 215328 steps, run timeout after 6001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 215328 steps, saw 184727 distinct states, run finished after 6003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 16:52:13] [INFO ] Computed 57 invariants in 9 ms
[2024-06-07 16:52:16] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-06-07 16:52:16] [INFO ] After 579ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-06-07 16:52:16] [INFO ] After 762ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-06-07 16:52:16] [INFO ] After 1100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2024-06-07 16:52:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-06-07 16:52:17] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 16:52:18] [INFO ] Deduced a trap composed of 216 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:52:18] [INFO ] Deduced a trap composed of 209 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:52:19] [INFO ] Deduced a trap composed of 81 places in 399 ms of which 1 ms to minimize.
[2024-06-07 16:52:19] [INFO ] Deduced a trap composed of 189 places in 402 ms of which 2 ms to minimize.
[2024-06-07 16:52:20] [INFO ] Deduced a trap composed of 81 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:52:20] [INFO ] Deduced a trap composed of 81 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:52:21] [INFO ] Deduced a trap composed of 81 places in 383 ms of which 1 ms to minimize.
[2024-06-07 16:52:21] [INFO ] Deduced a trap composed of 209 places in 388 ms of which 0 ms to minimize.
[2024-06-07 16:52:22] [INFO ] Deduced a trap composed of 224 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:52:22] [INFO ] Deduced a trap composed of 81 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:52:23] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:52:23] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 2 ms to minimize.
[2024-06-07 16:52:24] [INFO ] Deduced a trap composed of 81 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:52:24] [INFO ] Deduced a trap composed of 81 places in 400 ms of which 2 ms to minimize.
[2024-06-07 16:52:24] [INFO ] Deduced a trap composed of 125 places in 397 ms of which 2 ms to minimize.
[2024-06-07 16:52:25] [INFO ] Deduced a trap composed of 144 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:52:25] [INFO ] Deduced a trap composed of 81 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:52:26] [INFO ] Deduced a trap composed of 81 places in 377 ms of which 1 ms to minimize.
[2024-06-07 16:52:26] [INFO ] Deduced a trap composed of 221 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:52:27] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 0 ms to minimize.
[2024-06-07 16:52:27] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 0 ms to minimize.
[2024-06-07 16:52:28] [INFO ] Deduced a trap composed of 104 places in 398 ms of which 0 ms to minimize.
[2024-06-07 16:52:28] [INFO ] Deduced a trap composed of 144 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:52:29] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:52:29] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 0 ms to minimize.
[2024-06-07 16:52:30] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:52:30] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:52:30] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:52:31] [INFO ] Deduced a trap composed of 104 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:52:31] [INFO ] Deduced a trap composed of 161 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:52:32] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:52:32] [INFO ] Deduced a trap composed of 225 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:52:33] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:52:33] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:52:34] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 0 ms to minimize.
[2024-06-07 16:52:34] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 0 ms to minimize.
[2024-06-07 16:52:35] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:52:35] [INFO ] Deduced a trap composed of 81 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:52:36] [INFO ] Deduced a trap composed of 176 places in 396 ms of which 0 ms to minimize.
[2024-06-07 16:52:36] [INFO ] Deduced a trap composed of 144 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:52:36] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:52:37] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 0 ms to minimize.
[2024-06-07 16:52:37] [INFO ] Deduced a trap composed of 104 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:52:38] [INFO ] Deduced a trap composed of 81 places in 416 ms of which 1 ms to minimize.
[2024-06-07 16:52:38] [INFO ] Deduced a trap composed of 189 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:52:39] [INFO ] Deduced a trap composed of 176 places in 419 ms of which 1 ms to minimize.
[2024-06-07 16:52:39] [INFO ] Deduced a trap composed of 81 places in 417 ms of which 1 ms to minimize.
[2024-06-07 16:52:40] [INFO ] Deduced a trap composed of 81 places in 412 ms of which 1 ms to minimize.
[2024-06-07 16:52:40] [INFO ] Deduced a trap composed of 161 places in 417 ms of which 1 ms to minimize.
[2024-06-07 16:52:41] [INFO ] Deduced a trap composed of 200 places in 410 ms of which 1 ms to minimize.
[2024-06-07 16:52:41] [INFO ] Deduced a trap composed of 56 places in 402 ms of which 0 ms to minimize.
[2024-06-07 16:52:42] [INFO ] Deduced a trap composed of 81 places in 398 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 16:52:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 16:52:42] [INFO ] After 25216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 105 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 143 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 16:52:42] [INFO ] Invariant cache hit.
[2024-06-07 16:52:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-07 16:52:42] [INFO ] Invariant cache hit.
[2024-06-07 16:52:43] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-06-07 16:52:43] [INFO ] Redundant transitions in 117 ms returned []
[2024-06-07 16:52:43] [INFO ] Invariant cache hit.
[2024-06-07 16:52:43] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1485 ms. Remains : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 96 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-06-07 16:52:43] [INFO ] Invariant cache hit.
[2024-06-07 16:52:47] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2024-06-07 16:52:47] [INFO ] After 537ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-06-07 16:52:47] [INFO ] After 680ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-06-07 16:52:47] [INFO ] After 956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2024-06-07 16:52:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-06-07 16:52:48] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 16:52:49] [INFO ] Deduced a trap composed of 81 places in 380 ms of which 0 ms to minimize.
[2024-06-07 16:52:49] [INFO ] Deduced a trap composed of 81 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:52:50] [INFO ] Deduced a trap composed of 81 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:52:50] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:52:51] [INFO ] Deduced a trap composed of 81 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:52:51] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:52:52] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:52:52] [INFO ] Deduced a trap composed of 81 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:52:53] [INFO ] Deduced a trap composed of 81 places in 383 ms of which 1 ms to minimize.
[2024-06-07 16:52:53] [INFO ] Deduced a trap composed of 81 places in 458 ms of which 0 ms to minimize.
[2024-06-07 16:52:54] [INFO ] Deduced a trap composed of 161 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:52:54] [INFO ] Deduced a trap composed of 81 places in 376 ms of which 1 ms to minimize.
[2024-06-07 16:52:54] [INFO ] Deduced a trap composed of 209 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:52:55] [INFO ] Deduced a trap composed of 81 places in 377 ms of which 0 ms to minimize.
[2024-06-07 16:52:55] [INFO ] Deduced a trap composed of 176 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:52:56] [INFO ] Deduced a trap composed of 81 places in 386 ms of which 0 ms to minimize.
[2024-06-07 16:52:56] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:52:57] [INFO ] Deduced a trap composed of 81 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:52:57] [INFO ] Deduced a trap composed of 200 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:52:58] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:52:58] [INFO ] Deduced a trap composed of 144 places in 376 ms of which 1 ms to minimize.
[2024-06-07 16:52:58] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 1 ms to minimize.
[2024-06-07 16:52:59] [INFO ] Deduced a trap composed of 81 places in 376 ms of which 1 ms to minimize.
[2024-06-07 16:52:59] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 0 ms to minimize.
[2024-06-07 16:53:00] [INFO ] Deduced a trap composed of 125 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:53:00] [INFO ] Deduced a trap composed of 216 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:53:01] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 1 ms to minimize.
[2024-06-07 16:53:01] [INFO ] Deduced a trap composed of 125 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:53:02] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 0 ms to minimize.
[2024-06-07 16:53:02] [INFO ] Deduced a trap composed of 81 places in 432 ms of which 1 ms to minimize.
[2024-06-07 16:53:03] [INFO ] Deduced a trap composed of 225 places in 392 ms of which 0 ms to minimize.
[2024-06-07 16:53:03] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:53:04] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 0 ms to minimize.
[2024-06-07 16:53:04] [INFO ] Deduced a trap composed of 81 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:53:04] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:53:05] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:53:05] [INFO ] Deduced a trap composed of 104 places in 382 ms of which 2 ms to minimize.
[2024-06-07 16:53:06] [INFO ] Deduced a trap composed of 125 places in 378 ms of which 0 ms to minimize.
[2024-06-07 16:53:06] [INFO ] Deduced a trap composed of 81 places in 386 ms of which 1 ms to minimize.
[2024-06-07 16:53:07] [INFO ] Deduced a trap composed of 216 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:53:07] [INFO ] Deduced a trap composed of 81 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:53:08] [INFO ] Deduced a trap composed of 56 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:53:08] [INFO ] Deduced a trap composed of 144 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:53:08] [INFO ] Deduced a trap composed of 176 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:53:09] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:53:09] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 0 ms to minimize.
[2024-06-07 16:53:10] [INFO ] Deduced a trap composed of 81 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:53:10] [INFO ] Deduced a trap composed of 81 places in 409 ms of which 1 ms to minimize.
[2024-06-07 16:53:11] [INFO ] Deduced a trap composed of 81 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:53:11] [INFO ] Deduced a trap composed of 81 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:53:12] [INFO ] Deduced a trap composed of 81 places in 410 ms of which 1 ms to minimize.
[2024-06-07 16:53:12] [INFO ] Deduced a trap composed of 104 places in 416 ms of which 0 ms to minimize.
[2024-06-07 16:53:13] [INFO ] Deduced a trap composed of 104 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:53:13] [INFO ] Deduced a trap composed of 144 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:53:14] [INFO ] Deduced a trap composed of 104 places in 376 ms of which 1 ms to minimize.
[2024-06-07 16:53:14] [INFO ] Deduced a trap composed of 81 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:53:15] [INFO ] Deduced a trap composed of 56 places in 359 ms of which 1 ms to minimize.
[2024-06-07 16:53:15] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 0 ms to minimize.
[2024-06-07 16:53:15] [INFO ] Deduced a trap composed of 104 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:53:16] [INFO ] Deduced a trap composed of 221 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:53:16] [INFO ] Deduced a trap composed of 104 places in 399 ms of which 0 ms to minimize.
[2024-06-07 16:53:17] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:53:17] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 0 ms to minimize.
[2024-06-07 16:53:18] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:53:18] [INFO ] Deduced a trap composed of 189 places in 375 ms of which 1 ms to minimize.
[2024-06-07 16:53:19] [INFO ] Deduced a trap composed of 209 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:53:19] [INFO ] Deduced a trap composed of 161 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:53:20] [INFO ] Deduced a trap composed of 125 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:53:20] [INFO ] Deduced a trap composed of 104 places in 404 ms of which 1 ms to minimize.
[2024-06-07 16:53:21] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:53:21] [INFO ] Deduced a trap composed of 209 places in 421 ms of which 0 ms to minimize.
[2024-06-07 16:53:22] [INFO ] Deduced a trap composed of 144 places in 405 ms of which 0 ms to minimize.
[2024-06-07 16:53:22] [INFO ] Deduced a trap composed of 81 places in 416 ms of which 1 ms to minimize.
[2024-06-07 16:53:23] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 0 ms to minimize.
[2024-06-07 16:53:23] [INFO ] Deduced a trap composed of 189 places in 396 ms of which 0 ms to minimize.
[2024-06-07 16:53:23] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 1 ms to minimize.
[2024-06-07 16:53:24] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:53:24] [INFO ] Deduced a trap composed of 104 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:53:25] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:53:25] [INFO ] Deduced a trap composed of 56 places in 418 ms of which 1 ms to minimize.
[2024-06-07 16:53:26] [INFO ] Deduced a trap composed of 81 places in 418 ms of which 1 ms to minimize.
[2024-06-07 16:53:26] [INFO ] Deduced a trap composed of 221 places in 409 ms of which 1 ms to minimize.
[2024-06-07 16:53:27] [INFO ] Deduced a trap composed of 81 places in 422 ms of which 1 ms to minimize.
[2024-06-07 16:53:27] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 1 ms to minimize.
[2024-06-07 16:53:28] [INFO ] Deduced a trap composed of 161 places in 407 ms of which 0 ms to minimize.
[2024-06-07 16:53:28] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 1 ms to minimize.
[2024-06-07 16:53:29] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:53:29] [INFO ] Deduced a trap composed of 104 places in 438 ms of which 1 ms to minimize.
[2024-06-07 16:53:30] [INFO ] Deduced a trap composed of 56 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:53:30] [INFO ] Deduced a trap composed of 125 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:53:31] [INFO ] Deduced a trap composed of 104 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:53:31] [INFO ] Deduced a trap composed of 104 places in 407 ms of which 1 ms to minimize.
[2024-06-07 16:53:32] [INFO ] Deduced a trap composed of 144 places in 415 ms of which 0 ms to minimize.
[2024-06-07 16:53:32] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:53:33] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 1 ms to minimize.
[2024-06-07 16:53:33] [INFO ] Deduced a trap composed of 125 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:53:34] [INFO ] Deduced a trap composed of 125 places in 399 ms of which 1 ms to minimize.
[2024-06-07 16:53:34] [INFO ] Deduced a trap composed of 144 places in 408 ms of which 1 ms to minimize.
[2024-06-07 16:53:35] [INFO ] Deduced a trap composed of 161 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:53:35] [INFO ] Deduced a trap composed of 189 places in 415 ms of which 0 ms to minimize.
[2024-06-07 16:53:36] [INFO ] Deduced a trap composed of 81 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:53:36] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:53:37] [INFO ] Deduced a trap composed of 161 places in 412 ms of which 1 ms to minimize.
[2024-06-07 16:53:37] [INFO ] Deduced a trap composed of 125 places in 412 ms of which 1 ms to minimize.
[2024-06-07 16:53:38] [INFO ] Deduced a trap composed of 104 places in 416 ms of which 1 ms to minimize.
[2024-06-07 16:53:38] [INFO ] Deduced a trap composed of 125 places in 401 ms of which 0 ms to minimize.
[2024-06-07 16:53:39] [INFO ] Deduced a trap composed of 125 places in 407 ms of which 1 ms to minimize.
[2024-06-07 16:53:39] [INFO ] Deduced a trap composed of 144 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:53:40] [INFO ] Deduced a trap composed of 81 places in 411 ms of which 1 ms to minimize.
[2024-06-07 16:53:40] [INFO ] Deduced a trap composed of 81 places in 408 ms of which 0 ms to minimize.
[2024-06-07 16:53:40] [INFO ] Deduced a trap composed of 176 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:53:41] [INFO ] Deduced a trap composed of 104 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:53:41] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 1 ms to minimize.
[2024-06-07 16:53:42] [INFO ] Deduced a trap composed of 104 places in 410 ms of which 1 ms to minimize.
[2024-06-07 16:53:42] [INFO ] Deduced a trap composed of 125 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:53:43] [INFO ] Deduced a trap composed of 105 places in 409 ms of which 1 ms to minimize.
[2024-06-07 16:53:43] [INFO ] Deduced a trap composed of 144 places in 407 ms of which 1 ms to minimize.
[2024-06-07 16:53:44] [INFO ] Deduced a trap composed of 104 places in 410 ms of which 0 ms to minimize.
[2024-06-07 16:53:44] [INFO ] Deduced a trap composed of 161 places in 417 ms of which 1 ms to minimize.
[2024-06-07 16:53:45] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:53:45] [INFO ] Deduced a trap composed of 216 places in 410 ms of which 0 ms to minimize.
[2024-06-07 16:53:46] [INFO ] Deduced a trap composed of 125 places in 401 ms of which 0 ms to minimize.
[2024-06-07 16:53:46] [INFO ] Deduced a trap composed of 81 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:53:47] [INFO ] Deduced a trap composed of 144 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:53:47] [INFO ] Deduced a trap composed of 56 places in 421 ms of which 0 ms to minimize.
[2024-06-07 16:53:48] [INFO ] Deduced a trap composed of 209 places in 419 ms of which 2 ms to minimize.
[2024-06-07 16:53:48] [INFO ] Deduced a trap composed of 125 places in 396 ms of which 0 ms to minimize.
[2024-06-07 16:53:49] [INFO ] Deduced a trap composed of 104 places in 413 ms of which 1 ms to minimize.
[2024-06-07 16:53:49] [INFO ] Deduced a trap composed of 56 places in 399 ms of which 0 ms to minimize.
[2024-06-07 16:53:50] [INFO ] Deduced a trap composed of 221 places in 406 ms of which 0 ms to minimize.
[2024-06-07 16:53:50] [INFO ] Deduced a trap composed of 125 places in 420 ms of which 1 ms to minimize.
[2024-06-07 16:53:51] [INFO ] Deduced a trap composed of 56 places in 399 ms of which 0 ms to minimize.
[2024-06-07 16:53:51] [INFO ] Deduced a trap composed of 200 places in 415 ms of which 0 ms to minimize.
[2024-06-07 16:53:52] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 0 ms to minimize.
[2024-06-07 16:53:52] [INFO ] Deduced a trap composed of 125 places in 415 ms of which 1 ms to minimize.
[2024-06-07 16:53:53] [INFO ] Deduced a trap composed of 81 places in 403 ms of which 0 ms to minimize.
[2024-06-07 16:53:53] [INFO ] Deduced a trap composed of 125 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:53:54] [INFO ] Deduced a trap composed of 161 places in 432 ms of which 1 ms to minimize.
[2024-06-07 16:53:54] [INFO ] Deduced a trap composed of 81 places in 408 ms of which 0 ms to minimize.
[2024-06-07 16:53:55] [INFO ] Deduced a trap composed of 104 places in 411 ms of which 1 ms to minimize.
[2024-06-07 16:53:55] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 1 ms to minimize.
[2024-06-07 16:53:56] [INFO ] Deduced a trap composed of 104 places in 409 ms of which 1 ms to minimize.
[2024-06-07 16:53:56] [INFO ] Deduced a trap composed of 125 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:53:57] [INFO ] Deduced a trap composed of 56 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:53:57] [INFO ] Deduced a trap composed of 125 places in 412 ms of which 1 ms to minimize.
[2024-06-07 16:53:58] [INFO ] Deduced a trap composed of 104 places in 412 ms of which 0 ms to minimize.
[2024-06-07 16:53:58] [INFO ] Deduced a trap composed of 125 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:53:59] [INFO ] Deduced a trap composed of 125 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:53:59] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 0 ms to minimize.
[2024-06-07 16:54:00] [INFO ] Deduced a trap composed of 224 places in 399 ms of which 13 ms to minimize.
[2024-06-07 16:54:00] [INFO ] Deduced a trap composed of 144 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:54:01] [INFO ] Deduced a trap composed of 144 places in 415 ms of which 1 ms to minimize.
[2024-06-07 16:54:01] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 0 ms to minimize.
[2024-06-07 16:54:02] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:54:02] [INFO ] Deduced a trap composed of 104 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:54:03] [INFO ] Deduced a trap composed of 104 places in 414 ms of which 1 ms to minimize.
[2024-06-07 16:54:03] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 0 ms to minimize.
[2024-06-07 16:54:04] [INFO ] Deduced a trap composed of 125 places in 418 ms of which 1 ms to minimize.
[2024-06-07 16:54:04] [INFO ] Deduced a trap composed of 144 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:54:04] [INFO ] Deduced a trap composed of 125 places in 407 ms of which 0 ms to minimize.
[2024-06-07 16:54:05] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:54:05] [INFO ] Deduced a trap composed of 105 places in 424 ms of which 0 ms to minimize.
[2024-06-07 16:54:06] [INFO ] Deduced a trap composed of 56 places in 388 ms of which 0 ms to minimize.
[2024-06-07 16:54:06] [INFO ] Deduced a trap composed of 125 places in 406 ms of which 1 ms to minimize.
[2024-06-07 16:54:07] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:54:07] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:54:08] [INFO ] Deduced a trap composed of 125 places in 399 ms of which 1 ms to minimize.
[2024-06-07 16:54:08] [INFO ] Deduced a trap composed of 144 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:54:09] [INFO ] Deduced a trap composed of 161 places in 361 ms of which 0 ms to minimize.
[2024-06-07 16:54:09] [INFO ] Deduced a trap composed of 144 places in 370 ms of which 1 ms to minimize.
[2024-06-07 16:54:10] [INFO ] Deduced a trap composed of 81 places in 390 ms of which 0 ms to minimize.
[2024-06-07 16:54:10] [INFO ] Deduced a trap composed of 144 places in 385 ms of which 0 ms to minimize.
[2024-06-07 16:54:11] [INFO ] Deduced a trap composed of 81 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:54:11] [INFO ] Deduced a trap composed of 104 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:54:12] [INFO ] Deduced a trap composed of 125 places in 396 ms of which 0 ms to minimize.
[2024-06-07 16:54:12] [INFO ] Deduced a trap composed of 56 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:54:12] [INFO ] Deduced a trap composed of 104 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:54:13] [INFO ] Deduced a trap composed of 125 places in 370 ms of which 1 ms to minimize.
[2024-06-07 16:54:13] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 0 ms to minimize.
[2024-06-07 16:54:14] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:54:14] [INFO ] Deduced a trap composed of 56 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:54:15] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:54:15] [INFO ] Deduced a trap composed of 104 places in 406 ms of which 1 ms to minimize.
[2024-06-07 16:54:16] [INFO ] Deduced a trap composed of 221 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:54:16] [INFO ] Deduced a trap composed of 104 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:54:17] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:54:17] [INFO ] Deduced a trap composed of 125 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:54:18] [INFO ] Deduced a trap composed of 104 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:54:18] [INFO ] Deduced a trap composed of 209 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:54:19] [INFO ] Deduced a trap composed of 125 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:54:19] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 1 ms to minimize.
[2024-06-07 16:54:20] [INFO ] Deduced a trap composed of 104 places in 399 ms of which 1 ms to minimize.
[2024-06-07 16:54:20] [INFO ] Deduced a trap composed of 104 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:54:21] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 0 ms to minimize.
[2024-06-07 16:54:21] [INFO ] Deduced a trap composed of 104 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:54:22] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:54:22] [INFO ] Deduced a trap composed of 56 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:54:22] [INFO ] Deduced a trap composed of 104 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:54:23] [INFO ] Deduced a trap composed of 125 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:54:23] [INFO ] Deduced a trap composed of 189 places in 373 ms of which 1 ms to minimize.
[2024-06-07 16:54:24] [INFO ] Deduced a trap composed of 144 places in 373 ms of which 1 ms to minimize.
[2024-06-07 16:54:24] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 0 ms to minimize.
[2024-06-07 16:54:25] [INFO ] Deduced a trap composed of 104 places in 416 ms of which 1 ms to minimize.
[2024-06-07 16:54:26] [INFO ] Deduced a trap composed of 56 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:54:26] [INFO ] Deduced a trap composed of 125 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:54:26] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 1 ms to minimize.
[2024-06-07 16:54:27] [INFO ] Deduced a trap composed of 104 places in 407 ms of which 1 ms to minimize.
[2024-06-07 16:54:27] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:54:28] [INFO ] Deduced a trap composed of 81 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:54:28] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:54:29] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 0 ms to minimize.
[2024-06-07 16:54:29] [INFO ] Deduced a trap composed of 144 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:54:30] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:54:30] [INFO ] Deduced a trap composed of 125 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:54:31] [INFO ] Deduced a trap composed of 81 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:54:31] [INFO ] Deduced a trap composed of 104 places in 374 ms of which 1 ms to minimize.
[2024-06-07 16:54:32] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:54:32] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:54:33] [INFO ] Deduced a trap composed of 125 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:54:33] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:54:34] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:54:34] [INFO ] Deduced a trap composed of 144 places in 389 ms of which 0 ms to minimize.
[2024-06-07 16:54:35] [INFO ] Deduced a trap composed of 161 places in 410 ms of which 1 ms to minimize.
[2024-06-07 16:54:35] [INFO ] Deduced a trap composed of 104 places in 410 ms of which 1 ms to minimize.
[2024-06-07 16:54:36] [INFO ] Deduced a trap composed of 125 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:54:36] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:54:37] [INFO ] Deduced a trap composed of 144 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:54:37] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:54:38] [INFO ] Deduced a trap composed of 144 places in 384 ms of which 0 ms to minimize.
[2024-06-07 16:54:38] [INFO ] Deduced a trap composed of 104 places in 382 ms of which 0 ms to minimize.
[2024-06-07 16:54:39] [INFO ] Deduced a trap composed of 161 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:54:39] [INFO ] Deduced a trap composed of 125 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:54:39] [INFO ] Deduced a trap composed of 144 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:54:40] [INFO ] Deduced a trap composed of 125 places in 387 ms of which 0 ms to minimize.
[2024-06-07 16:54:40] [INFO ] Deduced a trap composed of 161 places in 380 ms of which 0 ms to minimize.
[2024-06-07 16:54:41] [INFO ] Deduced a trap composed of 125 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:54:41] [INFO ] Deduced a trap composed of 144 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:54:42] [INFO ] Deduced a trap composed of 125 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:54:42] [INFO ] Deduced a trap composed of 144 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:54:43] [INFO ] Deduced a trap composed of 144 places in 373 ms of which 0 ms to minimize.
[2024-06-07 16:54:43] [INFO ] Deduced a trap composed of 144 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:54:44] [INFO ] Deduced a trap composed of 221 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:54:44] [INFO ] Deduced a trap composed of 104 places in 413 ms of which 1 ms to minimize.
[2024-06-07 16:54:45] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:54:45] [INFO ] Deduced a trap composed of 176 places in 420 ms of which 1 ms to minimize.
[2024-06-07 16:54:46] [INFO ] Deduced a trap composed of 144 places in 396 ms of which 0 ms to minimize.
[2024-06-07 16:54:46] [INFO ] Deduced a trap composed of 125 places in 399 ms of which 0 ms to minimize.
[2024-06-07 16:54:47] [INFO ] Deduced a trap composed of 144 places in 408 ms of which 1 ms to minimize.
[2024-06-07 16:54:47] [INFO ] Deduced a trap composed of 104 places in 400 ms of which 1 ms to minimize.
[2024-06-07 16:54:48] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 0 ms to minimize.
[2024-06-07 16:54:48] [INFO ] Deduced a trap composed of 125 places in 377 ms of which 0 ms to minimize.
[2024-06-07 16:54:49] [INFO ] Deduced a trap composed of 81 places in 399 ms of which 5 ms to minimize.
[2024-06-07 16:54:49] [INFO ] Deduced a trap composed of 104 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:54:50] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 1 ms to minimize.
[2024-06-07 16:54:50] [INFO ] Deduced a trap composed of 125 places in 408 ms of which 1 ms to minimize.
[2024-06-07 16:54:51] [INFO ] Deduced a trap composed of 144 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:54:51] [INFO ] Deduced a trap composed of 161 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:54:52] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:54:52] [INFO ] Deduced a trap composed of 161 places in 396 ms of which 1 ms to minimize.
[2024-06-07 16:54:53] [INFO ] Deduced a trap composed of 104 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:54:53] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:54:54] [INFO ] Deduced a trap composed of 144 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:54:54] [INFO ] Deduced a trap composed of 104 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:54:55] [INFO ] Deduced a trap composed of 176 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:54:55] [INFO ] Deduced a trap composed of 104 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:54:56] [INFO ] Deduced a trap composed of 161 places in 371 ms of which 0 ms to minimize.
[2024-06-07 16:54:56] [INFO ] Deduced a trap composed of 81 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:54:57] [INFO ] Deduced a trap composed of 125 places in 386 ms of which 1 ms to minimize.
[2024-06-07 16:54:57] [INFO ] Deduced a trap composed of 144 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:54:58] [INFO ] Deduced a trap composed of 125 places in 383 ms of which 1 ms to minimize.
[2024-06-07 16:54:58] [INFO ] Deduced a trap composed of 144 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:54:59] [INFO ] Deduced a trap composed of 104 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:54:59] [INFO ] Deduced a trap composed of 104 places in 404 ms of which 0 ms to minimize.
[2024-06-07 16:55:00] [INFO ] Deduced a trap composed of 81 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:55:00] [INFO ] Deduced a trap composed of 104 places in 397 ms of which 0 ms to minimize.
[2024-06-07 16:55:01] [INFO ] Deduced a trap composed of 81 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:55:01] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 0 ms to minimize.
[2024-06-07 16:55:02] [INFO ] Deduced a trap composed of 56 places in 380 ms of which 0 ms to minimize.
[2024-06-07 16:55:02] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:55:03] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 0 ms to minimize.
[2024-06-07 16:55:03] [INFO ] Deduced a trap composed of 56 places in 417 ms of which 1 ms to minimize.
[2024-06-07 16:55:04] [INFO ] Deduced a trap composed of 125 places in 420 ms of which 0 ms to minimize.
[2024-06-07 16:55:04] [INFO ] Deduced a trap composed of 104 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:55:05] [INFO ] Deduced a trap composed of 104 places in 410 ms of which 0 ms to minimize.
[2024-06-07 16:55:05] [INFO ] Deduced a trap composed of 224 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:55:06] [INFO ] Deduced a trap composed of 189 places in 395 ms of which 1 ms to minimize.
[2024-06-07 16:55:06] [INFO ] Deduced a trap composed of 125 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:55:07] [INFO ] Deduced a trap composed of 56 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:55:07] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:55:08] [INFO ] Deduced a trap composed of 56 places in 402 ms of which 1 ms to minimize.
[2024-06-07 16:55:08] [INFO ] Deduced a trap composed of 104 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:55:09] [INFO ] Deduced a trap composed of 125 places in 399 ms of which 0 ms to minimize.
[2024-06-07 16:55:09] [INFO ] Deduced a trap composed of 144 places in 380 ms of which 0 ms to minimize.
[2024-06-07 16:55:10] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:55:10] [INFO ] Deduced a trap composed of 176 places in 393 ms of which 1 ms to minimize.
[2024-06-07 16:55:11] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:55:11] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:55:12] [INFO ] Deduced a trap composed of 144 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:55:12] [INFO ] Deduced a trap composed of 56 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:55:13] [INFO ] Deduced a trap composed of 161 places in 378 ms of which 0 ms to minimize.
[2024-06-07 16:55:13] [INFO ] Deduced a trap composed of 144 places in 404 ms of which 1 ms to minimize.
[2024-06-07 16:55:14] [INFO ] Deduced a trap composed of 125 places in 400 ms of which 0 ms to minimize.
[2024-06-07 16:55:14] [INFO ] Deduced a trap composed of 125 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:55:15] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:55:15] [INFO ] Deduced a trap composed of 144 places in 386 ms of which 1 ms to minimize.
[2024-06-07 16:55:16] [INFO ] Deduced a trap composed of 144 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:55:16] [INFO ] Deduced a trap composed of 81 places in 408 ms of which 2 ms to minimize.
[2024-06-07 16:55:17] [INFO ] Deduced a trap composed of 125 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:55:17] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:55:17] [INFO ] Deduced a trap composed of 144 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:55:18] [INFO ] Deduced a trap composed of 144 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:55:18] [INFO ] Deduced a trap composed of 144 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:55:19] [INFO ] Deduced a trap composed of 161 places in 367 ms of which 0 ms to minimize.
[2024-06-07 16:55:19] [INFO ] Deduced a trap composed of 144 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:55:20] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:55:20] [INFO ] Deduced a trap composed of 125 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:55:21] [INFO ] Deduced a trap composed of 104 places in 399 ms of which 1 ms to minimize.
[2024-06-07 16:55:21] [INFO ] Deduced a trap composed of 176 places in 375 ms of which 0 ms to minimize.
[2024-06-07 16:55:22] [INFO ] Deduced a trap composed of 144 places in 379 ms of which 0 ms to minimize.
[2024-06-07 16:55:22] [INFO ] Deduced a trap composed of 125 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:55:23] [INFO ] Deduced a trap composed of 56 places in 369 ms of which 1 ms to minimize.
[2024-06-07 16:55:23] [INFO ] Deduced a trap composed of 144 places in 373 ms of which 1 ms to minimize.
[2024-06-07 16:55:24] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 0 ms to minimize.
[2024-06-07 16:55:24] [INFO ] Deduced a trap composed of 161 places in 378 ms of which 0 ms to minimize.
[2024-06-07 16:55:25] [INFO ] Deduced a trap composed of 144 places in 384 ms of which 0 ms to minimize.
[2024-06-07 16:55:25] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:55:26] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:55:26] [INFO ] Deduced a trap composed of 176 places in 397 ms of which 1 ms to minimize.
[2024-06-07 16:55:27] [INFO ] Deduced a trap composed of 104 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:55:27] [INFO ] Deduced a trap composed of 104 places in 401 ms of which 1 ms to minimize.
[2024-06-07 16:55:28] [INFO ] Deduced a trap composed of 104 places in 373 ms of which 1 ms to minimize.
[2024-06-07 16:55:28] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 0 ms to minimize.
[2024-06-07 16:55:29] [INFO ] Deduced a trap composed of 56 places in 376 ms of which 0 ms to minimize.
[2024-06-07 16:55:29] [INFO ] Deduced a trap composed of 144 places in 370 ms of which 1 ms to minimize.
[2024-06-07 16:55:30] [INFO ] Deduced a trap composed of 221 places in 385 ms of which 0 ms to minimize.
[2024-06-07 16:55:30] [INFO ] Deduced a trap composed of 104 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:55:31] [INFO ] Deduced a trap composed of 125 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:55:31] [INFO ] Deduced a trap composed of 125 places in 369 ms of which 1 ms to minimize.
[2024-06-07 16:55:32] [INFO ] Deduced a trap composed of 81 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:55:32] [INFO ] Deduced a trap composed of 104 places in 370 ms of which 1 ms to minimize.
[2024-06-07 16:55:32] [INFO ] Deduced a trap composed of 125 places in 372 ms of which 0 ms to minimize.
[2024-06-07 16:55:33] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 1 ms to minimize.
[2024-06-07 16:55:33] [INFO ] Deduced a trap composed of 144 places in 371 ms of which 1 ms to minimize.
[2024-06-07 16:55:34] [INFO ] Deduced a trap composed of 125 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:55:34] [INFO ] Deduced a trap composed of 144 places in 368 ms of which 1 ms to minimize.
[2024-06-07 16:55:35] [INFO ] Deduced a trap composed of 224 places in 370 ms of which 1 ms to minimize.
[2024-06-07 16:55:35] [INFO ] Deduced a trap composed of 144 places in 376 ms of which 1 ms to minimize.
[2024-06-07 16:55:36] [INFO ] Deduced a trap composed of 161 places in 357 ms of which 1 ms to minimize.
[2024-06-07 16:55:36] [INFO ] Deduced a trap composed of 56 places in 368 ms of which 0 ms to minimize.
[2024-06-07 16:55:37] [INFO ] Deduced a trap composed of 221 places in 368 ms of which 1 ms to minimize.
[2024-06-07 16:55:37] [INFO ] Deduced a trap composed of 125 places in 371 ms of which 1 ms to minimize.
[2024-06-07 16:55:38] [INFO ] Deduced a trap composed of 104 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:55:38] [INFO ] Deduced a trap composed of 56 places in 358 ms of which 0 ms to minimize.
[2024-06-07 16:55:39] [INFO ] Deduced a trap composed of 81 places in 366 ms of which 1 ms to minimize.
[2024-06-07 16:55:39] [INFO ] Deduced a trap composed of 176 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:55:40] [INFO ] Deduced a trap composed of 189 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:55:40] [INFO ] Deduced a trap composed of 209 places in 372 ms of which 0 ms to minimize.
[2024-06-07 16:55:41] [INFO ] Deduced a trap composed of 104 places in 385 ms of which 1 ms to minimize.
[2024-06-07 16:55:41] [INFO ] Deduced a trap composed of 56 places in 363 ms of which 1 ms to minimize.
[2024-06-07 16:55:42] [INFO ] Deduced a trap composed of 125 places in 368 ms of which 1 ms to minimize.
[2024-06-07 16:55:42] [INFO ] Deduced a trap composed of 104 places in 383 ms of which 1 ms to minimize.
[2024-06-07 16:55:43] [INFO ] Deduced a trap composed of 56 places in 375 ms of which 1 ms to minimize.
[2024-06-07 16:55:43] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:55:44] [INFO ] Deduced a trap composed of 144 places in 371 ms of which 0 ms to minimize.
[2024-06-07 16:55:44] [INFO ] Deduced a trap composed of 125 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:55:45] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 0 ms to minimize.
[2024-06-07 16:55:45] [INFO ] Deduced a trap composed of 125 places in 364 ms of which 1 ms to minimize.
[2024-06-07 16:55:46] [INFO ] Deduced a trap composed of 144 places in 368 ms of which 0 ms to minimize.
[2024-06-07 16:55:46] [INFO ] Deduced a trap composed of 125 places in 380 ms of which 0 ms to minimize.
[2024-06-07 16:55:47] [INFO ] Deduced a trap composed of 125 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:55:47] [INFO ] Deduced a trap composed of 144 places in 361 ms of which 1 ms to minimize.
[2024-06-07 16:55:47] [INFO ] Deduced a trap composed of 161 places in 344 ms of which 1 ms to minimize.
[2024-06-07 16:55:48] [INFO ] Deduced a trap composed of 144 places in 355 ms of which 0 ms to minimize.
[2024-06-07 16:55:49] [INFO ] Deduced a trap composed of 56 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:55:49] [INFO ] Deduced a trap composed of 104 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:55:50] [INFO ] Deduced a trap composed of 125 places in 377 ms of which 0 ms to minimize.
[2024-06-07 16:55:50] [INFO ] Deduced a trap composed of 224 places in 379 ms of which 1 ms to minimize.
[2024-06-07 16:55:51] [INFO ] Deduced a trap composed of 209 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:55:51] [INFO ] Deduced a trap composed of 104 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:55:52] [INFO ] Deduced a trap composed of 56 places in 377 ms of which 1 ms to minimize.
[2024-06-07 16:55:52] [INFO ] Deduced a trap composed of 216 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:55:52] [INFO ] Deduced a trap composed of 125 places in 373 ms of which 0 ms to minimize.
[2024-06-07 16:55:53] [INFO ] Deduced a trap composed of 104 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:55:53] [INFO ] Deduced a trap composed of 104 places in 374 ms of which 1 ms to minimize.
[2024-06-07 16:55:54] [INFO ] Deduced a trap composed of 125 places in 378 ms of which 1 ms to minimize.
[2024-06-07 16:55:54] [INFO ] Deduced a trap composed of 144 places in 378 ms of which 0 ms to minimize.
[2024-06-07 16:55:55] [INFO ] Deduced a trap composed of 104 places in 383 ms of which 0 ms to minimize.
[2024-06-07 16:55:55] [INFO ] Deduced a trap composed of 125 places in 366 ms of which 1 ms to minimize.
[2024-06-07 16:55:56] [INFO ] Deduced a trap composed of 125 places in 374 ms of which 1 ms to minimize.
[2024-06-07 16:55:56] [INFO ] Deduced a trap composed of 56 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:55:57] [INFO ] Deduced a trap composed of 104 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:55:57] [INFO ] Deduced a trap composed of 104 places in 364 ms of which 1 ms to minimize.
[2024-06-07 16:55:58] [INFO ] Deduced a trap composed of 221 places in 368 ms of which 1 ms to minimize.
[2024-06-07 16:55:58] [INFO ] Deduced a trap composed of 125 places in 367 ms of which 1 ms to minimize.
[2024-06-07 16:55:59] [INFO ] Deduced a trap composed of 125 places in 375 ms of which 1 ms to minimize.
[2024-06-07 16:55:59] [INFO ] Deduced a trap composed of 209 places in 368 ms of which 0 ms to minimize.
[2024-06-07 16:56:00] [INFO ] Deduced a trap composed of 125 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:56:00] [INFO ] Deduced a trap composed of 144 places in 371 ms of which 1 ms to minimize.
[2024-06-07 16:56:01] [INFO ] Deduced a trap composed of 161 places in 383 ms of which 1 ms to minimize.
[2024-06-07 16:56:01] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 1 ms to minimize.
[2024-06-07 16:56:02] [INFO ] Deduced a trap composed of 104 places in 396 ms of which 0 ms to minimize.
[2024-06-07 16:56:02] [INFO ] Deduced a trap composed of 125 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:56:03] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:56:03] [INFO ] Deduced a trap composed of 144 places in 377 ms of which 0 ms to minimize.
[2024-06-07 16:56:04] [INFO ] Deduced a trap composed of 81 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:56:04] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 4 ms to minimize.
[2024-06-07 16:56:05] [INFO ] Deduced a trap composed of 144 places in 365 ms of which 1 ms to minimize.
[2024-06-07 16:56:05] [INFO ] Deduced a trap composed of 144 places in 399 ms of which 0 ms to minimize.
[2024-06-07 16:56:06] [INFO ] Deduced a trap composed of 200 places in 362 ms of which 1 ms to minimize.
[2024-06-07 16:56:06] [INFO ] Deduced a trap composed of 144 places in 369 ms of which 1 ms to minimize.
[2024-06-07 16:56:07] [INFO ] Deduced a trap composed of 56 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:56:07] [INFO ] Deduced a trap composed of 176 places in 378 ms of which 0 ms to minimize.
[2024-06-07 16:56:08] [INFO ] Deduced a trap composed of 176 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:56:08] [INFO ] Deduced a trap composed of 104 places in 381 ms of which 0 ms to minimize.
[2024-06-07 16:56:09] [INFO ] Deduced a trap composed of 56 places in 399 ms of which 1 ms to minimize.
[2024-06-07 16:56:09] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:56:10] [INFO ] Deduced a trap composed of 125 places in 373 ms of which 0 ms to minimize.
[2024-06-07 16:56:11] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:56:11] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 0 ms to minimize.
[2024-06-07 16:56:12] [INFO ] Deduced a trap composed of 125 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:56:12] [INFO ] Deduced a trap composed of 81 places in 407 ms of which 1 ms to minimize.
[2024-06-07 16:56:13] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:56:13] [INFO ] Deduced a trap composed of 144 places in 381 ms of which 1 ms to minimize.
[2024-06-07 16:56:14] [INFO ] Deduced a trap composed of 104 places in 390 ms of which 1 ms to minimize.
[2024-06-07 16:56:14] [INFO ] Deduced a trap composed of 125 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:56:15] [INFO ] Deduced a trap composed of 125 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:56:15] [INFO ] Deduced a trap composed of 221 places in 391 ms of which 0 ms to minimize.
[2024-06-07 16:56:16] [INFO ] Deduced a trap composed of 81 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:56:16] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:56:17] [INFO ] Deduced a trap composed of 104 places in 398 ms of which 1 ms to minimize.
[2024-06-07 16:56:17] [INFO ] Deduced a trap composed of 56 places in 380 ms of which 0 ms to minimize.
[2024-06-07 16:56:18] [INFO ] Deduced a trap composed of 81 places in 405 ms of which 1 ms to minimize.
[2024-06-07 16:56:18] [INFO ] Deduced a trap composed of 56 places in 393 ms of which 0 ms to minimize.
[2024-06-07 16:56:19] [INFO ] Deduced a trap composed of 56 places in 388 ms of which 1 ms to minimize.
[2024-06-07 16:56:19] [INFO ] Deduced a trap composed of 161 places in 366 ms of which 1 ms to minimize.
[2024-06-07 16:56:20] [INFO ] Deduced a trap composed of 144 places in 371 ms of which 0 ms to minimize.
[2024-06-07 16:56:20] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 0 ms to minimize.
[2024-06-07 16:56:21] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:56:21] [INFO ] Deduced a trap composed of 125 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:56:22] [INFO ] Deduced a trap composed of 104 places in 387 ms of which 0 ms to minimize.
[2024-06-07 16:56:22] [INFO ] Deduced a trap composed of 144 places in 367 ms of which 1 ms to minimize.
[2024-06-07 16:56:23] [INFO ] Deduced a trap composed of 125 places in 372 ms of which 0 ms to minimize.
[2024-06-07 16:56:23] [INFO ] Deduced a trap composed of 125 places in 369 ms of which 1 ms to minimize.
[2024-06-07 16:56:24] [INFO ] Deduced a trap composed of 144 places in 362 ms of which 1 ms to minimize.
[2024-06-07 16:56:24] [INFO ] Deduced a trap composed of 56 places in 375 ms of which 1 ms to minimize.
[2024-06-07 16:56:25] [INFO ] Deduced a trap composed of 144 places in 372 ms of which 1 ms to minimize.
[2024-06-07 16:56:25] [INFO ] Deduced a trap composed of 104 places in 373 ms of which 1 ms to minimize.
[2024-06-07 16:56:26] [INFO ] Deduced a trap composed of 125 places in 380 ms of which 1 ms to minimize.
[2024-06-07 16:56:26] [INFO ] Deduced a trap composed of 144 places in 371 ms of which 1 ms to minimize.
[2024-06-07 16:56:27] [INFO ] Deduced a trap composed of 144 places in 366 ms of which 0 ms to minimize.
[2024-06-07 16:56:27] [INFO ] Deduced a trap composed of 161 places in 358 ms of which 0 ms to minimize.
[2024-06-07 16:56:28] [INFO ] Deduced a trap composed of 104 places in 384 ms of which 1 ms to minimize.
[2024-06-07 16:56:28] [INFO ] Deduced a trap composed of 104 places in 384 ms of which 0 ms to minimize.
[2024-06-07 16:56:29] [INFO ] Deduced a trap composed of 209 places in 377 ms of which 1 ms to minimize.
[2024-06-07 16:56:29] [INFO ] Deduced a trap composed of 125 places in 389 ms of which 0 ms to minimize.
[2024-06-07 16:56:30] [INFO ] Deduced a trap composed of 144 places in 387 ms of which 1 ms to minimize.
[2024-06-07 16:56:30] [INFO ] Deduced a trap composed of 104 places in 383 ms of which 0 ms to minimize.
[2024-06-07 16:56:31] [INFO ] Deduced a trap composed of 144 places in 362 ms of which 1 ms to minimize.
[2024-06-07 16:56:31] [INFO ] Deduced a trap composed of 125 places in 377 ms of which 1 ms to minimize.
[2024-06-07 16:56:32] [INFO ] Deduced a trap composed of 104 places in 394 ms of which 1 ms to minimize.
[2024-06-07 16:56:32] [INFO ] Deduced a trap composed of 125 places in 382 ms of which 1 ms to minimize.
[2024-06-07 16:56:33] [INFO ] Deduced a trap composed of 29 places in 466 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 16:56:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 16:56:33] [INFO ] After 225488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:1
FORMULA BlocksWorld-PT-05-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BlocksWorld-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 785 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 7 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 16:56:33] [INFO ] Computed 57 invariants in 7 ms
[2024-06-07 16:56:34] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-07 16:56:34] [INFO ] Invariant cache hit.
[2024-06-07 16:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:56:34] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-06-07 16:56:34] [INFO ] Invariant cache hit.
[2024-06-07 16:56:35] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1271 ms. Remains : 841/841 places, 1569/1569 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s64 1) (GEQ s668 1)) (AND (GEQ s2 1) (GEQ s82 1) (GEQ s833 1)) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s109 1)) (AND (GEQ s2 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33333 reset in 5370 ms.
Product exploration explored 100000 steps with 33333 reset in 5074 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-05-LTLFireability-00 finished in 12088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 57 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 74 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:56:46] [INFO ] Invariant cache hit.
[2024-06-07 16:56:46] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-07 16:56:46] [INFO ] Invariant cache hit.
[2024-06-07 16:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:56:47] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-06-07 16:56:47] [INFO ] Invariant cache hit.
[2024-06-07 16:56:48] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2234 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s82 1) (GEQ s83 1)) (AND (GEQ s2 1) (GEQ s61 1) (GEQ s62 1)) (AND (GEQ s2 1) (GEQ s40 1) (GEQ s41 1)) (AND (GEQ s2 1) (GEQ s34...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18364 reset in 1764 ms.
Stack based approach found an accepted trace after 63 steps with 18 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-01 finished in 4145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(p1)&&G(!p2)))))'
Support contains 108 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:56:50] [INFO ] Invariant cache hit.
[2024-06-07 16:56:50] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-07 16:56:50] [INFO ] Invariant cache hit.
[2024-06-07 16:56:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:56:51] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2024-06-07 16:56:51] [INFO ] Invariant cache hit.
[2024-06-07 16:56:52] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1974 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}]], initial=1, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s82 1) (GEQ s83 1)) (AND (GEQ s2 1) (GEQ s61 1) (GEQ s62 1)) (AND (GEQ s2 1) (GEQ s40 1) (GEQ s41 1)) (AND (GEQ s2 1) (GEQ s34...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], 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 BlocksWorld-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-02 finished in 2206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(!p0||F(p1)))))'
Support contains 85 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 161 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:56:52] [INFO ] Invariant cache hit.
[2024-06-07 16:56:52] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-07 16:56:52] [INFO ] Invariant cache hit.
[2024-06-07 16:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:56:53] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2024-06-07 16:56:53] [INFO ] Redundant transitions in 83 ms returned []
[2024-06-07 16:56:53] [INFO ] Invariant cache hit.
[2024-06-07 16:56:54] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2348 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (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 s2 1) (GEQ s82 1) (GEQ s83 1)) (AND (GEQ s2 1) (GEQ s61 1) (GEQ s62 1)) (AND (GEQ s2 1) (GEQ s40 1) (GEQ s41 1)) (AND (GEQ s2 1) (GEQ s34...], 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 12470 reset in 1934 ms.
Stack based approach found an accepted trace after 19 steps with 2 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-03 finished in 4414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p1)||p0))&&F(p2))))'
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 10 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:56:56] [INFO ] Invariant cache hit.
[2024-06-07 16:56:56] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-07 16:56:56] [INFO ] Invariant cache hit.
[2024-06-07 16:56:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:56:57] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-06-07 16:56:57] [INFO ] Invariant cache hit.
[2024-06-07 16:56:58] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1333 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (OR (LT s57 1) (LT s64 1)) (OR (LT s78 1) (LT s82 1)) (OR (LT s15 1) (LT s28 1)) (OR (LT s36 1) (LT s46 1)) (OR (LT s19 1) (LT s84 1)) (OR (LT s4 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-05 finished in 1626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U !p1)&&X(((!G(!p1) U !p0)||G(p1)))))'
Support contains 79 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:56:58] [INFO ] Invariant cache hit.
[2024-06-07 16:56:58] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-07 16:56:58] [INFO ] Invariant cache hit.
[2024-06-07 16:56:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:00] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2024-06-07 16:57:00] [INFO ] Invariant cache hit.
[2024-06-07 16:57:00] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2331 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR p0 p1), (AND (NOT p1) p0), (OR p1 p0), (NOT p1), p0, true]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (OR (LT s57 1) (LT s64 1)) (OR (LT s78 1) (LT s82 1)) (OR (LT s15 1) (LT s28 1)) (OR (LT s36 1) (LT s46 1)) (OR (LT s19 1) (LT s84 1)) (OR (LT s4 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-06 finished in 2684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(!p1)&&p0)))))'
Support contains 57 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:01] [INFO ] Invariant cache hit.
[2024-06-07 16:57:01] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-06-07 16:57:01] [INFO ] Invariant cache hit.
[2024-06-07 16:57:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:02] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
[2024-06-07 16:57:02] [INFO ] Invariant cache hit.
[2024-06-07 16:57:03] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2080 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-07 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 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s82 1) (LT s83 1)) (OR (LT s2 1) (LT s61 1) (LT s62 1)) (OR (LT s2 1) (LT s40 1) (LT s41 1)) (OR (LT s2 1) (LT s34 1) (LT s35 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 2 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-07 finished in 2335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U (!p1||G(!p0)))))))'
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:03] [INFO ] Invariant cache hit.
[2024-06-07 16:57:03] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-07 16:57:03] [INFO ] Invariant cache hit.
[2024-06-07 16:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:05] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1738 ms to find 0 implicit places.
[2024-06-07 16:57:05] [INFO ] Invariant cache hit.
[2024-06-07 16:57:05] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2383 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 389 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (NOT p0), p0, (AND p0 p1), true]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s111 1) (LT s121 1) (LT s155 1) (LT s174 1) (LT s218 1) (LT s238 1) (LT s324 1) (LT s339 1) (LT s420 1) (LT s443 1) (LT s485 1) (LT s509 1) (LT...], 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 13 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-10 finished in 2800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 7 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 16 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:06] [INFO ] Invariant cache hit.
[2024-06-07 16:57:06] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-06-07 16:57:06] [INFO ] Invariant cache hit.
[2024-06-07 16:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:07] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
[2024-06-07 16:57:07] [INFO ] Invariant cache hit.
[2024-06-07 16:57:08] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2350 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s3 1) (GEQ s61 1))) (NOT (AND (GEQ s2 1) (GEQ s82 1) (GEQ s819 1)))), p0:(AND (GEQ s2 1) (GEQ s46 1) (GEQ s47 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 4 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-12 finished in 2528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((p0&&G(p1)))||(p1&&G(p0)))))))'
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:08] [INFO ] Invariant cache hit.
[2024-06-07 16:57:09] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-07 16:57:09] [INFO ] Invariant cache hit.
[2024-06-07 16:57:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:10] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2024-06-07 16:57:10] [INFO ] Invariant cache hit.
[2024-06-07 16:57:11] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3037 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s15 1) (LT s34 1)), p0:(OR (LT s2 1) (LT s49 1) (LT s530 1))], nbAcceptance=2, 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1763 ms.
Product exploration explored 100000 steps with 0 reset in 1952 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 16:57:16] [INFO ] Invariant cache hit.
[2024-06-07 16:57:16] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2024-06-07 16:57:16] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 433 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:17] [INFO ] Invariant cache hit.
[2024-06-07 16:57:18] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-07 16:57:18] [INFO ] Invariant cache hit.
[2024-06-07 16:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:19] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2024-06-07 16:57:19] [INFO ] Invariant cache hit.
[2024-06-07 16:57:20] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2299 ms. Remains : 841/841 places, 1569/1569 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 5348 steps, including 1 resets, run visited all 6 properties in 153 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1622 ms.
Product exploration explored 100000 steps with 0 reset in 1623 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 144 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:25] [INFO ] Redundant transitions in 31 ms returned []
[2024-06-07 16:57:25] [INFO ] Invariant cache hit.
[2024-06-07 16:57:26] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin8517866215498552780
[2024-06-07 16:57:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8517866215498552780
Running compilation step : cd /tmp/ltsmin8517866215498552780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8517866215498552780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8517866215498552780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:57:29] [INFO ] Invariant cache hit.
[2024-06-07 16:57:29] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-06-07 16:57:29] [INFO ] Invariant cache hit.
[2024-06-07 16:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:31] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2024-06-07 16:57:31] [INFO ] Invariant cache hit.
[2024-06-07 16:57:31] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2083 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin5534450975909085501
[2024-06-07 16:57:31] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5534450975909085501
Running compilation step : cd /tmp/ltsmin5534450975909085501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5534450975909085501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5534450975909085501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 16:57:34] [INFO ] Flatten gal took : 68 ms
[2024-06-07 16:57:35] [INFO ] Flatten gal took : 65 ms
[2024-06-07 16:57:35] [INFO ] Time to serialize gal into /tmp/LTL18052431900321179662.gal : 20 ms
[2024-06-07 16:57:35] [INFO ] Time to serialize properties into /tmp/LTL8097959900220090498.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18052431900321179662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15196614277651293252.hoa' '-atoms' '/tmp/LTL8097959900220090498.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8097959900220090498.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15196614277651293252.hoa
Detected timeout of ITS tools.
[2024-06-07 16:57:50] [INFO ] Flatten gal took : 59 ms
[2024-06-07 16:57:50] [INFO ] Flatten gal took : 59 ms
[2024-06-07 16:57:50] [INFO ] Time to serialize gal into /tmp/LTL16695284532524154593.gal : 11 ms
[2024-06-07 16:57:50] [INFO ] Time to serialize properties into /tmp/LTL435441984105660491.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16695284532524154593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL435441984105660491.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))")&&(G("((pred_holding_4<1)||(pred_clear_11<1))"))))||((G("(...268
Formula 0 simplified : XXG(X(!"(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))" | F!"((pred_holding_4<1)||(pred_clear_11<1))") & (!"((pred_hol...254
Detected timeout of ITS tools.
[2024-06-07 16:58:05] [INFO ] Flatten gal took : 55 ms
[2024-06-07 16:58:05] [INFO ] Applying decomposition
[2024-06-07 16:58:05] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12331436392674918399.txt' '-o' '/tmp/graph12331436392674918399.bin' '-w' '/tmp/graph12331436392674918399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12331436392674918399.bin' '-l' '-1' '-v' '-w' '/tmp/graph12331436392674918399.weights' '-q' '0' '-e' '0.001'
[2024-06-07 16:58:05] [INFO ] Decomposing Gal with order
[2024-06-07 16:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 16:58:06] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 16:58:06] [INFO ] Flatten gal took : 296 ms
[2024-06-07 16:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-06-07 16:58:06] [INFO ] Time to serialize gal into /tmp/LTL11850653179488968760.gal : 17 ms
[2024-06-07 16:58:06] [INFO ] Time to serialize properties into /tmp/LTL12919565866683966008.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11850653179488968760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12919565866683966008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((i12.u13.pred_arm_empty_0<1)||(i12.u16.pred_clear_16<1))||(i12.u16.pred_on_380<1))")&&(G("((u4.pred_holding_4<1)||(u11...330
Formula 0 simplified : XXG(X(!"(((i12.u13.pred_arm_empty_0<1)||(i12.u16.pred_clear_16<1))||(i12.u16.pred_on_380<1))" | F!"((u4.pred_holding_4<1)||(u11.pred...316
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7846934923849785125
[2024-06-07 16:58:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7846934923849785125
Running compilation step : cd /tmp/ltsmin7846934923849785125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7846934923849785125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7846934923849785125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BlocksWorld-PT-05-LTLFireability-13 finished in 75670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p1)) U G((F(p2) U p3))))'
Support contains 31 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 24 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:58:24] [INFO ] Invariant cache hit.
[2024-06-07 16:58:24] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-07 16:58:24] [INFO ] Invariant cache hit.
[2024-06-07 16:58:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:58:25] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2024-06-07 16:58:25] [INFO ] Invariant cache hit.
[2024-06-07 16:58:26] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2160 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 450 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(NOT p3), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(NOT p3), acceptance={} source=9 dest: 8}, { cond=true, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s19 1) (GEQ s20 1)), p2:(AND (GEQ s0 1) (GEQ s15 1)), p0:(AND (LT s84 1) (GEQ s111 1) (GEQ s121 1) (GEQ s155 1) (GEQ s174 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 184 reset in 1611 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-14 finished in 4256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(!p0) U X(p1))))))'
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:58:28] [INFO ] Invariant cache hit.
[2024-06-07 16:58:29] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-07 16:58:29] [INFO ] Invariant cache hit.
[2024-06-07 16:58:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:58:30] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
[2024-06-07 16:58:30] [INFO ] Invariant cache hit.
[2024-06-07 16:58:30] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2246 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-15 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: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s111 1) (LT s121 1) (LT s155 1) (LT s174 1) (LT s218 1) (LT s238 1) (LT s324 1) (LT s339 1) (LT s420 1) (LT s443 1) (LT s485 1) (LT s509 1) (LT...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 1642 ms.
Product exploration explored 100000 steps with 20000 reset in 1670 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 16:58:35] [INFO ] Invariant cache hit.
[2024-06-07 16:58:35] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-06-07 16:58:35] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:58:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-06-07 16:58:36] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 16:58:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:58:36] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 16:58:36] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-06-07 16:58:36] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 841 transition count 1568
Applied a total of 1 rules in 2042 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2042 ms. Remains : 841/841 places, 1568/1569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639351 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639351 steps, saw 546477 distinct states, run finished after 3002 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 16:58:41] [INFO ] Computed 57 invariants in 15 ms
[2024-06-07 16:58:42] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-06-07 16:58:42] [INFO ] After 546ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 16:58:42] [INFO ] After 627ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-06-07 16:58:42] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1497 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1498 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1522 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 16:58:45] [INFO ] Invariant cache hit.
[2024-06-07 16:58:46] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-06-07 16:58:46] [INFO ] Invariant cache hit.
[2024-06-07 16:58:47] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2024-06-07 16:58:47] [INFO ] Redundant transitions in 24 ms returned []
[2024-06-07 16:58:47] [INFO ] Invariant cache hit.
[2024-06-07 16:58:47] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3623 ms. Remains : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1535 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 16:58:49] [INFO ] Invariant cache hit.
[2024-06-07 16:58:49] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-06-07 16:58:50] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:58:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-06-07 16:58:50] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 16:58:50] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-06-07 16:58:50] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 16:58:51] [INFO ] Computed 57 invariants in 11 ms
[2024-06-07 16:58:52] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-06-07 16:58:52] [INFO ] Invariant cache hit.
[2024-06-07 16:58:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:58:53] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2024-06-07 16:58:53] [INFO ] Invariant cache hit.
[2024-06-07 16:58:53] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2233 ms. Remains : 841/841 places, 1569/1569 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 16:58:54] [INFO ] Invariant cache hit.
[2024-06-07 16:58:54] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-06-07 16:58:54] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:58:55] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-06-07 16:58:55] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 16:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:58:55] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 16:58:55] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-06-07 16:58:55] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 841 transition count 1568
Applied a total of 1 rules in 2019 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2021 ms. Remains : 841/841 places, 1568/1569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 629871 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 629871 steps, saw 538452 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 16:59:01] [INFO ] Computed 57 invariants in 17 ms
[2024-06-07 16:59:01] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-06-07 16:59:01] [INFO ] After 543ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 16:59:01] [INFO ] After 629ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-06-07 16:59:01] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1537 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1537 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1493 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 16:59:04] [INFO ] Invariant cache hit.
[2024-06-07 16:59:05] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-06-07 16:59:05] [INFO ] Invariant cache hit.
[2024-06-07 16:59:06] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2024-06-07 16:59:06] [INFO ] Redundant transitions in 29 ms returned []
[2024-06-07 16:59:06] [INFO ] Invariant cache hit.
[2024-06-07 16:59:07] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3866 ms. Remains : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1519 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 16:59:08] [INFO ] Invariant cache hit.
[2024-06-07 16:59:08] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-06-07 16:59:09] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:59:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2024-06-07 16:59:10] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 16:59:10] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-06-07 16:59:10] [INFO ] After 839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 20000 reset in 1653 ms.
Product exploration explored 100000 steps with 20000 reset in 1660 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 76 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:59:15] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 16:59:15] [INFO ] Computed 57 invariants in 12 ms
[2024-06-07 16:59:15] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin1744751243760374524
[2024-06-07 16:59:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1744751243760374524
Running compilation step : cd /tmp/ltsmin1744751243760374524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1744751243760374524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1744751243760374524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 16:59:18] [INFO ] Invariant cache hit.
[2024-06-07 16:59:19] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-07 16:59:19] [INFO ] Invariant cache hit.
[2024-06-07 16:59:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:59:20] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
[2024-06-07 16:59:20] [INFO ] Invariant cache hit.
[2024-06-07 16:59:20] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2139 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin2427142703684737522
[2024-06-07 16:59:20] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2427142703684737522
Running compilation step : cd /tmp/ltsmin2427142703684737522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2427142703684737522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2427142703684737522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 16:59:24] [INFO ] Flatten gal took : 54 ms
[2024-06-07 16:59:24] [INFO ] Flatten gal took : 55 ms
[2024-06-07 16:59:24] [INFO ] Time to serialize gal into /tmp/LTL16429602528273558338.gal : 9 ms
[2024-06-07 16:59:24] [INFO ] Time to serialize properties into /tmp/LTL467871157554867015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16429602528273558338.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17249128628565039623.hoa' '-atoms' '/tmp/LTL467871157554867015.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL467871157554867015.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17249128628565039623.hoa
Detected timeout of ITS tools.
[2024-06-07 16:59:39] [INFO ] Flatten gal took : 51 ms
[2024-06-07 16:59:39] [INFO ] Flatten gal took : 52 ms
[2024-06-07 16:59:39] [INFO ] Time to serialize gal into /tmp/LTL831851328402560910.gal : 11 ms
[2024-06-07 16:59:39] [INFO ] Time to serialize properties into /tmp/LTL14340199046323393442.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL831851328402560910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14340199046323393442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(!("((((((pred_on_756<1)||(pred_on_281<1))||((pred_on_478<1)||(pred_on_255<1)))||(((pred_on_732<1)||(pred_on_537<1))||((pre...502
Formula 0 simplified : XXX(G"((((((pred_on_756<1)||(pred_on_281<1))||((pred_on_478<1)||(pred_on_255<1)))||(((pred_on_732<1)||(pred_on_537<1))||((pred_on_68...487
Detected timeout of ITS tools.
[2024-06-07 16:59:54] [INFO ] Flatten gal took : 50 ms
[2024-06-07 16:59:54] [INFO ] Applying decomposition
[2024-06-07 16:59:54] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8592320573139419920.txt' '-o' '/tmp/graph8592320573139419920.bin' '-w' '/tmp/graph8592320573139419920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8592320573139419920.bin' '-l' '-1' '-v' '-w' '/tmp/graph8592320573139419920.weights' '-q' '0' '-e' '0.001'
[2024-06-07 16:59:54] [INFO ] Decomposing Gal with order
[2024-06-07 16:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 16:59:54] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 16:59:54] [INFO ] Flatten gal took : 146 ms
[2024-06-07 16:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 26 ms.
[2024-06-07 16:59:54] [INFO ] Time to serialize gal into /tmp/LTL9689427419621625845.gal : 13 ms
[2024-06-07 16:59:54] [INFO ] Time to serialize properties into /tmp/LTL18177242454584413154.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9689427419621625845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18177242454584413154.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(!("((((((u27.pred_on_756<1)||(u1.pred_on_281<1))||((u2.pred_on_478<1)||(i22.u9.pred_on_255<1)))||(((u26.pred_on_732<1)||(u...608
Formula 0 simplified : XXX(G"((((((u27.pred_on_756<1)||(u1.pred_on_281<1))||((u2.pred_on_478<1)||(i22.u9.pred_on_255<1)))||(((u26.pred_on_732<1)||(u19.pred...593
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4480392817721716389
[2024-06-07 17:00:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4480392817721716389
Running compilation step : cd /tmp/ltsmin4480392817721716389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4480392817721716389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4480392817721716389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BlocksWorld-PT-05-LTLFireability-15 finished in 104482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((p0&&G(p1)))||(p1&&G(p0)))))))'
Found a Shortening insensitive property : BlocksWorld-PT-05-LTLFireability-13
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 25 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 17:00:13] [INFO ] Invariant cache hit.
[2024-06-07 17:00:13] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-07 17:00:13] [INFO ] Invariant cache hit.
[2024-06-07 17:00:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:15] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2024-06-07 17:00:15] [INFO ] Invariant cache hit.
[2024-06-07 17:00:15] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2097 ms. Remains : 841/841 places, 1569/1569 transitions.
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s15 1) (LT s34 1)), p0:(OR (LT s2 1) (LT s49 1) (LT s530 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1574 ms.
Product exploration explored 100000 steps with 0 reset in 1677 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 17:00:19] [INFO ] Invariant cache hit.
[2024-06-07 17:00:19] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-06-07 17:00:19] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 17:00:20] [INFO ] Invariant cache hit.
[2024-06-07 17:00:20] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-07 17:00:20] [INFO ] Invariant cache hit.
[2024-06-07 17:00:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:22] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2024-06-07 17:00:22] [INFO ] Invariant cache hit.
[2024-06-07 17:00:22] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2325 ms. Remains : 841/841 places, 1569/1569 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 4930 steps, including 1 resets, run visited all 6 properties in 133 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 371 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1636 ms.
Product exploration explored 100000 steps with 0 reset in 1667 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 79 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 17:00:28] [INFO ] Redundant transitions in 24 ms returned []
[2024-06-07 17:00:28] [INFO ] Invariant cache hit.
[2024-06-07 17:00:29] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin18091955257211675166
[2024-06-07 17:00:29] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18091955257211675166
Running compilation step : cd /tmp/ltsmin18091955257211675166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18091955257211675166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18091955257211675166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 22 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 17:00:32] [INFO ] Invariant cache hit.
[2024-06-07 17:00:32] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-07 17:00:32] [INFO ] Invariant cache hit.
[2024-06-07 17:00:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:33] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2024-06-07 17:00:33] [INFO ] Invariant cache hit.
[2024-06-07 17:00:34] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2270 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin14343259145259215667
[2024-06-07 17:00:34] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14343259145259215667
Running compilation step : cd /tmp/ltsmin14343259145259215667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14343259145259215667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14343259145259215667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 17:00:37] [INFO ] Flatten gal took : 51 ms
[2024-06-07 17:00:37] [INFO ] Flatten gal took : 52 ms
[2024-06-07 17:00:37] [INFO ] Time to serialize gal into /tmp/LTL16461617087276237507.gal : 10 ms
[2024-06-07 17:00:37] [INFO ] Time to serialize properties into /tmp/LTL6953166534287404417.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16461617087276237507.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18348229314115651510.hoa' '-atoms' '/tmp/LTL6953166534287404417.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6953166534287404417.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18348229314115651510.hoa
Detected timeout of ITS tools.
[2024-06-07 17:00:52] [INFO ] Flatten gal took : 49 ms
[2024-06-07 17:00:53] [INFO ] Flatten gal took : 53 ms
[2024-06-07 17:00:53] [INFO ] Time to serialize gal into /tmp/LTL16523864813896761744.gal : 9 ms
[2024-06-07 17:00:53] [INFO ] Time to serialize properties into /tmp/LTL14470964267464522059.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16523864813896761744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14470964267464522059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))")&&(G("((pred_holding_4<1)||(pred_clear_11<1))"))))||((G("(...268
Formula 0 simplified : XXG(X(!"(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))" | F!"((pred_holding_4<1)||(pred_clear_11<1))") & (!"((pred_hol...254
Detected timeout of ITS tools.
[2024-06-07 17:01:08] [INFO ] Flatten gal took : 51 ms
[2024-06-07 17:01:08] [INFO ] Applying decomposition
[2024-06-07 17:01:08] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3815169267891948553.txt' '-o' '/tmp/graph3815169267891948553.bin' '-w' '/tmp/graph3815169267891948553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3815169267891948553.bin' '-l' '-1' '-v' '-w' '/tmp/graph3815169267891948553.weights' '-q' '0' '-e' '0.001'
[2024-06-07 17:01:08] [INFO ] Decomposing Gal with order
[2024-06-07 17:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 17:01:08] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 17:01:08] [INFO ] Flatten gal took : 129 ms
[2024-06-07 17:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-06-07 17:01:08] [INFO ] Time to serialize gal into /tmp/LTL2787546703418297090.gal : 15 ms
[2024-06-07 17:01:08] [INFO ] Time to serialize properties into /tmp/LTL6680270639032729342.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2787546703418297090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6680270639032729342.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((i20.u21.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))")&&(G("((u4.pred_holding_4<1)||(u11.pred_cl...314
Formula 0 simplified : XXG(X(!"(((i20.u21.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))" | F!"((u4.pred_holding_4<1)||(u11.pred_clear_1...300
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18137747584944581806
[2024-06-07 17:01:23] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18137747584944581806
Running compilation step : cd /tmp/ltsmin18137747584944581806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18137747584944581806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18137747584944581806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BlocksWorld-PT-05-LTLFireability-13 finished in 73587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(!p0) U X(p1))))))'
[2024-06-07 17:01:26] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6484752447332190999
[2024-06-07 17:01:26] [INFO ] Too many transitions (1569) to apply POR reductions. Disabling POR matrices.
[2024-06-07 17:01:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6484752447332190999
Running compilation step : cd /tmp/ltsmin6484752447332190999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 17:01:26] [INFO ] Applying decomposition
[2024-06-07 17:01:26] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11417043260320995959.txt' '-o' '/tmp/graph11417043260320995959.bin' '-w' '/tmp/graph11417043260320995959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11417043260320995959.bin' '-l' '-1' '-v' '-w' '/tmp/graph11417043260320995959.weights' '-q' '0' '-e' '0.001'
[2024-06-07 17:01:27] [INFO ] Decomposing Gal with order
[2024-06-07 17:01:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 17:01:27] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 17:01:27] [INFO ] Flatten gal took : 142 ms
[2024-06-07 17:01:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 20 ms.
[2024-06-07 17:01:27] [INFO ] Time to serialize gal into /tmp/LTLFireability14324807934896148917.gal : 14 ms
[2024-06-07 17:01:27] [INFO ] Time to serialize properties into /tmp/LTLFireability6248605593479409181.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14324807934896148917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6248605593479409181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(F((X(("(((i2.u2.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u16.pred_on_380<1))")&&(G("((u4.pred_holding_4<1)||(i2.u11.pred_c...316
Formula 0 simplified : XXG(X(!"(((i2.u2.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u16.pred_on_380<1))" | F!"((u4.pred_holding_4<1)||(i2.u11.pred_clear_...302
Compilation finished in 3264 ms.
Running link step : cd /tmp/ltsmin6484752447332190999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6484752447332190999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((X(((LTLAPp0==true)&&[]((LTLAPp1==true))))||((LTLAPp1==true)&&[]((LTLAPp0==true)))))))' '--buchi-type=spotba'
LTSmin run took 119050 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6484752447332190999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>(!(LTLAPp2==true)) U X((LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 584 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 723650 ms.

BK_STOP 1717779811003

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BlocksWorld-PT-05, 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 r623-tall-171774435500123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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