Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800170.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-100B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 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.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 1.3M 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 ShieldRVs-PT-100B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679302903680

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=ShieldRVs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:01:45] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2023-03-20 09:01:45] [INFO ] Transformed 4003 places.
[2023-03-20 09:01:45] [INFO ] Transformed 4503 transitions.
[2023-03-20 09:01:45] [INFO ] Found NUPN structural information;
[2023-03-20 09:01:46] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 192 out of 4003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Discarding 656 places :
Symmetric choice reduction at 0 with 656 rule applications. Total rules 656 place count 3347 transition count 3847
Iterating global reduction 0 with 656 rules applied. Total rules applied 1312 place count 3347 transition count 3847
Applied a total of 1312 rules in 744 ms. Remains 3347 /4003 variables (removed 656) and now considering 3847/4503 (removed 656) transitions.
// Phase 1: matrix 3847 rows 3347 cols
[2023-03-20 09:01:47] [INFO ] Computed 401 place invariants in 67 ms
[2023-03-20 09:01:48] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2023-03-20 09:01:48] [INFO ] Invariant cache hit.
[2023-03-20 09:01:52] [INFO ] Implicit Places using invariants and state equation in 4219 ms returned []
Implicit Place search using SMT with State Equation took 5549 ms to find 0 implicit places.
[2023-03-20 09:01:52] [INFO ] Invariant cache hit.
[2023-03-20 09:01:54] [INFO ] Dead Transitions using invariants and state equation in 2115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3347/4003 places, 3847/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8412 ms. Remains : 3347/4003 places, 3847/4503 transitions.
Support contains 192 out of 3347 places after structural reductions.
[2023-03-20 09:01:55] [INFO ] Flatten gal took : 356 ms
[2023-03-20 09:01:55] [INFO ] Flatten gal took : 221 ms
[2023-03-20 09:01:55] [INFO ] Input system was already deterministic with 3847 transitions.
Support contains 173 out of 3347 places (down from 192) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 86) seen :64
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-20 09:01:56] [INFO ] Invariant cache hit.
[2023-03-20 09:01:57] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-20 09:01:59] [INFO ] [Nat]Absence check using 401 positive place invariants in 203 ms returned sat
[2023-03-20 09:02:06] [INFO ] After 6252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-20 09:02:07] [INFO ] Deduced a trap composed of 35 places in 616 ms of which 6 ms to minimize.
[2023-03-20 09:02:08] [INFO ] Deduced a trap composed of 35 places in 580 ms of which 2 ms to minimize.
[2023-03-20 09:02:08] [INFO ] Deduced a trap composed of 41 places in 597 ms of which 1 ms to minimize.
[2023-03-20 09:02:09] [INFO ] Deduced a trap composed of 28 places in 543 ms of which 1 ms to minimize.
[2023-03-20 09:02:10] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 3 ms to minimize.
[2023-03-20 09:02:10] [INFO ] Deduced a trap composed of 32 places in 557 ms of which 2 ms to minimize.
[2023-03-20 09:02:11] [INFO ] Deduced a trap composed of 29 places in 537 ms of which 2 ms to minimize.
[2023-03-20 09:02:12] [INFO ] Deduced a trap composed of 42 places in 473 ms of which 1 ms to minimize.
[2023-03-20 09:02:12] [INFO ] Deduced a trap composed of 36 places in 491 ms of which 2 ms to minimize.
[2023-03-20 09:02:13] [INFO ] Deduced a trap composed of 53 places in 529 ms of which 2 ms to minimize.
[2023-03-20 09:02:14] [INFO ] Deduced a trap composed of 28 places in 490 ms of which 1 ms to minimize.
[2023-03-20 09:02:14] [INFO ] Deduced a trap composed of 41 places in 541 ms of which 1 ms to minimize.
[2023-03-20 09:02:15] [INFO ] Deduced a trap composed of 39 places in 452 ms of which 1 ms to minimize.
[2023-03-20 09:02:15] [INFO ] Deduced a trap composed of 24 places in 483 ms of which 1 ms to minimize.
[2023-03-20 09:02:16] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 1 ms to minimize.
[2023-03-20 09:02:17] [INFO ] Deduced a trap composed of 62 places in 449 ms of which 1 ms to minimize.
[2023-03-20 09:02:17] [INFO ] Deduced a trap composed of 35 places in 461 ms of which 1 ms to minimize.
[2023-03-20 09:02:18] [INFO ] Deduced a trap composed of 34 places in 459 ms of which 1 ms to minimize.
[2023-03-20 09:02:18] [INFO ] Deduced a trap composed of 44 places in 451 ms of which 1 ms to minimize.
[2023-03-20 09:02:19] [INFO ] Deduced a trap composed of 30 places in 451 ms of which 1 ms to minimize.
[2023-03-20 09:02:20] [INFO ] Deduced a trap composed of 40 places in 445 ms of which 1 ms to minimize.
[2023-03-20 09:02:20] [INFO ] Deduced a trap composed of 46 places in 513 ms of which 2 ms to minimize.
[2023-03-20 09:02:21] [INFO ] Deduced a trap composed of 44 places in 467 ms of which 1 ms to minimize.
[2023-03-20 09:02:21] [INFO ] Deduced a trap composed of 32 places in 453 ms of which 1 ms to minimize.
[2023-03-20 09:02:22] [INFO ] Deduced a trap composed of 42 places in 487 ms of which 1 ms to minimize.
[2023-03-20 09:02:23] [INFO ] Deduced a trap composed of 41 places in 479 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-20 09:02:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:02:23] [INFO ] After 25108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Parikh walk visited 1 properties in 6249 ms.
Support contains 59 out of 3347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 3347 transition count 3458
Reduce places removed 389 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 390 rules applied. Total rules applied 779 place count 2958 transition count 3457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 780 place count 2957 transition count 3457
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 496 Pre rules applied. Total rules applied 780 place count 2957 transition count 2961
Deduced a syphon composed of 496 places in 12 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1772 place count 2461 transition count 2961
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1802 place count 2431 transition count 2931
Iterating global reduction 3 with 30 rules applied. Total rules applied 1832 place count 2431 transition count 2931
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1832 place count 2431 transition count 2910
Deduced a syphon composed of 21 places in 21 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1874 place count 2410 transition count 2910
Performed 969 Post agglomeration using F-continuation condition.Transition count delta: 969
Deduced a syphon composed of 969 places in 7 ms
Reduce places removed 969 places and 0 transitions.
Iterating global reduction 3 with 1938 rules applied. Total rules applied 3812 place count 1441 transition count 1941
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 4010 place count 1441 transition count 1941
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4011 place count 1440 transition count 1940
Applied a total of 4011 rules in 1053 ms. Remains 1440 /3347 variables (removed 1907) and now considering 1940/3847 (removed 1907) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 1440/3347 places, 1940/3847 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) 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 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1940 rows 1440 cols
[2023-03-20 09:02:31] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 09:02:31] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 09:02:32] [INFO ] [Nat]Absence check using 401 positive place invariants in 59 ms returned sat
[2023-03-20 09:02:33] [INFO ] After 1172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2199 ms
[2023-03-20 09:02:36] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 0 ms to minimize.
[2023-03-20 09:02:36] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 1 ms to minimize.
[2023-03-20 09:02:36] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 1 ms to minimize.
[2023-03-20 09:02:37] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:02:37] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2023-03-20 09:02:38] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2023-03-20 09:02:38] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-20 09:02:38] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-20 09:02:39] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2023-03-20 09:02:39] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 2 ms to minimize.
[2023-03-20 09:02:39] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-20 09:02:39] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:02:40] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 0 ms to minimize.
[2023-03-20 09:02:40] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2023-03-20 09:02:40] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 14 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2023-03-20 09:02:42] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2023-03-20 09:02:42] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-20 09:02:42] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 0 ms to minimize.
[2023-03-20 09:02:43] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-20 09:02:43] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2023-03-20 09:02:43] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2023-03-20 09:02:43] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2023-03-20 09:02:44] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 2 ms to minimize.
[2023-03-20 09:02:44] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 15 ms to minimize.
[2023-03-20 09:02:44] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 0 ms to minimize.
[2023-03-20 09:02:45] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 0 ms to minimize.
[2023-03-20 09:02:45] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-20 09:02:45] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2023-03-20 09:02:46] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 0 ms to minimize.
[2023-03-20 09:02:46] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2023-03-20 09:02:46] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 0 ms to minimize.
[2023-03-20 09:02:47] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2023-03-20 09:02:47] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 0 ms to minimize.
[2023-03-20 09:02:47] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 0 ms to minimize.
[2023-03-20 09:02:48] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-20 09:02:48] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 0 ms to minimize.
[2023-03-20 09:02:48] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2023-03-20 09:02:48] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2023-03-20 09:02:49] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-20 09:02:49] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-20 09:02:49] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2023-03-20 09:02:49] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 0 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 0 ms to minimize.
[2023-03-20 09:02:51] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-20 09:02:51] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 1 ms to minimize.
[2023-03-20 09:02:51] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 2 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-20 09:02:53] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2023-03-20 09:02:53] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2023-03-20 09:02:53] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2023-03-20 09:02:54] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2023-03-20 09:02:54] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2023-03-20 09:02:54] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
[2023-03-20 09:02:55] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2023-03-20 09:02:55] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 0 ms to minimize.
[2023-03-20 09:02:55] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:02:55] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-20 09:02:56] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:02:56] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2023-03-20 09:02:57] [INFO ] Deduced a trap composed of 10 places in 283 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-20 09:02:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:02:57] [INFO ] After 25327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 433 ms.
Support contains 29 out of 1440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 1940/1940 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 1440 transition count 1935
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1435 transition count 1935
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 38 place count 1421 transition count 1921
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 1421 transition count 1921
Applied a total of 39 rules in 235 ms. Remains 1421 /1440 variables (removed 19) and now considering 1921/1940 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 1421/1440 places, 1921/1940 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1921 rows 1421 cols
[2023-03-20 09:02:58] [INFO ] Computed 401 place invariants in 12 ms
[2023-03-20 09:02:58] [INFO ] [Real]Absence check using 401 positive place invariants in 91 ms returned sat
[2023-03-20 09:02:59] [INFO ] After 1239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 09:03:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 65 ms returned sat
[2023-03-20 09:03:00] [INFO ] After 848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 988 ms
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 613 ms
[2023-03-20 09:03:03] [INFO ] After 2875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-20 09:03:03] [INFO ] After 3602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 12 out of 1421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1421/1421 places, 1921/1921 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 1421 transition count 1920
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1420 transition count 1920
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1420 transition count 1917
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1417 transition count 1917
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 1412 transition count 1912
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 1411 transition count 1911
Applied a total of 19 rules in 238 ms. Remains 1411 /1421 variables (removed 10) and now considering 1911/1921 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 1411/1421 places, 1911/1921 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 85761 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85761 steps, saw 49946 distinct states, run finished after 3011 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1911 rows 1411 cols
[2023-03-20 09:03:07] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 09:03:07] [INFO ] [Real]Absence check using 401 positive place invariants in 67 ms returned sat
[2023-03-20 09:03:08] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 09:03:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 60 ms returned sat
[2023-03-20 09:03:09] [INFO ] After 911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 09:03:09] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 514 ms
[2023-03-20 09:03:10] [INFO ] After 1863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 318 ms.
[2023-03-20 09:03:11] [INFO ] After 2505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 136 ms.
Support contains 12 out of 1411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1411/1411 places, 1911/1911 transitions.
Applied a total of 0 rules in 78 ms. Remains 1411 /1411 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1411/1411 places, 1911/1911 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1411/1411 places, 1911/1911 transitions.
Applied a total of 0 rules in 82 ms. Remains 1411 /1411 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
[2023-03-20 09:03:11] [INFO ] Invariant cache hit.
[2023-03-20 09:03:12] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2023-03-20 09:03:12] [INFO ] Invariant cache hit.
[2023-03-20 09:03:13] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2605 ms to find 0 implicit places.
[2023-03-20 09:03:14] [INFO ] Redundant transitions in 396 ms returned []
[2023-03-20 09:03:14] [INFO ] Invariant cache hit.
[2023-03-20 09:03:15] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3963 ms. Remains : 1411/1411 places, 1911/1911 transitions.
Applied a total of 0 rules in 66 ms. Remains 1411 /1411 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 09:03:15] [INFO ] Invariant cache hit.
[2023-03-20 09:03:15] [INFO ] [Real]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:03:16] [INFO ] After 1185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 09:03:16] [INFO ] [Nat]Absence check using 401 positive place invariants in 65 ms returned sat
[2023-03-20 09:03:17] [INFO ] After 898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 09:03:17] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-20 09:03:17] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-03-20 09:03:18] [INFO ] After 2127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 252 ms.
[2023-03-20 09:03:19] [INFO ] After 2678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 09:03:19] [INFO ] Flatten gal took : 129 ms
[2023-03-20 09:03:19] [INFO ] Flatten gal took : 118 ms
[2023-03-20 09:03:19] [INFO ] Input system was already deterministic with 3847 transitions.
Computed a total of 831 stabilizing places and 831 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3310 transition count 3810
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3310 transition count 3810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 3309 transition count 3809
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 3309 transition count 3809
Applied a total of 76 rules in 459 ms. Remains 3309 /3347 variables (removed 38) and now considering 3809/3847 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 3309/3347 places, 3809/3847 transitions.
[2023-03-20 09:03:20] [INFO ] Flatten gal took : 148 ms
[2023-03-20 09:03:20] [INFO ] Flatten gal took : 124 ms
[2023-03-20 09:03:21] [INFO ] Input system was already deterministic with 3809 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 3309 transition count 3809
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 3309 transition count 3809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 3308 transition count 3808
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 3308 transition count 3808
Applied a total of 78 rules in 469 ms. Remains 3308 /3347 variables (removed 39) and now considering 3808/3847 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 3308/3347 places, 3808/3847 transitions.
[2023-03-20 09:03:21] [INFO ] Flatten gal took : 98 ms
[2023-03-20 09:03:21] [INFO ] Flatten gal took : 114 ms
[2023-03-20 09:03:22] [INFO ] Input system was already deterministic with 3808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 3306 transition count 3806
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 3305 transition count 3805
Applied a total of 84 rules in 456 ms. Remains 3305 /3347 variables (removed 42) and now considering 3805/3847 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 3305/3347 places, 3805/3847 transitions.
[2023-03-20 09:03:22] [INFO ] Flatten gal took : 87 ms
[2023-03-20 09:03:22] [INFO ] Flatten gal took : 118 ms
[2023-03-20 09:03:23] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 3307 transition count 3807
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 3307 transition count 3807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 3306 transition count 3806
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 3306 transition count 3806
Applied a total of 82 rules in 583 ms. Remains 3306 /3347 variables (removed 41) and now considering 3806/3847 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 3306/3347 places, 3806/3847 transitions.
[2023-03-20 09:03:23] [INFO ] Flatten gal took : 90 ms
[2023-03-20 09:03:24] [INFO ] Flatten gal took : 103 ms
[2023-03-20 09:03:24] [INFO ] Input system was already deterministic with 3806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 3306 transition count 3806
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 3305 transition count 3805
Applied a total of 84 rules in 467 ms. Remains 3305 /3347 variables (removed 42) and now considering 3805/3847 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 3305/3347 places, 3805/3847 transitions.
[2023-03-20 09:03:24] [INFO ] Flatten gal took : 83 ms
[2023-03-20 09:03:24] [INFO ] Flatten gal took : 143 ms
[2023-03-20 09:03:25] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3303 transition count 3803
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3303 transition count 3803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3302 transition count 3802
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3302 transition count 3802
Applied a total of 90 rules in 464 ms. Remains 3302 /3347 variables (removed 45) and now considering 3802/3847 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 3302/3347 places, 3802/3847 transitions.
[2023-03-20 09:03:25] [INFO ] Flatten gal took : 92 ms
[2023-03-20 09:03:25] [INFO ] Flatten gal took : 98 ms
[2023-03-20 09:03:26] [INFO ] Input system was already deterministic with 3802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 3306 transition count 3806
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 3305 transition count 3805
Applied a total of 84 rules in 443 ms. Remains 3305 /3347 variables (removed 42) and now considering 3805/3847 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 3305/3347 places, 3805/3847 transitions.
[2023-03-20 09:03:26] [INFO ] Flatten gal took : 101 ms
[2023-03-20 09:03:26] [INFO ] Flatten gal took : 114 ms
[2023-03-20 09:03:27] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 3306 transition count 3806
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 3305 transition count 3805
Applied a total of 84 rules in 440 ms. Remains 3305 /3347 variables (removed 42) and now considering 3805/3847 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 3305/3347 places, 3805/3847 transitions.
[2023-03-20 09:03:27] [INFO ] Flatten gal took : 84 ms
[2023-03-20 09:03:27] [INFO ] Flatten gal took : 104 ms
[2023-03-20 09:03:28] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3310 transition count 3810
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3310 transition count 3810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 3309 transition count 3809
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 3309 transition count 3809
Applied a total of 76 rules in 491 ms. Remains 3309 /3347 variables (removed 38) and now considering 3809/3847 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 3309/3347 places, 3809/3847 transitions.
[2023-03-20 09:03:28] [INFO ] Flatten gal took : 92 ms
[2023-03-20 09:03:28] [INFO ] Flatten gal took : 100 ms
[2023-03-20 09:03:28] [INFO ] Input system was already deterministic with 3809 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3346 transition count 3445
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2945 transition count 3445
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 802 place count 2945 transition count 2945
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1802 place count 2445 transition count 2945
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 1846 place count 2401 transition count 2901
Iterating global reduction 2 with 44 rules applied. Total rules applied 1890 place count 2401 transition count 2901
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 1890 place count 2401 transition count 2878
Deduced a syphon composed of 23 places in 8 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 1936 place count 2378 transition count 2878
Performed 973 Post agglomeration using F-continuation condition.Transition count delta: 973
Deduced a syphon composed of 973 places in 8 ms
Reduce places removed 973 places and 0 transitions.
Iterating global reduction 2 with 1946 rules applied. Total rules applied 3882 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3884 place count 1403 transition count 1903
Applied a total of 3884 rules in 801 ms. Remains 1403 /3347 variables (removed 1944) and now considering 1903/3847 (removed 1944) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 801 ms. Remains : 1403/3347 places, 1903/3847 transitions.
[2023-03-20 09:03:29] [INFO ] Flatten gal took : 190 ms
[2023-03-20 09:03:30] [INFO ] Flatten gal took : 107 ms
[2023-03-20 09:03:30] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3346 transition count 3445
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2945 transition count 3445
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 802 place count 2945 transition count 2946
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1800 place count 2446 transition count 2946
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1843 place count 2403 transition count 2903
Iterating global reduction 2 with 43 rules applied. Total rules applied 1886 place count 2403 transition count 2903
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 1886 place count 2403 transition count 2880
Deduced a syphon composed of 23 places in 20 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 1932 place count 2380 transition count 2880
Performed 974 Post agglomeration using F-continuation condition.Transition count delta: 974
Deduced a syphon composed of 974 places in 6 ms
Reduce places removed 974 places and 0 transitions.
Iterating global reduction 2 with 1948 rules applied. Total rules applied 3880 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3882 place count 1404 transition count 1904
Applied a total of 3882 rules in 960 ms. Remains 1404 /3347 variables (removed 1943) and now considering 1904/3847 (removed 1943) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 972 ms. Remains : 1404/3347 places, 1904/3847 transitions.
[2023-03-20 09:03:31] [INFO ] Flatten gal took : 50 ms
[2023-03-20 09:03:31] [INFO ] Flatten gal took : 55 ms
[2023-03-20 09:03:31] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3303 transition count 3803
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3303 transition count 3803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3302 transition count 3802
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3302 transition count 3802
Applied a total of 90 rules in 472 ms. Remains 3302 /3347 variables (removed 45) and now considering 3802/3847 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 3302/3347 places, 3802/3847 transitions.
[2023-03-20 09:03:32] [INFO ] Flatten gal took : 83 ms
[2023-03-20 09:03:32] [INFO ] Flatten gal took : 85 ms
[2023-03-20 09:03:32] [INFO ] Input system was already deterministic with 3802 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 396 place count 3346 transition count 3450
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 792 place count 2950 transition count 3450
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 792 place count 2950 transition count 2953
Deduced a syphon composed of 497 places in 10 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1786 place count 2453 transition count 2953
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1826 place count 2413 transition count 2913
Iterating global reduction 2 with 40 rules applied. Total rules applied 1866 place count 2413 transition count 2913
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1866 place count 2413 transition count 2893
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1906 place count 2393 transition count 2893
Performed 974 Post agglomeration using F-continuation condition.Transition count delta: 974
Deduced a syphon composed of 974 places in 5 ms
Reduce places removed 974 places and 0 transitions.
Iterating global reduction 2 with 1948 rules applied. Total rules applied 3854 place count 1419 transition count 1919
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3856 place count 1417 transition count 1917
Applied a total of 3856 rules in 695 ms. Remains 1417 /3347 variables (removed 1930) and now considering 1917/3847 (removed 1930) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 696 ms. Remains : 1417/3347 places, 1917/3847 transitions.
[2023-03-20 09:03:33] [INFO ] Flatten gal took : 47 ms
[2023-03-20 09:03:33] [INFO ] Flatten gal took : 51 ms
[2023-03-20 09:03:33] [INFO ] Input system was already deterministic with 1917 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 3304 transition count 3804
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 3304 transition count 3804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 3303 transition count 3803
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 3303 transition count 3803
Applied a total of 88 rules in 424 ms. Remains 3303 /3347 variables (removed 44) and now considering 3803/3847 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 3303/3347 places, 3803/3847 transitions.
[2023-03-20 09:03:33] [INFO ] Flatten gal took : 96 ms
[2023-03-20 09:03:33] [INFO ] Flatten gal took : 109 ms
[2023-03-20 09:03:34] [INFO ] Input system was already deterministic with 3803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 3346 transition count 3448
Reduce places removed 398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 399 rules applied. Total rules applied 797 place count 2948 transition count 3447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 798 place count 2947 transition count 3447
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 798 place count 2947 transition count 2948
Deduced a syphon composed of 499 places in 12 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1796 place count 2448 transition count 2948
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1840 place count 2404 transition count 2904
Iterating global reduction 3 with 44 rules applied. Total rules applied 1884 place count 2404 transition count 2904
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1884 place count 2404 transition count 2881
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1930 place count 2381 transition count 2881
Performed 973 Post agglomeration using F-continuation condition.Transition count delta: 973
Deduced a syphon composed of 973 places in 5 ms
Reduce places removed 973 places and 0 transitions.
Iterating global reduction 3 with 1946 rules applied. Total rules applied 3876 place count 1408 transition count 1908
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 3878 place count 1406 transition count 1906
Applied a total of 3878 rules in 701 ms. Remains 1406 /3347 variables (removed 1941) and now considering 1906/3847 (removed 1941) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 701 ms. Remains : 1406/3347 places, 1906/3847 transitions.
[2023-03-20 09:03:35] [INFO ] Flatten gal took : 51 ms
[2023-03-20 09:03:35] [INFO ] Flatten gal took : 54 ms
[2023-03-20 09:03:35] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3347/3347 places, 3847/3847 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 3305 transition count 3805
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 3305 transition count 3805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 3304 transition count 3804
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 3304 transition count 3804
Applied a total of 86 rules in 644 ms. Remains 3304 /3347 variables (removed 43) and now considering 3804/3847 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 3304/3347 places, 3804/3847 transitions.
[2023-03-20 09:03:35] [INFO ] Flatten gal took : 113 ms
[2023-03-20 09:03:36] [INFO ] Flatten gal took : 107 ms
[2023-03-20 09:03:36] [INFO ] Input system was already deterministic with 3804 transitions.
[2023-03-20 09:03:36] [INFO ] Flatten gal took : 99 ms
[2023-03-20 09:03:36] [INFO ] Flatten gal took : 104 ms
[2023-03-20 09:03:36] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 09:03:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3347 places, 3847 transitions and 13088 arcs took 20 ms.
Total runtime 111099 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/943/ctl_0_ --ctl=/tmp/943/ctl_1_ --ctl=/tmp/943/ctl_2_ --ctl=/tmp/943/ctl_3_ --ctl=/tmp/943/ctl_4_ --ctl=/tmp/943/ctl_5_ --ctl=/tmp/943/ctl_6_ --ctl=/tmp/943/ctl_7_ --ctl=/tmp/943/ctl_8_ --ctl=/tmp/943/ctl_9_ --ctl=/tmp/943/ctl_10_ --ctl=/tmp/943/ctl_11_ --ctl=/tmp/943/ctl_12_ --ctl=/tmp/943/ctl_13_ --ctl=/tmp/943/ctl_14_ --ctl=/tmp/943/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13672932 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16096444 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="ShieldRVs-PT-100B"
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 ShieldRVs-PT-100B, 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 r425-tajo-167905977800170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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