Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717100490.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 708K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679454577743

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:09:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:09:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:09:40] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-22 03:09:40] [INFO ] Transformed 2723 places.
[2023-03-22 03:09:40] [INFO ] Transformed 2523 transitions.
[2023-03-22 03:09:40] [INFO ] Found NUPN structural information;
[2023-03-22 03:09:40] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 222 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 245 place count 2478 transition count 2278
Iterating global reduction 0 with 245 rules applied. Total rules applied 490 place count 2478 transition count 2278
Applied a total of 490 rules in 564 ms. Remains 2478 /2723 variables (removed 245) and now considering 2278/2523 (removed 245) transitions.
// Phase 1: matrix 2278 rows 2478 cols
[2023-03-22 03:09:41] [INFO ] Computed 441 place invariants in 32 ms
[2023-03-22 03:09:43] [INFO ] Implicit Places using invariants in 1759 ms returned []
[2023-03-22 03:09:43] [INFO ] Invariant cache hit.
[2023-03-22 03:09:48] [INFO ] Implicit Places using invariants and state equation in 5232 ms returned []
Implicit Place search using SMT with State Equation took 7048 ms to find 0 implicit places.
[2023-03-22 03:09:48] [INFO ] Invariant cache hit.
[2023-03-22 03:09:50] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2478/2723 places, 2278/2523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9276 ms. Remains : 2478/2723 places, 2278/2523 transitions.
Support contains 222 out of 2478 places after structural reductions.
[2023-03-22 03:09:50] [INFO ] Flatten gal took : 175 ms
[2023-03-22 03:09:50] [INFO ] Flatten gal took : 99 ms
[2023-03-22 03:09:51] [INFO ] Input system was already deterministic with 2278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=14 ) properties (out of 126) seen :91
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-22 03:09:51] [INFO ] Invariant cache hit.
[2023-03-22 03:09:54] [INFO ] [Real]Absence check using 441 positive place invariants in 212 ms returned sat
[2023-03-22 03:09:55] [INFO ] After 3289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-22 03:09:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 209 ms returned sat
[2023-03-22 03:10:06] [INFO ] After 5998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-22 03:10:06] [INFO ] Deduced a trap composed of 18 places in 439 ms of which 5 ms to minimize.
[2023-03-22 03:10:07] [INFO ] Deduced a trap composed of 31 places in 552 ms of which 3 ms to minimize.
[2023-03-22 03:10:08] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 2 ms to minimize.
[2023-03-22 03:10:08] [INFO ] Deduced a trap composed of 18 places in 511 ms of which 29 ms to minimize.
[2023-03-22 03:10:09] [INFO ] Deduced a trap composed of 22 places in 509 ms of which 13 ms to minimize.
[2023-03-22 03:10:09] [INFO ] Deduced a trap composed of 27 places in 492 ms of which 1 ms to minimize.
[2023-03-22 03:10:10] [INFO ] Deduced a trap composed of 29 places in 471 ms of which 14 ms to minimize.
[2023-03-22 03:10:11] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 1 ms to minimize.
[2023-03-22 03:10:11] [INFO ] Deduced a trap composed of 36 places in 320 ms of which 0 ms to minimize.
[2023-03-22 03:10:11] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2023-03-22 03:10:12] [INFO ] Deduced a trap composed of 21 places in 487 ms of which 1 ms to minimize.
[2023-03-22 03:10:12] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 1 ms to minimize.
[2023-03-22 03:10:13] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 1 ms to minimize.
[2023-03-22 03:10:13] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 1 ms to minimize.
[2023-03-22 03:10:14] [INFO ] Deduced a trap composed of 29 places in 396 ms of which 1 ms to minimize.
[2023-03-22 03:10:14] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 0 ms to minimize.
[2023-03-22 03:10:15] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 1 ms to minimize.
[2023-03-22 03:10:15] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2023-03-22 03:10:16] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 1 ms to minimize.
[2023-03-22 03:10:16] [INFO ] Deduced a trap composed of 30 places in 366 ms of which 1 ms to minimize.
[2023-03-22 03:10:17] [INFO ] Deduced a trap composed of 62 places in 996 ms of which 1 ms to minimize.
[2023-03-22 03:10:18] [INFO ] Deduced a trap composed of 70 places in 335 ms of which 15 ms to minimize.
[2023-03-22 03:10:18] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
[2023-03-22 03:10:18] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 1 ms to minimize.
[2023-03-22 03:10:19] [INFO ] Deduced a trap composed of 51 places in 466 ms of which 1 ms to minimize.
[2023-03-22 03:10:19] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 1 ms to minimize.
[2023-03-22 03:10:20] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 1 ms to minimize.
[2023-03-22 03:10:21] [INFO ] Deduced a trap composed of 19 places in 1684 ms of which 3 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:10:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:10:21] [INFO ] After 26706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:35
Parikh walk visited 0 properties in 5648 ms.
Support contains 81 out of 2478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Drop transitions removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 259 place count 2478 transition count 2019
Reduce places removed 259 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 266 rules applied. Total rules applied 525 place count 2219 transition count 2012
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 532 place count 2212 transition count 2012
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 532 place count 2212 transition count 1811
Deduced a syphon composed of 201 places in 6 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 934 place count 2011 transition count 1811
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 954 place count 1991 transition count 1791
Iterating global reduction 3 with 20 rules applied. Total rules applied 974 place count 1991 transition count 1791
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 974 place count 1991 transition count 1782
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 992 place count 1982 transition count 1782
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 7 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2352 place count 1302 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 323 times.
Drop transitions removed 323 transitions
Iterating global reduction 3 with 323 rules applied. Total rules applied 2675 place count 1302 transition count 1102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2676 place count 1301 transition count 1101
Applied a total of 2676 rules in 705 ms. Remains 1301 /2478 variables (removed 1177) and now considering 1101/2278 (removed 1177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 705 ms. Remains : 1301/2478 places, 1101/2278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 35) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1101 rows 1301 cols
[2023-03-22 03:10:29] [INFO ] Computed 441 place invariants in 29 ms
[2023-03-22 03:10:30] [INFO ] [Real]Absence check using 423 positive place invariants in 163 ms returned sat
[2023-03-22 03:10:30] [INFO ] [Real]Absence check using 423 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-22 03:10:32] [INFO ] After 2395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 03:10:32] [INFO ] [Nat]Absence check using 423 positive place invariants in 116 ms returned sat
[2023-03-22 03:10:32] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 23 ms returned sat
[2023-03-22 03:10:34] [INFO ] After 1508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:35] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 1 ms to minimize.
[2023-03-22 03:10:35] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-22 03:10:35] [INFO ] Deduced a trap composed of 5 places in 431 ms of which 0 ms to minimize.
[2023-03-22 03:10:36] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 0 ms to minimize.
[2023-03-22 03:10:36] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2023-03-22 03:10:36] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-22 03:10:37] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-22 03:10:37] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-22 03:10:37] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-22 03:10:37] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-22 03:10:38] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 1 ms to minimize.
[2023-03-22 03:10:38] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:10:38] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-22 03:10:39] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 0 ms to minimize.
[2023-03-22 03:10:39] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 11 ms to minimize.
[2023-03-22 03:10:39] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-22 03:10:39] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2023-03-22 03:10:40] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-22 03:10:40] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 0 ms to minimize.
[2023-03-22 03:10:40] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 0 ms to minimize.
[2023-03-22 03:10:41] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2023-03-22 03:10:41] [INFO ] Deduced a trap composed of 42 places in 370 ms of which 1 ms to minimize.
[2023-03-22 03:10:42] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 17 ms to minimize.
[2023-03-22 03:10:42] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 1 ms to minimize.
[2023-03-22 03:10:42] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-22 03:10:42] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-22 03:10:43] [INFO ] Deduced a trap composed of 8 places in 423 ms of which 0 ms to minimize.
[2023-03-22 03:10:43] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 22 ms to minimize.
[2023-03-22 03:10:44] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2023-03-22 03:10:44] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2023-03-22 03:10:44] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 0 ms to minimize.
[2023-03-22 03:10:44] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 2 ms to minimize.
[2023-03-22 03:10:45] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 1 ms to minimize.
[2023-03-22 03:10:45] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2023-03-22 03:10:45] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-22 03:10:46] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2023-03-22 03:10:46] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 3 ms to minimize.
[2023-03-22 03:10:46] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 0 ms to minimize.
[2023-03-22 03:10:46] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 12206 ms
[2023-03-22 03:10:47] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 14 ms to minimize.
[2023-03-22 03:10:47] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 21 ms to minimize.
[2023-03-22 03:10:48] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-22 03:10:48] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2023-03-22 03:10:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1457 ms
[2023-03-22 03:10:48] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-22 03:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-22 03:10:49] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-22 03:10:49] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:10:49] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 0 ms to minimize.
[2023-03-22 03:10:50] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-22 03:10:50] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-22 03:10:50] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2023-03-22 03:10:50] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2023-03-22 03:10:50] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-22 03:10:51] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:10:51] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-22 03:10:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2515 ms
[2023-03-22 03:10:51] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-22 03:10:52] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-22 03:10:52] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-22 03:10:52] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-22 03:10:53] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 1 ms to minimize.
[2023-03-22 03:10:53] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-22 03:10:53] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-22 03:10:53] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:10:54] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-22 03:10:54] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-22 03:10:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2390 ms
[2023-03-22 03:10:54] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-22 03:10:55] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-22 03:10:55] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-22 03:10:55] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-22 03:10:55] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-22 03:10:55] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-22 03:10:56] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2023-03-22 03:10:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1609 ms
[2023-03-22 03:10:56] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-22 03:10:56] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2023-03-22 03:10:57] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:10:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:10:57] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 369 ms.
Support contains 45 out of 1301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1301/1301 places, 1101/1101 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1301 transition count 1098
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1298 transition count 1098
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 1298 transition count 1094
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 1294 transition count 1094
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 1276 transition count 1076
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 1276 transition count 1076
Applied a total of 58 rules in 135 ms. Remains 1276 /1301 variables (removed 25) and now considering 1076/1101 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1276/1301 places, 1076/1101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1076 rows 1276 cols
[2023-03-22 03:10:58] [INFO ] Computed 441 place invariants in 21 ms
[2023-03-22 03:10:59] [INFO ] [Real]Absence check using 425 positive place invariants in 82 ms returned sat
[2023-03-22 03:10:59] [INFO ] [Real]Absence check using 425 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-22 03:11:00] [INFO ] After 1842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 03:11:01] [INFO ] [Nat]Absence check using 425 positive place invariants in 119 ms returned sat
[2023-03-22 03:11:01] [INFO ] [Nat]Absence check using 425 positive and 16 generalized place invariants in 77 ms returned sat
[2023-03-22 03:11:02] [INFO ] After 1475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 03:11:03] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2023-03-22 03:11:03] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 0 ms to minimize.
[2023-03-22 03:11:04] [INFO ] Deduced a trap composed of 5 places in 743 ms of which 1 ms to minimize.
[2023-03-22 03:11:04] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 1 ms to minimize.
[2023-03-22 03:11:05] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 0 ms to minimize.
[2023-03-22 03:11:05] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:11:05] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 0 ms to minimize.
[2023-03-22 03:11:06] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 1 ms to minimize.
[2023-03-22 03:11:06] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-22 03:11:06] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 1 ms to minimize.
[2023-03-22 03:11:07] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-22 03:11:07] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 0 ms to minimize.
[2023-03-22 03:11:07] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-22 03:11:08] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2023-03-22 03:11:08] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-22 03:11:08] [INFO ] Deduced a trap composed of 6 places in 382 ms of which 1 ms to minimize.
[2023-03-22 03:11:09] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2023-03-22 03:11:09] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 0 ms to minimize.
[2023-03-22 03:11:09] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-22 03:11:10] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 0 ms to minimize.
[2023-03-22 03:11:10] [INFO ] Deduced a trap composed of 18 places in 543 ms of which 0 ms to minimize.
[2023-03-22 03:11:11] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 0 ms to minimize.
[2023-03-22 03:11:11] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-22 03:11:11] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8697 ms
[2023-03-22 03:11:12] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 2 ms to minimize.
[2023-03-22 03:11:12] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-22 03:11:13] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 0 ms to minimize.
[2023-03-22 03:11:13] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2023-03-22 03:11:13] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 1 ms to minimize.
[2023-03-22 03:11:14] [INFO ] Deduced a trap composed of 9 places in 370 ms of which 0 ms to minimize.
[2023-03-22 03:11:14] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-22 03:11:14] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-22 03:11:15] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2023-03-22 03:11:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3260 ms
[2023-03-22 03:11:15] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 0 ms to minimize.
[2023-03-22 03:11:15] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-22 03:11:16] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 03:11:16] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-22 03:11:16] [INFO ] Deduced a trap composed of 9 places in 433 ms of which 0 ms to minimize.
[2023-03-22 03:11:17] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2023-03-22 03:11:17] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-22 03:11:17] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-22 03:11:17] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 2 ms to minimize.
[2023-03-22 03:11:18] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2023-03-22 03:11:18] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-22 03:11:18] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 0 ms to minimize.
[2023-03-22 03:11:18] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-22 03:11:19] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-22 03:11:19] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 0 ms to minimize.
[2023-03-22 03:11:19] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4193 ms
[2023-03-22 03:11:19] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 2 ms to minimize.
[2023-03-22 03:11:20] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-22 03:11:20] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 0 ms to minimize.
[2023-03-22 03:11:20] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2023-03-22 03:11:20] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-22 03:11:21] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-22 03:11:21] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-22 03:11:21] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-22 03:11:21] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-22 03:11:22] [INFO ] Deduced a trap composed of 8 places in 434 ms of which 1 ms to minimize.
[2023-03-22 03:11:22] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:11:22] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:11:23] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 0 ms to minimize.
[2023-03-22 03:11:23] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-22 03:11:23] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2023-03-22 03:11:24] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 1 ms to minimize.
[2023-03-22 03:11:25] [INFO ] Deduced a trap composed of 7 places in 1489 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:11:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:11:25] [INFO ] After 25152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 253 ms.
Support contains 32 out of 1276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1276/1276 places, 1076/1076 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1276 transition count 1075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1275 transition count 1075
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1269 transition count 1069
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 21 place count 1269 transition count 1069
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1268 transition count 1068
Applied a total of 22 rules in 276 ms. Remains 1268 /1276 variables (removed 8) and now considering 1068/1076 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 1268/1276 places, 1068/1076 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 58348 steps, run timeout after 3019 ms. (steps per millisecond=19 ) properties seen :{2=1}
Probabilistic random walk after 58348 steps, saw 53823 distinct states, run finished after 3020 ms. (steps per millisecond=19 ) properties seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 1068 rows 1268 cols
[2023-03-22 03:11:30] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-22 03:11:30] [INFO ] [Real]Absence check using 420 positive place invariants in 94 ms returned sat
[2023-03-22 03:11:30] [INFO ] [Real]Absence check using 420 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-22 03:11:32] [INFO ] After 1588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 03:11:32] [INFO ] [Nat]Absence check using 420 positive place invariants in 386 ms returned sat
[2023-03-22 03:11:32] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-22 03:11:34] [INFO ] After 1643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 03:11:35] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-22 03:11:35] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-22 03:11:35] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-22 03:11:35] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:11:36] [INFO ] Deduced a trap composed of 6 places in 366 ms of which 1 ms to minimize.
[2023-03-22 03:11:36] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2023-03-22 03:11:36] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-22 03:11:37] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 0 ms to minimize.
[2023-03-22 03:11:37] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 0 ms to minimize.
[2023-03-22 03:11:37] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-22 03:11:37] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 0 ms to minimize.
[2023-03-22 03:11:38] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 0 ms to minimize.
[2023-03-22 03:11:38] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-22 03:11:38] [INFO ] Deduced a trap composed of 9 places in 366 ms of which 1 ms to minimize.
[2023-03-22 03:11:39] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-22 03:11:39] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 0 ms to minimize.
[2023-03-22 03:11:39] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 2 ms to minimize.
[2023-03-22 03:11:39] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:11:40] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 14 ms to minimize.
[2023-03-22 03:11:40] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 1 ms to minimize.
[2023-03-22 03:11:40] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 1 ms to minimize.
[2023-03-22 03:11:41] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-22 03:11:41] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-22 03:11:41] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-22 03:11:41] [INFO ] Deduced a trap composed of 9 places in 381 ms of which 1 ms to minimize.
[2023-03-22 03:11:42] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7343 ms
[2023-03-22 03:11:42] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-22 03:11:42] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-22 03:11:43] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
[2023-03-22 03:11:43] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-22 03:11:43] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2023-03-22 03:11:44] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-22 03:11:44] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-22 03:11:44] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2023-03-22 03:11:45] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 0 ms to minimize.
[2023-03-22 03:11:45] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2023-03-22 03:11:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3091 ms
[2023-03-22 03:11:45] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-22 03:11:45] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:11:46] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 1 ms to minimize.
[2023-03-22 03:11:46] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-22 03:11:46] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2023-03-22 03:11:46] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 0 ms to minimize.
[2023-03-22 03:11:48] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 0 ms to minimize.
[2023-03-22 03:11:48] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 0 ms to minimize.
[2023-03-22 03:11:48] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:11:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3326 ms
[2023-03-22 03:11:49] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-22 03:11:49] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-22 03:11:49] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-22 03:11:49] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2023-03-22 03:11:50] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 0 ms to minimize.
[2023-03-22 03:11:50] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2023-03-22 03:11:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1449 ms
[2023-03-22 03:11:50] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-22 03:11:50] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-22 03:11:51] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-22 03:11:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 706 ms
[2023-03-22 03:11:51] [INFO ] After 18241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 516 ms.
[2023-03-22 03:11:51] [INFO ] After 19739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 158 ms.
Support contains 31 out of 1268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1268/1268 places, 1068/1068 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1268 transition count 1067
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1267 transition count 1067
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1266 transition count 1066
Applied a total of 3 rules in 88 ms. Remains 1266 /1268 variables (removed 2) and now considering 1066/1068 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1266/1268 places, 1066/1068 transitions.
[2023-03-22 03:11:52] [INFO ] Flatten gal took : 86 ms
[2023-03-22 03:11:52] [INFO ] Flatten gal took : 75 ms
[2023-03-22 03:11:52] [INFO ] Input system was already deterministic with 2278 transitions.
Computed a total of 497 stabilizing places and 497 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2444 transition count 2244
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2444 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 2443 transition count 2243
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 2443 transition count 2243
Applied a total of 70 rules in 400 ms. Remains 2443 /2478 variables (removed 35) and now considering 2243/2278 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 2443/2478 places, 2243/2278 transitions.
[2023-03-22 03:11:52] [INFO ] Flatten gal took : 100 ms
[2023-03-22 03:11:53] [INFO ] Flatten gal took : 93 ms
[2023-03-22 03:11:53] [INFO ] Input system was already deterministic with 2243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2447 transition count 2247
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2447 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2446 transition count 2246
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2446 transition count 2246
Applied a total of 64 rules in 382 ms. Remains 2446 /2478 variables (removed 32) and now considering 2246/2278 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 2446/2478 places, 2246/2278 transitions.
[2023-03-22 03:11:53] [INFO ] Flatten gal took : 69 ms
[2023-03-22 03:11:53] [INFO ] Flatten gal took : 67 ms
[2023-03-22 03:11:53] [INFO ] Input system was already deterministic with 2246 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2477 transition count 1998
Reduce places removed 279 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 281 rules applied. Total rules applied 560 place count 2198 transition count 1996
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 562 place count 2196 transition count 1996
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 562 place count 2196 transition count 1798
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 958 place count 1998 transition count 1798
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 991 place count 1965 transition count 1765
Iterating global reduction 3 with 33 rules applied. Total rules applied 1024 place count 1965 transition count 1765
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1024 place count 1965 transition count 1753
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1048 place count 1953 transition count 1753
Performed 697 Post agglomeration using F-continuation condition.Transition count delta: 697
Deduced a syphon composed of 697 places in 1 ms
Reduce places removed 697 places and 0 transitions.
Iterating global reduction 3 with 1394 rules applied. Total rules applied 2442 place count 1256 transition count 1056
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2444 place count 1254 transition count 1054
Applied a total of 2444 rules in 540 ms. Remains 1254 /2478 variables (removed 1224) and now considering 1054/2278 (removed 1224) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 541 ms. Remains : 1254/2478 places, 1054/2278 transitions.
[2023-03-22 03:11:54] [INFO ] Flatten gal took : 40 ms
[2023-03-22 03:11:54] [INFO ] Flatten gal took : 34 ms
[2023-03-22 03:11:54] [INFO ] Input system was already deterministic with 1054 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 342 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 03:11:55] [INFO ] Flatten gal took : 50 ms
[2023-03-22 03:11:55] [INFO ] Flatten gal took : 68 ms
[2023-03-22 03:11:55] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2477 transition count 1999
Reduce places removed 278 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 280 rules applied. Total rules applied 558 place count 2199 transition count 1997
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 560 place count 2197 transition count 1997
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 560 place count 2197 transition count 1797
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 960 place count 1997 transition count 1797
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 995 place count 1962 transition count 1762
Iterating global reduction 3 with 35 rules applied. Total rules applied 1030 place count 1962 transition count 1762
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1030 place count 1962 transition count 1750
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1054 place count 1950 transition count 1750
Performed 703 Post agglomeration using F-continuation condition.Transition count delta: 703
Deduced a syphon composed of 703 places in 1 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 3 with 1406 rules applied. Total rules applied 2460 place count 1247 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2462 place count 1245 transition count 1045
Applied a total of 2462 rules in 497 ms. Remains 1245 /2478 variables (removed 1233) and now considering 1045/2278 (removed 1233) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 497 ms. Remains : 1245/2478 places, 1045/2278 transitions.
[2023-03-22 03:11:55] [INFO ] Flatten gal took : 29 ms
[2023-03-22 03:11:55] [INFO ] Flatten gal took : 29 ms
[2023-03-22 03:11:55] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2446 transition count 2246
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2446 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 2445 transition count 2245
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 2445 transition count 2245
Applied a total of 66 rules in 385 ms. Remains 2445 /2478 variables (removed 33) and now considering 2245/2278 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 2445/2478 places, 2245/2278 transitions.
[2023-03-22 03:11:56] [INFO ] Flatten gal took : 51 ms
[2023-03-22 03:11:56] [INFO ] Flatten gal took : 57 ms
[2023-03-22 03:11:56] [INFO ] Input system was already deterministic with 2245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2450 transition count 2250
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2450 transition count 2250
Applied a total of 56 rules in 277 ms. Remains 2450 /2478 variables (removed 28) and now considering 2250/2278 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 2450/2478 places, 2250/2278 transitions.
[2023-03-22 03:11:56] [INFO ] Flatten gal took : 55 ms
[2023-03-22 03:11:56] [INFO ] Flatten gal took : 58 ms
[2023-03-22 03:11:57] [INFO ] Input system was already deterministic with 2250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2445 transition count 2245
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2445 transition count 2245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 2444 transition count 2244
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 2444 transition count 2244
Applied a total of 68 rules in 471 ms. Remains 2444 /2478 variables (removed 34) and now considering 2244/2278 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 2444/2478 places, 2244/2278 transitions.
[2023-03-22 03:11:57] [INFO ] Flatten gal took : 52 ms
[2023-03-22 03:11:57] [INFO ] Flatten gal took : 55 ms
[2023-03-22 03:11:57] [INFO ] Input system was already deterministic with 2244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2444 transition count 2244
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2444 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 2443 transition count 2243
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 2443 transition count 2243
Applied a total of 70 rules in 363 ms. Remains 2443 /2478 variables (removed 35) and now considering 2243/2278 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 2443/2478 places, 2243/2278 transitions.
[2023-03-22 03:11:58] [INFO ] Flatten gal took : 48 ms
[2023-03-22 03:11:58] [INFO ] Flatten gal took : 50 ms
[2023-03-22 03:11:58] [INFO ] Input system was already deterministic with 2243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2449 transition count 2249
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2449 transition count 2249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 2448 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 2448 transition count 2248
Applied a total of 60 rules in 353 ms. Remains 2448 /2478 variables (removed 30) and now considering 2248/2278 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 2448/2478 places, 2248/2278 transitions.
[2023-03-22 03:11:58] [INFO ] Flatten gal took : 46 ms
[2023-03-22 03:11:58] [INFO ] Flatten gal took : 54 ms
[2023-03-22 03:11:59] [INFO ] Input system was already deterministic with 2248 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 389 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 03:11:59] [INFO ] Flatten gal took : 45 ms
[2023-03-22 03:11:59] [INFO ] Flatten gal took : 61 ms
[2023-03-22 03:11:59] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2446 transition count 2246
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2446 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 2445 transition count 2245
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 2445 transition count 2245
Applied a total of 66 rules in 354 ms. Remains 2445 /2478 variables (removed 33) and now considering 2245/2278 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 2445/2478 places, 2245/2278 transitions.
[2023-03-22 03:12:00] [INFO ] Flatten gal took : 49 ms
[2023-03-22 03:12:00] [INFO ] Flatten gal took : 53 ms
[2023-03-22 03:12:00] [INFO ] Input system was already deterministic with 2245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2447 transition count 2247
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2447 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2446 transition count 2246
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2446 transition count 2246
Applied a total of 64 rules in 384 ms. Remains 2446 /2478 variables (removed 32) and now considering 2246/2278 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 2446/2478 places, 2246/2278 transitions.
[2023-03-22 03:12:00] [INFO ] Flatten gal took : 62 ms
[2023-03-22 03:12:00] [INFO ] Flatten gal took : 56 ms
[2023-03-22 03:12:01] [INFO ] Input system was already deterministic with 2246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 405 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 03:12:01] [INFO ] Flatten gal took : 46 ms
[2023-03-22 03:12:01] [INFO ] Flatten gal took : 49 ms
[2023-03-22 03:12:01] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2443 transition count 2243
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2443 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2442 transition count 2242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2442 transition count 2242
Applied a total of 72 rules in 339 ms. Remains 2442 /2478 variables (removed 36) and now considering 2242/2278 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 2442/2478 places, 2242/2278 transitions.
[2023-03-22 03:12:02] [INFO ] Flatten gal took : 47 ms
[2023-03-22 03:12:02] [INFO ] Flatten gal took : 54 ms
[2023-03-22 03:12:02] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2478/2478 places, 2278/2278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2477 transition count 1999
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 2199 transition count 1998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 2198 transition count 1998
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 558 place count 2198 transition count 1798
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 958 place count 1998 transition count 1798
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 991 place count 1965 transition count 1765
Iterating global reduction 3 with 33 rules applied. Total rules applied 1024 place count 1965 transition count 1765
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1024 place count 1965 transition count 1754
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1046 place count 1954 transition count 1754
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 699
Deduced a syphon composed of 699 places in 1 ms
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 3 with 1398 rules applied. Total rules applied 2444 place count 1255 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2446 place count 1253 transition count 1053
Applied a total of 2446 rules in 422 ms. Remains 1253 /2478 variables (removed 1225) and now considering 1053/2278 (removed 1225) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 422 ms. Remains : 1253/2478 places, 1053/2278 transitions.
[2023-03-22 03:12:02] [INFO ] Flatten gal took : 37 ms
[2023-03-22 03:12:02] [INFO ] Flatten gal took : 36 ms
[2023-03-22 03:12:02] [INFO ] Input system was already deterministic with 1053 transitions.
[2023-03-22 03:12:02] [INFO ] Flatten gal took : 50 ms
[2023-03-22 03:12:02] [INFO ] Flatten gal took : 51 ms
[2023-03-22 03:12:03] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-22 03:12:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2478 places, 2278 transitions and 6476 arcs took 9 ms.
Total runtime 142631 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1194/ctl_0_ --ctl=/tmp/1194/ctl_1_ --ctl=/tmp/1194/ctl_2_ --ctl=/tmp/1194/ctl_3_ --ctl=/tmp/1194/ctl_4_ --ctl=/tmp/1194/ctl_5_ --ctl=/tmp/1194/ctl_6_ --ctl=/tmp/1194/ctl_7_ --ctl=/tmp/1194/ctl_8_ --ctl=/tmp/1194/ctl_9_ --ctl=/tmp/1194/ctl_10_ --ctl=/tmp/1194/ctl_11_ --ctl=/tmp/1194/ctl_12_ --ctl=/tmp/1194/ctl_13_ --ctl=/tmp/1194/ctl_14_ --ctl=/tmp/1194/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9488028 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094812 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717100490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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