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-171774435600142.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-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r623-tall-171774435600142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 534K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 500K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.3M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.4M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 41K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 97K 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 2.3M 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-09-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717783738715

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-07 18:09:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 18:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 18:09:00] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-06-07 18:09:00] [INFO ] Transformed 2449 places.
[2024-06-07 18:09:00] [INFO ] Transformed 4705 transitions.
[2024-06-07 18:09:00] [INFO ] Found NUPN structural information;
[2024-06-07 18:09:00] [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, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47]
[2024-06-07 18:09:00] [INFO ] Parsed PT model containing 2449 places and 4705 transitions and 23506 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 145 out of 2449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2449/2449 places, 4705/4705 transitions.
Applied a total of 0 rules in 252 ms. Remains 2449 /2449 variables (removed 0) and now considering 4705/4705 (removed 0) transitions.
// Phase 1: matrix 4705 rows 2449 cols
[2024-06-07 18:09:01] [INFO ] Computed 97 invariants in 87 ms
[2024-06-07 18:09:02] [INFO ] Implicit Places using invariants in 1655 ms returned []
[2024-06-07 18:09:02] [INFO ] Invariant cache hit.
[2024-06-07 18:09:03] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-07 18:09:08] [INFO ] Implicit Places using invariants and state equation in 5603 ms returned []
Implicit Place search using SMT with State Equation took 7286 ms to find 0 implicit places.
[2024-06-07 18:09:08] [INFO ] Invariant cache hit.
[2024-06-07 18:09:10] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 96 transitions.
Found 96 dead transitions using SMT.
Drop transitions removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in LTL mode, iteration 1 : 2449/2449 places, 4609/4705 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 2401 transition count 4609
Applied a total of 48 rules in 116 ms. Remains 2401 /2449 variables (removed 48) and now considering 4609/4609 (removed 0) transitions.
// Phase 1: matrix 4609 rows 2401 cols
[2024-06-07 18:09:11] [INFO ] Computed 97 invariants in 38 ms
[2024-06-07 18:09:12] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2024-06-07 18:09:12] [INFO ] Invariant cache hit.
[2024-06-07 18:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:09:16] [INFO ] Implicit Places using invariants and state equation in 4371 ms returned []
Implicit Place search using SMT with State Equation took 5672 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2401/2449 places, 4609/4705 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15672 ms. Remains : 2401/2449 places, 4609/4705 transitions.
Support contains 145 out of 2401 places after structural reductions.
[2024-06-07 18:09:17] [INFO ] Flatten gal took : 359 ms
[2024-06-07 18:09:17] [INFO ] Flatten gal took : 249 ms
[2024-06-07 18:09:18] [INFO ] Input system was already deterministic with 4609 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1046 ms. (steps per millisecond=9 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-07 18:09:20] [INFO ] Invariant cache hit.
[2024-06-07 18:09:21] [INFO ] [Real]Absence check using 97 positive place invariants in 60 ms returned sat
[2024-06-07 18:09:21] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:2
[2024-06-07 18:09:21] [INFO ] [Nat]Absence check using 97 positive place invariants in 52 ms returned sat
[2024-06-07 18:09:23] [INFO ] After 2004ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2024-06-07 18:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:09:24] [INFO ] After 224ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :2
[2024-06-07 18:09:26] [INFO ] Deduced a trap composed of 141 places in 2325 ms of which 11 ms to minimize.
[2024-06-07 18:09:29] [INFO ] Deduced a trap composed of 264 places in 2540 ms of which 3 ms to minimize.
[2024-06-07 18:09:31] [INFO ] Deduced a trap composed of 141 places in 2296 ms of which 2 ms to minimize.
[2024-06-07 18:09:34] [INFO ] Deduced a trap composed of 141 places in 2347 ms of which 5 ms to minimize.
[2024-06-07 18:09:36] [INFO ] Deduced a trap composed of 141 places in 2359 ms of which 3 ms to minimize.
[2024-06-07 18:09:39] [INFO ] Deduced a trap composed of 264 places in 2383 ms of which 3 ms to minimize.
[2024-06-07 18:09:41] [INFO ] Deduced a trap composed of 141 places in 2296 ms of which 2 ms to minimize.
[2024-06-07 18:09:43] [INFO ] Deduced a trap composed of 225 places in 2284 ms of which 3 ms to minimize.
[2024-06-07 18:09:46] [INFO ] Deduced a trap composed of 96 places in 2345 ms of which 2 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 18:09:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 18:09:46] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0 real:2
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 96 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4609/4609 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 2401 transition count 4608
Applied a total of 1 rules in 12765 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4609 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12767 ms. Remains : 2401/2401 places, 4608/4609 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 167887 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167887 steps, saw 135342 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4608 rows 2401 cols
[2024-06-07 18:10:03] [INFO ] Computed 97 invariants in 29 ms
[2024-06-07 18:10:03] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 18:10:03] [INFO ] [Nat]Absence check using 97 positive place invariants in 59 ms returned sat
[2024-06-07 18:10:05] [INFO ] After 1711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 18:10:07] [INFO ] Deduced a trap composed of 504 places in 2257 ms of which 3 ms to minimize.
[2024-06-07 18:10:10] [INFO ] Deduced a trap composed of 301 places in 2272 ms of which 3 ms to minimize.
[2024-06-07 18:10:12] [INFO ] Deduced a trap composed of 141 places in 2283 ms of which 2 ms to minimize.
[2024-06-07 18:10:15] [INFO ] Deduced a trap composed of 184 places in 2245 ms of which 3 ms to minimize.
[2024-06-07 18:10:17] [INFO ] Deduced a trap composed of 141 places in 2110 ms of which 2 ms to minimize.
[2024-06-07 18:10:19] [INFO ] Deduced a trap composed of 141 places in 2178 ms of which 2 ms to minimize.
[2024-06-07 18:10:22] [INFO ] Deduced a trap composed of 141 places in 2282 ms of which 3 ms to minimize.
[2024-06-07 18:10:24] [INFO ] Deduced a trap composed of 141 places in 2181 ms of which 2 ms to minimize.
[2024-06-07 18:10:26] [INFO ] Deduced a trap composed of 264 places in 2232 ms of which 3 ms to minimize.
[2024-06-07 18:10:29] [INFO ] Deduced a trap composed of 141 places in 2227 ms of which 2 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 18:10:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 18:10:29] [INFO ] After 25679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 96 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 9123 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9123 ms. Remains : 2401/2401 places, 4608/4608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 9105 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
[2024-06-07 18:10:47] [INFO ] Invariant cache hit.
[2024-06-07 18:10:48] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2024-06-07 18:10:48] [INFO ] Invariant cache hit.
[2024-06-07 18:10:52] [INFO ] Implicit Places using invariants and state equation in 3905 ms returned []
Implicit Place search using SMT with State Equation took 5370 ms to find 0 implicit places.
[2024-06-07 18:10:53] [INFO ] Redundant transitions in 321 ms returned []
[2024-06-07 18:10:53] [INFO ] Invariant cache hit.
[2024-06-07 18:10:55] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17131 ms. Remains : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 9286 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-07 18:11:04] [INFO ] Invariant cache hit.
[2024-06-07 18:11:04] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 18:11:05] [INFO ] [Nat]Absence check using 97 positive place invariants in 58 ms returned sat
[2024-06-07 18:11:07] [INFO ] After 1992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 18:11:09] [INFO ] Deduced a trap composed of 141 places in 2227 ms of which 2 ms to minimize.
[2024-06-07 18:11:12] [INFO ] Deduced a trap composed of 336 places in 2170 ms of which 3 ms to minimize.
[2024-06-07 18:11:14] [INFO ] Deduced a trap composed of 141 places in 2155 ms of which 3 ms to minimize.
[2024-06-07 18:11:16] [INFO ] Deduced a trap composed of 141 places in 2227 ms of which 3 ms to minimize.
[2024-06-07 18:11:18] [INFO ] Deduced a trap composed of 96 places in 2223 ms of which 2 ms to minimize.
[2024-06-07 18:11:21] [INFO ] Deduced a trap composed of 456 places in 2230 ms of which 3 ms to minimize.
[2024-06-07 18:11:23] [INFO ] Deduced a trap composed of 600 places in 2215 ms of which 3 ms to minimize.
[2024-06-07 18:11:25] [INFO ] Deduced a trap composed of 96 places in 2112 ms of which 2 ms to minimize.
[2024-06-07 18:11:28] [INFO ] Deduced a trap composed of 369 places in 2364 ms of which 3 ms to minimize.
[2024-06-07 18:11:30] [INFO ] Deduced a trap composed of 141 places in 2334 ms of which 3 ms to minimize.
[2024-06-07 18:11:33] [INFO ] Deduced a trap composed of 369 places in 2292 ms of which 2 ms to minimize.
[2024-06-07 18:11:35] [INFO ] Deduced a trap composed of 609 places in 2320 ms of which 3 ms to minimize.
[2024-06-07 18:11:38] [INFO ] Deduced a trap composed of 141 places in 2308 ms of which 3 ms to minimize.
[2024-06-07 18:11:40] [INFO ] Deduced a trap composed of 264 places in 2310 ms of which 5 ms to minimize.
[2024-06-07 18:11:42] [INFO ] Deduced a trap composed of 625 places in 2150 ms of which 3 ms to minimize.
[2024-06-07 18:11:45] [INFO ] Deduced a trap composed of 141 places in 2233 ms of which 7 ms to minimize.
[2024-06-07 18:11:47] [INFO ] Deduced a trap composed of 141 places in 2132 ms of which 2 ms to minimize.
[2024-06-07 18:11:49] [INFO ] Deduced a trap composed of 141 places in 2221 ms of which 3 ms to minimize.
[2024-06-07 18:11:52] [INFO ] Deduced a trap composed of 141 places in 2271 ms of which 3 ms to minimize.
[2024-06-07 18:11:54] [INFO ] Deduced a trap composed of 141 places in 2228 ms of which 3 ms to minimize.
[2024-06-07 18:11:56] [INFO ] Deduced a trap composed of 141 places in 2208 ms of which 3 ms to minimize.
[2024-06-07 18:11:59] [INFO ] Deduced a trap composed of 456 places in 2189 ms of which 2 ms to minimize.
[2024-06-07 18:12:01] [INFO ] Deduced a trap composed of 141 places in 2251 ms of which 3 ms to minimize.
[2024-06-07 18:12:03] [INFO ] Deduced a trap composed of 96 places in 2187 ms of which 2 ms to minimize.
[2024-06-07 18:12:06] [INFO ] Deduced a trap composed of 481 places in 2251 ms of which 2 ms to minimize.
[2024-06-07 18:12:08] [INFO ] Deduced a trap composed of 141 places in 2284 ms of which 2 ms to minimize.
[2024-06-07 18:12:11] [INFO ] Deduced a trap composed of 141 places in 2197 ms of which 2 ms to minimize.
[2024-06-07 18:12:13] [INFO ] Deduced a trap composed of 141 places in 2196 ms of which 3 ms to minimize.
[2024-06-07 18:12:15] [INFO ] Deduced a trap composed of 616 places in 2214 ms of which 2 ms to minimize.
[2024-06-07 18:12:18] [INFO ] Deduced a trap composed of 141 places in 2280 ms of which 3 ms to minimize.
[2024-06-07 18:12:20] [INFO ] Deduced a trap composed of 141 places in 2301 ms of which 3 ms to minimize.
[2024-06-07 18:12:23] [INFO ] Deduced a trap composed of 141 places in 2220 ms of which 4 ms to minimize.
[2024-06-07 18:12:25] [INFO ] Deduced a trap composed of 141 places in 2323 ms of which 2 ms to minimize.
[2024-06-07 18:12:28] [INFO ] Deduced a trap composed of 225 places in 2273 ms of which 3 ms to minimize.
[2024-06-07 18:12:30] [INFO ] Deduced a trap composed of 141 places in 2240 ms of which 2 ms to minimize.
[2024-06-07 18:12:32] [INFO ] Deduced a trap composed of 141 places in 2249 ms of which 2 ms to minimize.
[2024-06-07 18:12:35] [INFO ] Deduced a trap composed of 400 places in 2262 ms of which 2 ms to minimize.
[2024-06-07 18:12:37] [INFO ] Deduced a trap composed of 481 places in 2277 ms of which 4 ms to minimize.
[2024-06-07 18:12:39] [INFO ] Deduced a trap composed of 141 places in 2211 ms of which 3 ms to minimize.
[2024-06-07 18:12:42] [INFO ] Deduced a trap composed of 141 places in 2219 ms of which 2 ms to minimize.
[2024-06-07 18:12:44] [INFO ] Deduced a trap composed of 96 places in 2300 ms of which 2 ms to minimize.
[2024-06-07 18:12:47] [INFO ] Deduced a trap composed of 141 places in 2225 ms of which 3 ms to minimize.
[2024-06-07 18:12:49] [INFO ] Deduced a trap composed of 141 places in 2335 ms of which 3 ms to minimize.
[2024-06-07 18:12:52] [INFO ] Deduced a trap composed of 225 places in 2267 ms of which 2 ms to minimize.
[2024-06-07 18:12:54] [INFO ] Deduced a trap composed of 141 places in 2197 ms of which 3 ms to minimize.
[2024-06-07 18:12:57] [INFO ] Deduced a trap composed of 184 places in 2300 ms of which 4 ms to minimize.
[2024-06-07 18:12:59] [INFO ] Deduced a trap composed of 141 places in 2235 ms of which 3 ms to minimize.
[2024-06-07 18:13:01] [INFO ] Deduced a trap composed of 369 places in 2231 ms of which 6 ms to minimize.
[2024-06-07 18:13:04] [INFO ] Deduced a trap composed of 225 places in 2258 ms of which 2 ms to minimize.
[2024-06-07 18:13:06] [INFO ] Deduced a trap composed of 141 places in 2166 ms of which 2 ms to minimize.
[2024-06-07 18:13:08] [INFO ] Deduced a trap composed of 141 places in 2248 ms of which 3 ms to minimize.
[2024-06-07 18:13:11] [INFO ] Deduced a trap composed of 141 places in 2278 ms of which 3 ms to minimize.
[2024-06-07 18:13:13] [INFO ] Deduced a trap composed of 141 places in 2242 ms of which 3 ms to minimize.
[2024-06-07 18:13:15] [INFO ] Deduced a trap composed of 141 places in 2179 ms of which 3 ms to minimize.
[2024-06-07 18:13:18] [INFO ] Deduced a trap composed of 264 places in 2213 ms of which 3 ms to minimize.
[2024-06-07 18:13:20] [INFO ] Deduced a trap composed of 141 places in 2304 ms of which 3 ms to minimize.
[2024-06-07 18:13:23] [INFO ] Deduced a trap composed of 225 places in 2317 ms of which 2 ms to minimize.
[2024-06-07 18:13:25] [INFO ] Deduced a trap composed of 336 places in 2347 ms of which 3 ms to minimize.
[2024-06-07 18:13:28] [INFO ] Deduced a trap composed of 141 places in 2365 ms of which 3 ms to minimize.
[2024-06-07 18:13:30] [INFO ] Deduced a trap composed of 141 places in 2345 ms of which 3 ms to minimize.
[2024-06-07 18:13:33] [INFO ] Deduced a trap composed of 141 places in 2260 ms of which 2 ms to minimize.
[2024-06-07 18:13:35] [INFO ] Deduced a trap composed of 141 places in 2267 ms of which 2 ms to minimize.
[2024-06-07 18:13:37] [INFO ] Deduced a trap composed of 141 places in 2352 ms of which 3 ms to minimize.
[2024-06-07 18:13:40] [INFO ] Deduced a trap composed of 141 places in 2299 ms of which 3 ms to minimize.
[2024-06-07 18:13:42] [INFO ] Deduced a trap composed of 141 places in 2212 ms of which 3 ms to minimize.
[2024-06-07 18:13:45] [INFO ] Deduced a trap composed of 336 places in 2207 ms of which 2 ms to minimize.
[2024-06-07 18:13:47] [INFO ] Deduced a trap composed of 141 places in 2242 ms of which 3 ms to minimize.
[2024-06-07 18:13:49] [INFO ] Deduced a trap composed of 141 places in 2233 ms of which 2 ms to minimize.
[2024-06-07 18:13:52] [INFO ] Deduced a trap composed of 141 places in 2331 ms of which 3 ms to minimize.
[2024-06-07 18:13:54] [INFO ] Deduced a trap composed of 141 places in 2157 ms of which 3 ms to minimize.
[2024-06-07 18:13:57] [INFO ] Deduced a trap composed of 225 places in 2291 ms of which 2 ms to minimize.
[2024-06-07 18:13:59] [INFO ] Deduced a trap composed of 141 places in 2250 ms of which 3 ms to minimize.
[2024-06-07 18:14:01] [INFO ] Deduced a trap composed of 141 places in 2251 ms of which 2 ms to minimize.
[2024-06-07 18:14:04] [INFO ] Deduced a trap composed of 141 places in 2286 ms of which 3 ms to minimize.
[2024-06-07 18:14:06] [INFO ] Deduced a trap composed of 141 places in 2296 ms of which 3 ms to minimize.
[2024-06-07 18:14:09] [INFO ] Deduced a trap composed of 481 places in 2261 ms of which 2 ms to minimize.
[2024-06-07 18:14:11] [INFO ] Deduced a trap composed of 184 places in 2262 ms of which 2 ms to minimize.
[2024-06-07 18:14:13] [INFO ] Deduced a trap composed of 141 places in 2281 ms of which 2 ms to minimize.
[2024-06-07 18:14:16] [INFO ] Deduced a trap composed of 141 places in 2228 ms of which 2 ms to minimize.
[2024-06-07 18:14:18] [INFO ] Deduced a trap composed of 264 places in 2271 ms of which 3 ms to minimize.
[2024-06-07 18:14:21] [INFO ] Deduced a trap composed of 301 places in 2289 ms of which 2 ms to minimize.
[2024-06-07 18:14:23] [INFO ] Deduced a trap composed of 141 places in 2284 ms of which 3 ms to minimize.
[2024-06-07 18:14:25] [INFO ] Deduced a trap composed of 301 places in 2315 ms of which 3 ms to minimize.
[2024-06-07 18:14:28] [INFO ] Deduced a trap composed of 141 places in 2343 ms of which 3 ms to minimize.
[2024-06-07 18:14:30] [INFO ] Deduced a trap composed of 184 places in 2338 ms of which 2 ms to minimize.
[2024-06-07 18:14:33] [INFO ] Deduced a trap composed of 141 places in 2362 ms of which 2 ms to minimize.
[2024-06-07 18:14:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 86 trap constraints in 205930 ms
[2024-06-07 18:14:36] [INFO ] Deduced a trap composed of 184 places in 2324 ms of which 3 ms to minimize.
[2024-06-07 18:14:39] [INFO ] Deduced a trap composed of 96 places in 2240 ms of which 2 ms to minimize.
[2024-06-07 18:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 4880 ms
[2024-06-07 18:14:39] [INFO ] After 214055ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-06-07 18:14:39] [INFO ] After 214495ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA BlocksWorld-PT-09-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA BlocksWorld-PT-09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-09-LTLCardinality-10 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(p0)))'
Support contains 96 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 98 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
// Phase 1: matrix 4609 rows 2401 cols
[2024-06-07 18:14:39] [INFO ] Computed 97 invariants in 24 ms
[2024-06-07 18:14:41] [INFO ] Implicit Places using invariants in 1606 ms returned []
[2024-06-07 18:14:41] [INFO ] Invariant cache hit.
[2024-06-07 18:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:14:44] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 4398 ms to find 0 implicit places.
[2024-06-07 18:14:44] [INFO ] Invariant cache hit.
[2024-06-07 18:14:46] [INFO ] Dead Transitions using invariants and state equation in 2220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6722 ms. Remains : 2401/2401 places, 4609/4609 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 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s1 s5 s8 s11 s14 s17 s20 s23 s26 s29 s32 s35 s38 s41 s44 s47 s50 s53 s56 s59 s62 s65 s68 s71 s74 s77 s80 s83 s86 s89 s92 s95 s98 s101 s104 s10...], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1970 ms.
Product exploration explored 100000 steps with 50000 reset in 1884 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 27 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-09-LTLCardinality-01 finished in 10890 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 U X((F(!p0)&&(p1||(!p2 U p0))))))'
Support contains 97 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 93 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:14:50] [INFO ] Invariant cache hit.
[2024-06-07 18:14:51] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-06-07 18:14:51] [INFO ] Invariant cache hit.
[2024-06-07 18:14:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:14:54] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2024-06-07 18:14:54] [INFO ] Invariant cache hit.
[2024-06-07 18:14:56] [INFO ] Dead Transitions using invariants and state equation in 2223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5934 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=3, aps=[p0:(LEQ 1 s2), p2:(GT 3 (ADD s0 s4 s7 s10 s13 s16 s19 s22 s25 s28 s31 s34 s37 s40 s43 s46 s49 s52 s55 s58 s61 s64 s67 s70 s73 s76 s79 s82 s85 s88 s91 s94 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2099 ms.
Product exploration explored 100000 steps with 50000 reset in 2124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-09-LTLCardinality-02 finished in 10477 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' '!((F(G(p0))||G((p1&&X(p2)))))'
Support contains 97 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 94 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:15:01] [INFO ] Invariant cache hit.
[2024-06-07 18:15:02] [INFO ] Implicit Places using invariants in 1468 ms returned []
[2024-06-07 18:15:02] [INFO ] Invariant cache hit.
[2024-06-07 18:15:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:15:05] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 4099 ms to find 0 implicit places.
[2024-06-07 18:15:05] [INFO ] Invariant cache hit.
[2024-06-07 18:15:07] [INFO ] Dead Transitions using invariants and state equation in 2212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6406 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s1 s5 s8 s11 s14 s17 s20 s23 s26 s29 s32 s35 s38 s41 s44 s47 s50 s53 s56 s59 s62 s65 s68 s71 s74 s77 s80 s83 s86 s89 s92 s95 s98 s101 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 4205 ms.
Product exploration explored 100000 steps with 0 reset in 4257 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 (NOT p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p0), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 305389 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305389 steps, saw 255750 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 18:15:19] [INFO ] Invariant cache hit.
[2024-06-07 18:15:20] [INFO ] [Real]Absence check using 97 positive place invariants in 54 ms returned sat
[2024-06-07 18:15:20] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:15:20] [INFO ] [Nat]Absence check using 97 positive place invariants in 53 ms returned sat
[2024-06-07 18:15:22] [INFO ] After 1686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:15:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:15:22] [INFO ] After 145ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 18:15:23] [INFO ] Deduced a trap composed of 336 places in 1244 ms of which 1 ms to minimize.
[2024-06-07 18:15:25] [INFO ] Deduced a trap composed of 184 places in 1205 ms of which 2 ms to minimize.
[2024-06-07 18:15:26] [INFO ] Deduced a trap composed of 621 places in 1230 ms of which 2 ms to minimize.
[2024-06-07 18:15:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4142 ms
[2024-06-07 18:15:26] [INFO ] After 4393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-06-07 18:15:26] [INFO ] After 6567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4609/4609 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 2401 transition count 4608
Applied a total of 1 rules in 17912 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4609 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17912 ms. Remains : 2401/2401 places, 4608/4609 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 299889 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 299889 steps, saw 250685 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4608 rows 2401 cols
[2024-06-07 18:15:48] [INFO ] Computed 97 invariants in 26 ms
[2024-06-07 18:15:48] [INFO ] [Real]Absence check using 97 positive place invariants in 54 ms returned sat
[2024-06-07 18:15:48] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:15:48] [INFO ] [Nat]Absence check using 97 positive place invariants in 55 ms returned sat
[2024-06-07 18:15:50] [INFO ] After 1831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:15:51] [INFO ] Deduced a trap composed of 561 places in 875 ms of which 1 ms to minimize.
[2024-06-07 18:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1122 ms
[2024-06-07 18:15:51] [INFO ] After 3071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-06-07 18:15:52] [INFO ] After 3550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 13617 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13620 ms. Remains : 2401/2401 places, 4608/4608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 13631 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
[2024-06-07 18:16:19] [INFO ] Invariant cache hit.
[2024-06-07 18:16:21] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2024-06-07 18:16:21] [INFO ] Invariant cache hit.
[2024-06-07 18:16:23] [INFO ] Implicit Places using invariants and state equation in 2529 ms returned []
Implicit Place search using SMT with State Equation took 4228 ms to find 0 implicit places.
[2024-06-07 18:16:23] [INFO ] Redundant transitions in 281 ms returned []
[2024-06-07 18:16:23] [INFO ] Invariant cache hit.
[2024-06-07 18:16:26] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20429 ms. Remains : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 13590 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 18:16:39] [INFO ] Invariant cache hit.
[2024-06-07 18:16:40] [INFO ] [Real]Absence check using 97 positive place invariants in 53 ms returned sat
[2024-06-07 18:16:40] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:16:40] [INFO ] [Nat]Absence check using 97 positive place invariants in 51 ms returned sat
[2024-06-07 18:16:42] [INFO ] After 1765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:16:42] [INFO ] Deduced a trap composed of 184 places in 496 ms of which 1 ms to minimize.
[2024-06-07 18:16:43] [INFO ] Deduced a trap composed of 301 places in 283 ms of which 1 ms to minimize.
[2024-06-07 18:16:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1128 ms
[2024-06-07 18:16:43] [INFO ] After 3009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2024-06-07 18:16:43] [INFO ] After 3485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p0), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 48 out of 2401 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 763 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
// Phase 1: matrix 4609 rows 2401 cols
[2024-06-07 18:16:44] [INFO ] Computed 97 invariants in 24 ms
[2024-06-07 18:16:46] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2024-06-07 18:16:46] [INFO ] Invariant cache hit.
[2024-06-07 18:16:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:16:48] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 4103 ms to find 0 implicit places.
[2024-06-07 18:16:48] [INFO ] Redundant transitions in 193 ms returned []
[2024-06-07 18:16:48] [INFO ] Invariant cache hit.
[2024-06-07 18:16:51] [INFO ] Dead Transitions using invariants and state equation in 2349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7420 ms. Remains : 2401/2401 places, 4609/4609 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 289276 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289276 steps, saw 240884 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 18:16:54] [INFO ] Invariant cache hit.
[2024-06-07 18:16:55] [INFO ] [Real]Absence check using 97 positive place invariants in 51 ms returned sat
[2024-06-07 18:16:55] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:16:55] [INFO ] [Nat]Absence check using 97 positive place invariants in 56 ms returned sat
[2024-06-07 18:16:57] [INFO ] After 1709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:16:57] [INFO ] After 144ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 18:16:58] [INFO ] Deduced a trap composed of 336 places in 1267 ms of which 2 ms to minimize.
[2024-06-07 18:17:00] [INFO ] Deduced a trap composed of 184 places in 1291 ms of which 2 ms to minimize.
[2024-06-07 18:17:01] [INFO ] Deduced a trap composed of 621 places in 1283 ms of which 2 ms to minimize.
[2024-06-07 18:17:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4350 ms
[2024-06-07 18:17:01] [INFO ] After 4595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-06-07 18:17:02] [INFO ] After 6805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4609/4609 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 2401 transition count 4608
Applied a total of 1 rules in 17845 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4609 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17846 ms. Remains : 2401/2401 places, 4608/4609 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292034 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292034 steps, saw 243438 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4608 rows 2401 cols
[2024-06-07 18:17:23] [INFO ] Computed 97 invariants in 26 ms
[2024-06-07 18:17:23] [INFO ] [Real]Absence check using 97 positive place invariants in 54 ms returned sat
[2024-06-07 18:17:23] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:17:24] [INFO ] [Nat]Absence check using 97 positive place invariants in 52 ms returned sat
[2024-06-07 18:17:26] [INFO ] After 1812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:17:27] [INFO ] Deduced a trap composed of 561 places in 874 ms of which 1 ms to minimize.
[2024-06-07 18:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1130 ms
[2024-06-07 18:17:27] [INFO ] After 3065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2024-06-07 18:17:27] [INFO ] After 3585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 13322 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13323 ms. Remains : 2401/2401 places, 4608/4608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 13282 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
[2024-06-07 18:17:54] [INFO ] Invariant cache hit.
[2024-06-07 18:17:55] [INFO ] Implicit Places using invariants in 1672 ms returned []
[2024-06-07 18:17:55] [INFO ] Invariant cache hit.
[2024-06-07 18:17:58] [INFO ] Implicit Places using invariants and state equation in 2517 ms returned []
Implicit Place search using SMT with State Equation took 4192 ms to find 0 implicit places.
[2024-06-07 18:17:58] [INFO ] Redundant transitions in 186 ms returned []
[2024-06-07 18:17:58] [INFO ] Invariant cache hit.
[2024-06-07 18:18:00] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19970 ms. Remains : 2401/2401 places, 4608/4608 transitions.
Applied a total of 0 rules in 13344 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4608 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 18:18:14] [INFO ] Invariant cache hit.
[2024-06-07 18:18:14] [INFO ] [Real]Absence check using 97 positive place invariants in 54 ms returned sat
[2024-06-07 18:18:14] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:18:14] [INFO ] [Nat]Absence check using 97 positive place invariants in 51 ms returned sat
[2024-06-07 18:18:16] [INFO ] After 1756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:18:17] [INFO ] Deduced a trap composed of 184 places in 513 ms of which 2 ms to minimize.
[2024-06-07 18:18:17] [INFO ] Deduced a trap composed of 301 places in 294 ms of which 0 ms to minimize.
[2024-06-07 18:18:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1169 ms
[2024-06-07 18:18:17] [INFO ] After 3027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-06-07 18:18:17] [INFO ] After 3490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 4394 ms.
Product exploration explored 100000 steps with 0 reset in 4384 ms.
Built C files in :
/tmp/ltsmin10850628171967135943
[2024-06-07 18:18:26] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:18:27] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10850628171967135943
Running compilation step : cd /tmp/ltsmin10850628171967135943;'/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/ltsmin10850628171967135943;'/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/ltsmin10850628171967135943;'/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 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 477 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
// Phase 1: matrix 4609 rows 2401 cols
[2024-06-07 18:18:30] [INFO ] Computed 97 invariants in 19 ms
[2024-06-07 18:18:32] [INFO ] Implicit Places using invariants in 1779 ms returned []
[2024-06-07 18:18:32] [INFO ] Invariant cache hit.
[2024-06-07 18:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:18:37] [INFO ] Implicit Places using invariants and state equation in 4949 ms returned []
Implicit Place search using SMT with State Equation took 6729 ms to find 0 implicit places.
[2024-06-07 18:18:37] [INFO ] Redundant transitions in 191 ms returned []
[2024-06-07 18:18:37] [INFO ] Invariant cache hit.
[2024-06-07 18:18:39] [INFO ] Dead Transitions using invariants and state equation in 2237 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9640 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Built C files in :
/tmp/ltsmin8584507212737922100
[2024-06-07 18:18:39] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:18:39] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8584507212737922100
Running compilation step : cd /tmp/ltsmin8584507212737922100;'/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/ltsmin8584507212737922100;'/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/ltsmin8584507212737922100;'/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 18:18:43] [INFO ] Flatten gal took : 178 ms
[2024-06-07 18:18:43] [INFO ] Flatten gal took : 167 ms
[2024-06-07 18:18:43] [INFO ] Time to serialize gal into /tmp/LTL2669250424330932737.gal : 40 ms
[2024-06-07 18:18:43] [INFO ] Time to serialize properties into /tmp/LTL11270371824155965856.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/LTL2669250424330932737.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9996705891781106450.hoa' '-atoms' '/tmp/LTL11270371824155965856.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/LTL11270371824155965856.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9996705891781106450.hoa
Detected timeout of ITS tools.
[2024-06-07 18:18:58] [INFO ] Flatten gal took : 192 ms
[2024-06-07 18:18:58] [INFO ] Flatten gal took : 162 ms
[2024-06-07 18:18:59] [INFO ] Time to serialize gal into /tmp/LTL16235867902809886324.gal : 37 ms
[2024-06-07 18:18:59] [INFO ] Time to serialize properties into /tmp/LTL13518523784892247386.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/LTL16235867902809886324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13518523784892247386.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 : !(((F(G("(((((((pred_on_table_0+pred_on_table_1)+(pred_on_table_2+pred_on_table_3))+((pred_on_table_4+pred_on_table_5)+(pred_on_table_...3583
Formula 0 simplified : GF!"(((((((pred_on_table_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+p...3571
Detected timeout of ITS tools.
[2024-06-07 18:19:14] [INFO ] Flatten gal took : 158 ms
[2024-06-07 18:19:14] [INFO ] Applying decomposition
[2024-06-07 18:19:14] [INFO ] Flatten gal took : 157 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/graph2433367611945031207.txt' '-o' '/tmp/graph2433367611945031207.bin' '-w' '/tmp/graph2433367611945031207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2433367611945031207.bin' '-l' '-1' '-v' '-w' '/tmp/graph2433367611945031207.weights' '-q' '0' '-e' '0.001'
[2024-06-07 18:19:14] [INFO ] Decomposing Gal with order
[2024-06-07 18:19:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 18:19:16] [INFO ] Removed a total of 7812 redundant transitions.
[2024-06-07 18:19:16] [INFO ] Flatten gal took : 1522 ms
[2024-06-07 18:19:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 5102 labels/synchronizations in 578 ms.
[2024-06-07 18:19:18] [INFO ] Time to serialize gal into /tmp/LTL17983644502902353232.gal : 63 ms
[2024-06-07 18:19:18] [INFO ] Time to serialize properties into /tmp/LTL353552441603728655.ltl : 18 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/LTL17983644502902353232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL353552441603728655.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 : !(((F(G("(((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_...4355
Formula 0 simplified : GF!"(((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_tab...4343
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin837004888613641546
[2024-06-07 18:19:33] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin837004888613641546
Running compilation step : cd /tmp/ltsmin837004888613641546;'/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/ltsmin837004888613641546;'/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/ltsmin837004888613641546;'/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-09-LTLCardinality-04 finished in 275322 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(p0)))'
Support contains 49 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 106 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:19:36] [INFO ] Invariant cache hit.
[2024-06-07 18:19:38] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2024-06-07 18:19:38] [INFO ] Invariant cache hit.
[2024-06-07 18:19:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:19:40] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
[2024-06-07 18:19:40] [INFO ] Invariant cache hit.
[2024-06-07 18:19:42] [INFO ] Dead Transitions using invariants and state equation in 2239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6403 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s2 (ADD s3 s6 s9 s12 s15 s18 s21 s24 s27 s30 s33 s36 s39 s42 s45 s48 s51 s54 s57 s60 s63 s66 s69 s72 s75 s78 s81 s84 s87 s90 s93 s96 s99 s102 s105 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-05 finished in 6517 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' '!(F(p0))'
Support contains 144 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 533 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:19:43] [INFO ] Invariant cache hit.
[2024-06-07 18:19:45] [INFO ] Implicit Places using invariants in 1668 ms returned []
[2024-06-07 18:19:45] [INFO ] Invariant cache hit.
[2024-06-07 18:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:19:50] [INFO ] Implicit Places using invariants and state equation in 5429 ms returned []
Implicit Place search using SMT with State Equation took 7099 ms to find 0 implicit places.
[2024-06-07 18:19:50] [INFO ] Redundant transitions in 193 ms returned []
[2024-06-07 18:19:50] [INFO ] Invariant cache hit.
[2024-06-07 18:19:53] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10026 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT (ADD s3 s6 s9 s12 s15 s18 s21 s24 s27 s30 s33 s36 s39 s42 s45 s48 s51 s54 s57 s60 s63 s66 s69 s72 s75 s78 s81 s84 s87 s90 s93 s96 s99 s102 s105...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 4437 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-06 finished in 14513 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||G(F(p0))))))'
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 468 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:19:57] [INFO ] Invariant cache hit.
[2024-06-07 18:19:59] [INFO ] Implicit Places using invariants in 1767 ms returned []
[2024-06-07 18:19:59] [INFO ] Invariant cache hit.
[2024-06-07 18:20:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:20:04] [INFO ] Implicit Places using invariants and state equation in 4833 ms returned []
Implicit Place search using SMT with State Equation took 6601 ms to find 0 implicit places.
[2024-06-07 18:20:04] [INFO ] Redundant transitions in 194 ms returned []
[2024-06-07 18:20:04] [INFO ] Invariant cache hit.
[2024-06-07 18:20:07] [INFO ] Dead Transitions using invariants and state equation in 2269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9547 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s1 s5 s8 s11 s14 s17 s20 s23 s26 s29 s32 s35 s38 s41 s44 s47 s50 s53 s56 s59 s62 s65 s68 s71 s74 s77 s80 s83 s86 s89 s92 s95 s98 s101 s104 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 4389 ms.
Product exploration explored 100000 steps with 0 reset in 4519 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Finished Best-First random walk after 1963 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 479 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:20:17] [INFO ] Invariant cache hit.
[2024-06-07 18:20:19] [INFO ] Implicit Places using invariants in 1634 ms returned []
[2024-06-07 18:20:19] [INFO ] Invariant cache hit.
[2024-06-07 18:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:20:21] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 4323 ms to find 0 implicit places.
[2024-06-07 18:20:21] [INFO ] Redundant transitions in 194 ms returned []
[2024-06-07 18:20:21] [INFO ] Invariant cache hit.
[2024-06-07 18:20:24] [INFO ] Dead Transitions using invariants and state equation in 2365 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7367 ms. Remains : 2401/2401 places, 4609/4609 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Finished Best-First random walk after 6111 steps, including 1 resets, run visited all 1 properties in 69 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 4371 ms.
Product exploration explored 100000 steps with 0 reset in 4419 ms.
Built C files in :
/tmp/ltsmin3802133319928550058
[2024-06-07 18:20:34] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:20:34] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3802133319928550058
Running compilation step : cd /tmp/ltsmin3802133319928550058;'/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/ltsmin3802133319928550058;'/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/ltsmin3802133319928550058;'/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 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 484 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:20:37] [INFO ] Invariant cache hit.
[2024-06-07 18:20:39] [INFO ] Implicit Places using invariants in 1716 ms returned []
[2024-06-07 18:20:39] [INFO ] Invariant cache hit.
[2024-06-07 18:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:20:42] [INFO ] Implicit Places using invariants and state equation in 2862 ms returned []
Implicit Place search using SMT with State Equation took 4582 ms to find 0 implicit places.
[2024-06-07 18:20:42] [INFO ] Redundant transitions in 184 ms returned []
[2024-06-07 18:20:42] [INFO ] Invariant cache hit.
[2024-06-07 18:20:44] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7540 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Built C files in :
/tmp/ltsmin17728179456262530722
[2024-06-07 18:20:44] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:20:44] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17728179456262530722
Running compilation step : cd /tmp/ltsmin17728179456262530722;'/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/ltsmin17728179456262530722;'/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/ltsmin17728179456262530722;'/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 18:20:48] [INFO ] Flatten gal took : 268 ms
[2024-06-07 18:20:48] [INFO ] Flatten gal took : 189 ms
[2024-06-07 18:20:48] [INFO ] Time to serialize gal into /tmp/LTL2270033222207455304.gal : 30 ms
[2024-06-07 18:20:48] [INFO ] Time to serialize properties into /tmp/LTL5263717372517213141.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/LTL2270033222207455304.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17656426290001853843.hoa' '-atoms' '/tmp/LTL5263717372517213141.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/LTL5263717372517213141.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17656426290001853843.hoa
Detected timeout of ITS tools.
[2024-06-07 18:21:03] [INFO ] Flatten gal took : 165 ms
[2024-06-07 18:21:04] [INFO ] Flatten gal took : 175 ms
[2024-06-07 18:21:04] [INFO ] Time to serialize gal into /tmp/LTL2558223796215472864.gal : 26 ms
[2024-06-07 18:21:04] [INFO ] Time to serialize properties into /tmp/LTL14999020563812560293.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/LTL2558223796215472864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14999020563812560293.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((pred_on_table_0+pred_on_table_1)+(pred_on_table_2+pred_on_table_3))+((pred_on_table_4+pred_on_table_5)+(pred_on_table_...1856
Formula 0 simplified : FG!"(((((((pred_on_table_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+p...932
Detected timeout of ITS tools.
[2024-06-07 18:21:19] [INFO ] Flatten gal took : 154 ms
[2024-06-07 18:21:19] [INFO ] Applying decomposition
[2024-06-07 18:21:19] [INFO ] Flatten gal took : 175 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/graph11827106856846816246.txt' '-o' '/tmp/graph11827106856846816246.bin' '-w' '/tmp/graph11827106856846816246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11827106856846816246.bin' '-l' '-1' '-v' '-w' '/tmp/graph11827106856846816246.weights' '-q' '0' '-e' '0.001'
[2024-06-07 18:21:19] [INFO ] Decomposing Gal with order
[2024-06-07 18:21:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 18:21:20] [INFO ] Removed a total of 8832 redundant transitions.
[2024-06-07 18:21:20] [INFO ] Flatten gal took : 506 ms
[2024-06-07 18:21:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-06-07 18:21:20] [INFO ] Time to serialize gal into /tmp/LTL16020907509453731466.gal : 29 ms
[2024-06-07 18:21:20] [INFO ] Time to serialize properties into /tmp/LTL15726896137930698974.ltl : 14 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/LTL16020907509453731466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15726896137930698974.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 : !((G(F(("(((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_...2240
Formula 0 simplified : FG!"(((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_tab...1124
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16741480537923196682
[2024-06-07 18:21:36] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16741480537923196682
Running compilation step : cd /tmp/ltsmin16741480537923196682;'/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/ltsmin16741480537923196682;'/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/ltsmin16741480537923196682;'/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-09-LTLCardinality-07 finished in 101524 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' '!(F(p0))'
Support contains 2 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 513 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:21:39] [INFO ] Invariant cache hit.
[2024-06-07 18:21:41] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2024-06-07 18:21:41] [INFO ] Invariant cache hit.
[2024-06-07 18:21:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:21:43] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 4305 ms to find 0 implicit places.
[2024-06-07 18:21:44] [INFO ] Redundant transitions in 189 ms returned []
[2024-06-07 18:21:44] [INFO ] Invariant cache hit.
[2024-06-07 18:21:46] [INFO ] Dead Transitions using invariants and state equation in 2273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7295 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s143 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 87 reset in 3948 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-09 finished in 11317 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)&&X(X(p1)))) U G(p2)))'
Support contains 5 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 103 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:21:50] [INFO ] Invariant cache hit.
[2024-06-07 18:21:52] [INFO ] Implicit Places using invariants in 1559 ms returned []
[2024-06-07 18:21:52] [INFO ] Invariant cache hit.
[2024-06-07 18:21:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:21:54] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
[2024-06-07 18:21:54] [INFO ] Invariant cache hit.
[2024-06-07 18:21:57] [INFO ] Dead Transitions using invariants and state equation in 2260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6686 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p0), (OR (NOT p1) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s130 s39), p0:(LEQ 1 s137), p1:(GT s45 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 4 reset in 1 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-11 finished in 6989 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((p0||X((X(G(p1)) U (p0&&X(G(p1))))))))'
Support contains 2 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 99 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:21:57] [INFO ] Invariant cache hit.
[2024-06-07 18:21:59] [INFO ] Implicit Places using invariants in 1566 ms returned []
[2024-06-07 18:21:59] [INFO ] Invariant cache hit.
[2024-06-07 18:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:22:01] [INFO ] Implicit Places using invariants and state equation in 2516 ms returned []
Implicit Place search using SMT with State Equation took 4084 ms to find 0 implicit places.
[2024-06-07 18:22:01] [INFO ] Invariant cache hit.
[2024-06-07 18:22:03] [INFO ] Dead Transitions using invariants and state equation in 2192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6377 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ 1 s121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-12 finished in 6523 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(!p0)))'
Support contains 1 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 102 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:22:03] [INFO ] Invariant cache hit.
[2024-06-07 18:22:05] [INFO ] Implicit Places using invariants in 1520 ms returned []
[2024-06-07 18:22:05] [INFO ] Invariant cache hit.
[2024-06-07 18:22:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:22:08] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 4207 ms to find 0 implicit places.
[2024-06-07 18:22:08] [INFO ] Invariant cache hit.
[2024-06-07 18:22:10] [INFO ] Dead Transitions using invariants and state equation in 2170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6479 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-13 finished in 6583 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(p0)))'
Support contains 2 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 106 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:22:10] [INFO ] Invariant cache hit.
[2024-06-07 18:22:12] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2024-06-07 18:22:12] [INFO ] Invariant cache hit.
[2024-06-07 18:22:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:22:17] [INFO ] Implicit Places using invariants and state equation in 4885 ms returned []
Implicit Place search using SMT with State Equation took 6558 ms to find 0 implicit places.
[2024-06-07 18:22:17] [INFO ] Invariant cache hit.
[2024-06-07 18:22:19] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9004 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s114 s143)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-09-LTLCardinality-14 finished in 9107 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' '!((F(G(p0))||G((p1&&X(p2)))))'
Found a Lengthening insensitive property : BlocksWorld-PT-09-LTLCardinality-04
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 97 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 134 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:22:19] [INFO ] Invariant cache hit.
[2024-06-07 18:22:21] [INFO ] Implicit Places using invariants in 1475 ms returned []
[2024-06-07 18:22:21] [INFO ] Invariant cache hit.
[2024-06-07 18:22:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:22:24] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 4118 ms to find 0 implicit places.
[2024-06-07 18:22:24] [INFO ] Invariant cache hit.
[2024-06-07 18:22:26] [INFO ] Dead Transitions using invariants and state equation in 2082 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6337 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Running random walk in product with property : BlocksWorld-PT-09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s1 s5 s8 s11 s14 s17 s20 s23 s26 s29 s32 s35 s38 s41 s44 s47 s50 s53 s56 s59 s62 s65 s68 s71 s74 s77 s80 s83 s86 s89 s92 s95 s98 s101 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 4343 ms.
Product exploration explored 100000 steps with 0 reset in 4417 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 (NOT p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p0), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289146 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289146 steps, saw 240765 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 18:22:38] [INFO ] Invariant cache hit.
[2024-06-07 18:22:38] [INFO ] [Real]Absence check using 97 positive place invariants in 55 ms returned sat
[2024-06-07 18:22:39] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 18:22:39] [INFO ] [Nat]Absence check using 97 positive place invariants in 52 ms returned sat
[2024-06-07 18:22:41] [INFO ] After 1786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 18:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:22:41] [INFO ] After 147ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 18:22:42] [INFO ] Deduced a trap composed of 336 places in 1237 ms of which 2 ms to minimize.
[2024-06-07 18:22:44] [INFO ] Deduced a trap composed of 184 places in 1275 ms of which 1 ms to minimize.
[2024-06-07 18:22:45] [INFO ] Deduced a trap composed of 621 places in 1276 ms of which 2 ms to minimize.
[2024-06-07 18:22:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4344 ms
[2024-06-07 18:22:45] [INFO ] After 4595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-06-07 18:22:45] [INFO ] After 6895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 4609/4609 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 2401 transition count 4608
Applied a total of 1 rules in 17525 ms. Remains 2401 /2401 variables (removed 0) and now considering 4608/4609 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17526 ms. Remains : 2401/2401 places, 4608/4609 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Finished Best-First random walk after 2402 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p0), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 48 out of 2401 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 514 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:23:04] [INFO ] Invariant cache hit.
[2024-06-07 18:23:06] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2024-06-07 18:23:06] [INFO ] Invariant cache hit.
[2024-06-07 18:23:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:23:08] [INFO ] Implicit Places using invariants and state equation in 2721 ms returned []
Implicit Place search using SMT with State Equation took 4237 ms to find 0 implicit places.
[2024-06-07 18:23:09] [INFO ] Redundant transitions in 187 ms returned []
[2024-06-07 18:23:09] [INFO ] Invariant cache hit.
[2024-06-07 18:23:11] [INFO ] Dead Transitions using invariants and state equation in 2354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7302 ms. Remains : 2401/2401 places, 4609/4609 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Finished Best-First random walk after 1996 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 4400 ms.
Product exploration explored 100000 steps with 0 reset in 4442 ms.
Built C files in :
/tmp/ltsmin9737332987396028839
[2024-06-07 18:23:21] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:23:21] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9737332987396028839
Running compilation step : cd /tmp/ltsmin9737332987396028839;'/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/ltsmin9737332987396028839;'/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/ltsmin9737332987396028839;'/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 48 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 4609/4609 transitions.
Applied a total of 0 rules in 487 ms. Remains 2401 /2401 variables (removed 0) and now considering 4609/4609 (removed 0) transitions.
[2024-06-07 18:23:24] [INFO ] Invariant cache hit.
[2024-06-07 18:23:26] [INFO ] Implicit Places using invariants in 1677 ms returned []
[2024-06-07 18:23:26] [INFO ] Invariant cache hit.
[2024-06-07 18:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 18:23:29] [INFO ] Implicit Places using invariants and state equation in 2861 ms returned []
Implicit Place search using SMT with State Equation took 4544 ms to find 0 implicit places.
[2024-06-07 18:23:29] [INFO ] Redundant transitions in 191 ms returned []
[2024-06-07 18:23:29] [INFO ] Invariant cache hit.
[2024-06-07 18:23:31] [INFO ] Dead Transitions using invariants and state equation in 2320 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7552 ms. Remains : 2401/2401 places, 4609/4609 transitions.
Built C files in :
/tmp/ltsmin5421993890889310376
[2024-06-07 18:23:31] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:23:31] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5421993890889310376
Running compilation step : cd /tmp/ltsmin5421993890889310376;'/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/ltsmin5421993890889310376;'/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/ltsmin5421993890889310376;'/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 18:23:35] [INFO ] Flatten gal took : 154 ms
[2024-06-07 18:23:35] [INFO ] Flatten gal took : 169 ms
[2024-06-07 18:23:35] [INFO ] Time to serialize gal into /tmp/LTL8639802831720329573.gal : 26 ms
[2024-06-07 18:23:35] [INFO ] Time to serialize properties into /tmp/LTL12905245027304314906.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/LTL8639802831720329573.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4875304644838487382.hoa' '-atoms' '/tmp/LTL12905245027304314906.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/LTL12905245027304314906.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4875304644838487382.hoa
Detected timeout of ITS tools.
[2024-06-07 18:23:50] [INFO ] Flatten gal took : 157 ms
[2024-06-07 18:23:50] [INFO ] Flatten gal took : 173 ms
[2024-06-07 18:23:50] [INFO ] Time to serialize gal into /tmp/LTL9559463857581116405.gal : 33 ms
[2024-06-07 18:23:50] [INFO ] Time to serialize properties into /tmp/LTL17611442095694543606.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/LTL9559463857581116405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17611442095694543606.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...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((pred_on_table_0+pred_on_table_1)+(pred_on_table_2+pred_on_table_3))+((pred_on_table_4+pred_on_table_5)+(pred_on_table_...3583
Formula 0 simplified : GF!"(((((((pred_on_table_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+p...3571
Detected timeout of ITS tools.
[2024-06-07 18:24:06] [INFO ] Flatten gal took : 150 ms
[2024-06-07 18:24:06] [INFO ] Applying decomposition
[2024-06-07 18:24:06] [INFO ] Flatten gal took : 155 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/graph5154108227491766713.txt' '-o' '/tmp/graph5154108227491766713.bin' '-w' '/tmp/graph5154108227491766713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5154108227491766713.bin' '-l' '-1' '-v' '-w' '/tmp/graph5154108227491766713.weights' '-q' '0' '-e' '0.001'
[2024-06-07 18:24:06] [INFO ] Decomposing Gal with order
[2024-06-07 18:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 18:24:07] [INFO ] Removed a total of 8640 redundant transitions.
[2024-06-07 18:24:07] [INFO ] Flatten gal took : 1124 ms
[2024-06-07 18:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 5664 labels/synchronizations in 541 ms.
[2024-06-07 18:24:09] [INFO ] Time to serialize gal into /tmp/LTL10735806889598309527.gal : 21 ms
[2024-06-07 18:24:09] [INFO ] Time to serialize properties into /tmp/LTL7091473035175013336.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/LTL10735806889598309527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7091473035175013336.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...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((gu1.pred_on_table_0+gu1.pred_on_table_1)+(gu1.pred_on_table_2+gu1.pred_on_table_3))+((gu1.pred_on_table_4+gu1.pred_on_...4355
Formula 0 simplified : GF!"(((((((gu1.pred_on_table_0+gu1.pred_on_table_1)+(gu1.pred_on_table_2+gu1.pred_on_table_3))+((gu1.pred_on_table_4+gu1.pred_on_tab...4343
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin883926602150925178
[2024-06-07 18:24:24] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin883926602150925178
Running compilation step : cd /tmp/ltsmin883926602150925178;'/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/ltsmin883926602150925178;'/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/ltsmin883926602150925178;'/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-09-LTLCardinality-04 finished in 127836 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||G(F(p0))))))'
[2024-06-07 18:24:27] [INFO ] Flatten gal took : 147 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7920963674689568832
[2024-06-07 18:24:27] [INFO ] Too many transitions (4609) to apply POR reductions. Disabling POR matrices.
[2024-06-07 18:24:27] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7920963674689568832
Running compilation step : cd /tmp/ltsmin7920963674689568832;'/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 18:24:27] [INFO ] Applying decomposition
[2024-06-07 18:24:27] [INFO ] Flatten gal took : 150 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/graph6893812576705362122.txt' '-o' '/tmp/graph6893812576705362122.bin' '-w' '/tmp/graph6893812576705362122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6893812576705362122.bin' '-l' '-1' '-v' '-w' '/tmp/graph6893812576705362122.weights' '-q' '0' '-e' '0.001'
[2024-06-07 18:24:28] [INFO ] Decomposing Gal with order
[2024-06-07 18:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 18:24:28] [INFO ] Flatten gal took : 417 ms
[2024-06-07 18:24:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 18:24:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality7725542003419475215.gal : 25 ms
[2024-06-07 18:24:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality11143410592427852663.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/LTLCardinality7725542003419475215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11143410592427852663.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...298
Read 2 LTL properties
Checking formula 0 : !(((F(G("(((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_...4743
Formula 0 simplified : GF!"(((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_tab...4731
Compilation finished in 15314 ms.
Running link step : cd /tmp/ltsmin7920963674689568832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin7920963674689568832;'/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' '(<>([]((LTLAPp0==true)))||[](((LTLAPp1==true)&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 137004 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7920963674689568832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](<>((LTLAPp0==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-06-07 18:43:36] [INFO ] Applying decomposition
[2024-06-07 18:43:37] [INFO ] Flatten gal took : 1184 ms
[2024-06-07 18:43:39] [INFO ] Decomposing Gal with order
[2024-06-07 18:43:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 18:44:00] [INFO ] Removed a total of 13534 redundant transitions.
[2024-06-07 18:44:01] [INFO ] Flatten gal took : 11568 ms
[2024-06-07 18:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 265 ms.
[2024-06-07 18:44:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality8689918489879496876.gal : 113 ms
[2024-06-07 18:44:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality4598782653291933405.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8689918489879496876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4598782653291933405.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...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((gmissing.pred_on_table_0+gmissing.pred_on_table_1)+(gmissing.pred_on_table_2+gmissing.pred_on_table_3))+((gmissing.pre...2720
Formula 0 simplified : FG!"(((((((gmissing.pred_on_table_0+gmissing.pred_on_table_1)+(gmissing.pred_on_table_2+gmissing.pred_on_table_3))+((gmissing.pred_o...1364
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin7920963674689568832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7920963674689568832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](<>((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 247470 ms.
FORMULA BlocksWorld-PT-09-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3127834 ms.

BK_STOP 1717786869967

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-09"
export BK_EXAMINATION="LTLCardinality"
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-09, examination is LTLCardinality"
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-171774435600142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-09.tgz
mv BlocksWorld-PT-09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;