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

About the Execution of LTSMin+red for AutonomousCar-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3187.180 3600000.00 14204448.00 61.80 ????????FF?????? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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 AutonomousCar-PT-10b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678642488618

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:34:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:34:52] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2023-03-12 17:34:52] [INFO ] Transformed 425 places.
[2023-03-12 17:34:52] [INFO ] Transformed 2252 transitions.
[2023-03-12 17:34:52] [INFO ] Found NUPN structural information;
[2023-03-12 17:34:52] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 104 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 389 transition count 2216
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 389 transition count 2216
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 472 place count 389 transition count 1816
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 477 place count 384 transition count 1811
Iterating global reduction 1 with 5 rules applied. Total rules applied 482 place count 384 transition count 1811
Applied a total of 482 rules in 180 ms. Remains 384 /425 variables (removed 41) and now considering 1811/2252 (removed 441) transitions.
// Phase 1: matrix 1811 rows 384 cols
[2023-03-12 17:34:52] [INFO ] Computed 15 place invariants in 57 ms
[2023-03-12 17:34:54] [INFO ] Implicit Places using invariants in 1351 ms returned []
[2023-03-12 17:34:54] [INFO ] Invariant cache hit.
[2023-03-12 17:34:56] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
[2023-03-12 17:34:56] [INFO ] Invariant cache hit.
[2023-03-12 17:34:57] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/425 places, 1811/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4453 ms. Remains : 384/425 places, 1811/2252 transitions.
Support contains 104 out of 384 places after structural reductions.
[2023-03-12 17:34:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 17:34:57] [INFO ] Flatten gal took : 436 ms
FORMULA AutonomousCar-PT-10b-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:34:58] [INFO ] Flatten gal took : 224 ms
[2023-03-12 17:34:58] [INFO ] Input system was already deterministic with 1811 transitions.
Support contains 89 out of 384 places (down from 104) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 56) seen :43
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
[2023-03-12 17:34:59] [INFO ] Invariant cache hit.
[2023-03-12 17:34:59] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 17:35:00] [INFO ] After 667ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-12 17:35:02] [INFO ] Deduced a trap composed of 5 places in 1292 ms of which 5 ms to minimize.
[2023-03-12 17:35:03] [INFO ] Deduced a trap composed of 10 places in 987 ms of which 11 ms to minimize.
[2023-03-12 17:35:04] [INFO ] Deduced a trap composed of 33 places in 988 ms of which 20 ms to minimize.
[2023-03-12 17:35:05] [INFO ] Deduced a trap composed of 34 places in 1056 ms of which 2 ms to minimize.
[2023-03-12 17:35:07] [INFO ] Deduced a trap composed of 35 places in 2102 ms of which 12 ms to minimize.
[2023-03-12 17:35:08] [INFO ] Deduced a trap composed of 33 places in 768 ms of which 1 ms to minimize.
[2023-03-12 17:35:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7637 ms
[2023-03-12 17:35:08] [INFO ] After 8372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 17:35:08] [INFO ] After 8545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 17:35:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2023-03-12 17:35:10] [INFO ] After 1745ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-12 17:35:11] [INFO ] Deduced a trap composed of 33 places in 1326 ms of which 0 ms to minimize.
[2023-03-12 17:35:13] [INFO ] Deduced a trap composed of 32 places in 1344 ms of which 15 ms to minimize.
[2023-03-12 17:35:15] [INFO ] Deduced a trap composed of 16 places in 2169 ms of which 0 ms to minimize.
[2023-03-12 17:35:16] [INFO ] Deduced a trap composed of 34 places in 942 ms of which 0 ms to minimize.
[2023-03-12 17:35:17] [INFO ] Deduced a trap composed of 34 places in 1134 ms of which 0 ms to minimize.
[2023-03-12 17:35:18] [INFO ] Deduced a trap composed of 34 places in 1154 ms of which 0 ms to minimize.
[2023-03-12 17:35:19] [INFO ] Deduced a trap composed of 35 places in 1026 ms of which 1 ms to minimize.
[2023-03-12 17:35:21] [INFO ] Deduced a trap composed of 34 places in 1276 ms of which 1 ms to minimize.
[2023-03-12 17:35:22] [INFO ] Deduced a trap composed of 35 places in 1061 ms of which 22 ms to minimize.
[2023-03-12 17:35:23] [INFO ] Deduced a trap composed of 34 places in 751 ms of which 2 ms to minimize.
[2023-03-12 17:35:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 12744 ms
[2023-03-12 17:35:24] [INFO ] Deduced a trap composed of 26 places in 951 ms of which 1 ms to minimize.
[2023-03-12 17:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1089 ms
[2023-03-12 17:35:25] [INFO ] Deduced a trap composed of 33 places in 934 ms of which 1 ms to minimize.
[2023-03-12 17:35:26] [INFO ] Deduced a trap composed of 50 places in 803 ms of which 1 ms to minimize.
[2023-03-12 17:35:27] [INFO ] Deduced a trap composed of 49 places in 814 ms of which 1 ms to minimize.
[2023-03-12 17:35:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 2696 ms
[2023-03-12 17:35:28] [INFO ] Deduced a trap composed of 23 places in 1327 ms of which 0 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 57 places in 787 ms of which 19 ms to minimize.
[2023-03-12 17:35:30] [INFO ] Deduced a trap composed of 45 places in 1048 ms of which 0 ms to minimize.
[2023-03-12 17:35:31] [INFO ] Deduced a trap composed of 15 places in 958 ms of which 0 ms to minimize.
[2023-03-12 17:35:32] [INFO ] Deduced a trap composed of 51 places in 632 ms of which 1 ms to minimize.
[2023-03-12 17:35:33] [INFO ] Deduced a trap composed of 54 places in 919 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-12 17:35:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 17:35:33] [INFO ] After 25247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 18 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Graph (trivial) has 338 edges and 384 vertex of which 4 / 384 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1899 edges and 382 vertex of which 380 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 380 transition count 1670
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 172 rules applied. Total rules applied 311 place count 244 transition count 1634
Reduce places removed 20 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 25 rules applied. Total rules applied 336 place count 224 transition count 1629
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 341 place count 219 transition count 1629
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 341 place count 219 transition count 1615
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 369 place count 205 transition count 1615
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 380 place count 194 transition count 1604
Iterating global reduction 4 with 11 rules applied. Total rules applied 391 place count 194 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 392 place count 193 transition count 1594
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 193 transition count 1594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 395 place count 193 transition count 1592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 396 place count 192 transition count 1592
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 534 place count 123 transition count 1523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 535 place count 123 transition count 1522
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 550 place count 108 transition count 1364
Iterating global reduction 7 with 15 rules applied. Total rules applied 565 place count 108 transition count 1364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 571 place count 108 transition count 1358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 573 place count 107 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 575 place count 106 transition count 1357
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 577 place count 106 transition count 1355
Free-agglomeration rule applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 592 place count 106 transition count 1340
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 607 place count 91 transition count 1340
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 613 place count 91 transition count 1334
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 614 place count 91 transition count 1334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 615 place count 90 transition count 1333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 616 place count 89 transition count 1333
Applied a total of 616 rules in 1043 ms. Remains 89 /384 variables (removed 295) and now considering 1333/1811 (removed 478) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 89/384 places, 1333/1811 transitions.
Incomplete random walk after 10000 steps, including 394 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1333 rows 89 cols
[2023-03-12 17:35:35] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-12 17:35:35] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:35:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 17:35:35] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:35:35] [INFO ] After 123ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:35:36] [INFO ] Deduced a trap composed of 5 places in 654 ms of which 14 ms to minimize.
[2023-03-12 17:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
[2023-03-12 17:35:36] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 17:35:36] [INFO ] After 1447ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1333/1333 transitions.
Graph (complete) has 1057 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 88 transition count 1325
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 82 transition count 1325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 82 transition count 1323
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 80 transition count 1323
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 78 transition count 1311
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 78 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 77 transition count 1309
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 77 transition count 1309
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 72 transition count 1304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 72 transition count 1303
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 72 transition count 1301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 70 transition count 1301
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 70 transition count 1301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 69 transition count 1300
Applied a total of 41 rules in 412 ms. Remains 69 /89 variables (removed 20) and now considering 1300/1333 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 69/89 places, 1300/1333 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 914306 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 914306 steps, saw 129957 distinct states, run finished after 3002 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1300 rows 69 cols
[2023-03-12 17:35:40] [INFO ] Computed 14 place invariants in 43 ms
[2023-03-12 17:35:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:35:40] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:35:40] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:40] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 17:35:40] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1300/1300 transitions.
Applied a total of 0 rules in 105 ms. Remains 69 /69 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 69/69 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1300/1300 transitions.
Applied a total of 0 rules in 97 ms. Remains 69 /69 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-12 17:35:41] [INFO ] Invariant cache hit.
[2023-03-12 17:35:41] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-12 17:35:41] [INFO ] Invariant cache hit.
[2023-03-12 17:35:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:35:43] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2067 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 1300/1300 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 1299
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 1299
Applied a total of 3 rules in 194 ms. Remains 66 /67 variables (removed 1) and now considering 1299/1300 (removed 1) transitions.
// Phase 1: matrix 1299 rows 66 cols
[2023-03-12 17:35:43] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:35:44] [INFO ] Implicit Places using invariants in 935 ms returned []
[2023-03-12 17:35:44] [INFO ] Invariant cache hit.
[2023-03-12 17:35:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:35:45] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/69 places, 1299/1300 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4568 ms. Remains : 66/69 places, 1299/1300 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 922611 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 922611 steps, saw 130829 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:35:48] [INFO ] Invariant cache hit.
[2023-03-12 17:35:48] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-12 17:35:49] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:35:49] [INFO ] After 44ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:49] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-12 17:35:49] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1299/1299 transitions.
Applied a total of 0 rules in 111 ms. Remains 66 /66 variables (removed 0) and now considering 1299/1299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 66/66 places, 1299/1299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1299/1299 transitions.
Applied a total of 0 rules in 65 ms. Remains 66 /66 variables (removed 0) and now considering 1299/1299 (removed 0) transitions.
[2023-03-12 17:35:49] [INFO ] Invariant cache hit.
[2023-03-12 17:35:50] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-12 17:35:50] [INFO ] Invariant cache hit.
[2023-03-12 17:35:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:35:52] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
[2023-03-12 17:35:52] [INFO ] Redundant transitions in 182 ms returned []
[2023-03-12 17:35:52] [INFO ] Invariant cache hit.
[2023-03-12 17:35:53] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3350 ms. Remains : 66/66 places, 1299/1299 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 1298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 66 transition count 1297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 65 transition count 1297
Applied a total of 3 rules in 81 ms. Remains 65 /66 variables (removed 1) and now considering 1297/1299 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1297 rows 65 cols
[2023-03-12 17:35:53] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 17:35:53] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 37 ms returned sat
[2023-03-12 17:35:53] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:53] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-12 17:35:53] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA AutonomousCar-PT-10b-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:35:54] [INFO ] Flatten gal took : 245 ms
[2023-03-12 17:35:54] [INFO ] Flatten gal took : 178 ms
[2023-03-12 17:35:54] [INFO ] Input system was already deterministic with 1811 transitions.
Computed a total of 65 stabilizing places and 66 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Graph (trivial) has 365 edges and 384 vertex of which 4 / 384 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 381 transition count 1649
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 214 rules applied. Total rules applied 374 place count 222 transition count 1594
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 406 place count 190 transition count 1594
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 406 place count 190 transition count 1588
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 418 place count 184 transition count 1588
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 433 place count 169 transition count 1573
Iterating global reduction 3 with 15 rules applied. Total rules applied 448 place count 169 transition count 1573
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 451 place count 166 transition count 1552
Iterating global reduction 3 with 3 rules applied. Total rules applied 454 place count 166 transition count 1552
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 458 place count 166 transition count 1548
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 460 place count 164 transition count 1548
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 578 place count 105 transition count 1489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 579 place count 105 transition count 1488
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 595 place count 89 transition count 1319
Iterating global reduction 6 with 16 rules applied. Total rules applied 611 place count 89 transition count 1319
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 14 rules applied. Total rules applied 625 place count 89 transition count 1305
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 632 place count 82 transition count 1305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 634 place count 81 transition count 1304
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 635 place count 81 transition count 1303
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 637 place count 79 transition count 1301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 638 place count 78 transition count 1301
Applied a total of 638 rules in 639 ms. Remains 78 /384 variables (removed 306) and now considering 1301/1811 (removed 510) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 639 ms. Remains : 78/384 places, 1301/1811 transitions.
[2023-03-12 17:35:55] [INFO ] Flatten gal took : 222 ms
[2023-03-12 17:35:55] [INFO ] Flatten gal took : 207 ms
[2023-03-12 17:35:56] [INFO ] Input system was already deterministic with 1301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 355 transition count 1782
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 355 transition count 1782
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 348 transition count 1775
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 348 transition count 1775
Applied a total of 72 rules in 48 ms. Remains 348 /384 variables (removed 36) and now considering 1775/1811 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 348/384 places, 1775/1811 transitions.
[2023-03-12 17:35:56] [INFO ] Flatten gal took : 155 ms
[2023-03-12 17:35:56] [INFO ] Flatten gal took : 172 ms
[2023-03-12 17:35:57] [INFO ] Input system was already deterministic with 1775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 360 transition count 1787
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 360 transition count 1787
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 355 transition count 1782
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 355 transition count 1782
Applied a total of 58 rules in 30 ms. Remains 355 /384 variables (removed 29) and now considering 1782/1811 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 355/384 places, 1782/1811 transitions.
[2023-03-12 17:35:57] [INFO ] Flatten gal took : 151 ms
[2023-03-12 17:35:57] [INFO ] Flatten gal took : 162 ms
[2023-03-12 17:35:57] [INFO ] Input system was already deterministic with 1782 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 359 transition count 1786
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 359 transition count 1786
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 354 transition count 1781
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 354 transition count 1781
Applied a total of 60 rules in 37 ms. Remains 354 /384 variables (removed 30) and now considering 1781/1811 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 354/384 places, 1781/1811 transitions.
[2023-03-12 17:35:58] [INFO ] Flatten gal took : 168 ms
[2023-03-12 17:35:58] [INFO ] Flatten gal took : 232 ms
[2023-03-12 17:35:58] [INFO ] Input system was already deterministic with 1781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 356 transition count 1783
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 356 transition count 1783
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 350 transition count 1777
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 350 transition count 1777
Applied a total of 68 rules in 31 ms. Remains 350 /384 variables (removed 34) and now considering 1777/1811 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 350/384 places, 1777/1811 transitions.
[2023-03-12 17:35:59] [INFO ] Flatten gal took : 177 ms
[2023-03-12 17:35:59] [INFO ] Flatten gal took : 179 ms
[2023-03-12 17:35:59] [INFO ] Input system was already deterministic with 1777 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Graph (trivial) has 366 edges and 384 vertex of which 4 / 384 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 381 transition count 1649
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 214 rules applied. Total rules applied 374 place count 222 transition count 1594
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 406 place count 190 transition count 1594
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 406 place count 190 transition count 1588
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 418 place count 184 transition count 1588
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 434 place count 168 transition count 1572
Iterating global reduction 3 with 16 rules applied. Total rules applied 450 place count 168 transition count 1572
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 454 place count 164 transition count 1541
Iterating global reduction 3 with 4 rules applied. Total rules applied 458 place count 164 transition count 1541
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 464 place count 164 transition count 1535
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 467 place count 161 transition count 1535
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 583 place count 103 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 103 transition count 1476
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 601 place count 86 transition count 1296
Iterating global reduction 6 with 17 rules applied. Total rules applied 618 place count 86 transition count 1296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 14 rules applied. Total rules applied 632 place count 86 transition count 1282
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 639 place count 79 transition count 1282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 641 place count 78 transition count 1281
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 642 place count 78 transition count 1280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 644 place count 76 transition count 1278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 645 place count 75 transition count 1278
Applied a total of 645 rules in 460 ms. Remains 75 /384 variables (removed 309) and now considering 1278/1811 (removed 533) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 461 ms. Remains : 75/384 places, 1278/1811 transitions.
[2023-03-12 17:36:00] [INFO ] Flatten gal took : 204 ms
[2023-03-12 17:36:00] [INFO ] Flatten gal took : 199 ms
[2023-03-12 17:36:00] [INFO ] Input system was already deterministic with 1278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 354 transition count 1781
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 354 transition count 1781
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 347 transition count 1774
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 347 transition count 1774
Applied a total of 74 rules in 32 ms. Remains 347 /384 variables (removed 37) and now considering 1774/1811 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 347/384 places, 1774/1811 transitions.
[2023-03-12 17:36:01] [INFO ] Flatten gal took : 176 ms
[2023-03-12 17:36:01] [INFO ] Flatten gal took : 161 ms
[2023-03-12 17:36:01] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Graph (trivial) has 363 edges and 384 vertex of which 4 / 384 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 381 transition count 1649
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 214 rules applied. Total rules applied 374 place count 222 transition count 1594
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 406 place count 190 transition count 1594
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 406 place count 190 transition count 1588
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 418 place count 184 transition count 1588
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 433 place count 169 transition count 1573
Iterating global reduction 3 with 15 rules applied. Total rules applied 448 place count 169 transition count 1573
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 452 place count 165 transition count 1542
Iterating global reduction 3 with 4 rules applied. Total rules applied 456 place count 165 transition count 1542
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 462 place count 165 transition count 1536
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 465 place count 162 transition count 1536
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 581 place count 104 transition count 1478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 582 place count 104 transition count 1477
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 597 place count 89 transition count 1319
Iterating global reduction 6 with 15 rules applied. Total rules applied 612 place count 89 transition count 1319
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 14 rules applied. Total rules applied 626 place count 89 transition count 1305
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 633 place count 82 transition count 1305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 635 place count 81 transition count 1304
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 81 transition count 1303
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 638 place count 79 transition count 1301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 639 place count 78 transition count 1301
Applied a total of 639 rules in 446 ms. Remains 78 /384 variables (removed 306) and now considering 1301/1811 (removed 510) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 446 ms. Remains : 78/384 places, 1301/1811 transitions.
[2023-03-12 17:36:02] [INFO ] Flatten gal took : 190 ms
[2023-03-12 17:36:02] [INFO ] Flatten gal took : 197 ms
[2023-03-12 17:36:03] [INFO ] Input system was already deterministic with 1301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 360 transition count 1787
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 360 transition count 1787
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 353 transition count 1780
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 353 transition count 1780
Applied a total of 62 rules in 31 ms. Remains 353 /384 variables (removed 31) and now considering 1780/1811 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 353/384 places, 1780/1811 transitions.
[2023-03-12 17:36:03] [INFO ] Flatten gal took : 211 ms
[2023-03-12 17:36:03] [INFO ] Flatten gal took : 165 ms
[2023-03-12 17:36:03] [INFO ] Input system was already deterministic with 1780 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 354 transition count 1781
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 354 transition count 1781
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 347 transition count 1774
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 347 transition count 1774
Applied a total of 74 rules in 27 ms. Remains 347 /384 variables (removed 37) and now considering 1774/1811 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 347/384 places, 1774/1811 transitions.
[2023-03-12 17:36:04] [INFO ] Flatten gal took : 140 ms
[2023-03-12 17:36:04] [INFO ] Flatten gal took : 146 ms
[2023-03-12 17:36:04] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 360 transition count 1787
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 360 transition count 1787
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 354 transition count 1781
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 354 transition count 1781
Applied a total of 60 rules in 33 ms. Remains 354 /384 variables (removed 30) and now considering 1781/1811 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 354/384 places, 1781/1811 transitions.
[2023-03-12 17:36:04] [INFO ] Flatten gal took : 161 ms
[2023-03-12 17:36:04] [INFO ] Flatten gal took : 172 ms
[2023-03-12 17:36:05] [INFO ] Input system was already deterministic with 1781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 355 transition count 1782
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 355 transition count 1782
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 348 transition count 1775
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 348 transition count 1775
Applied a total of 72 rules in 34 ms. Remains 348 /384 variables (removed 36) and now considering 1775/1811 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 348/384 places, 1775/1811 transitions.
[2023-03-12 17:36:05] [INFO ] Flatten gal took : 146 ms
[2023-03-12 17:36:05] [INFO ] Flatten gal took : 199 ms
[2023-03-12 17:36:05] [INFO ] Input system was already deterministic with 1775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 355 transition count 1782
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 355 transition count 1782
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 349 transition count 1776
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 349 transition count 1776
Applied a total of 70 rules in 28 ms. Remains 349 /384 variables (removed 35) and now considering 1776/1811 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 349/384 places, 1776/1811 transitions.
[2023-03-12 17:36:06] [INFO ] Flatten gal took : 218 ms
[2023-03-12 17:36:06] [INFO ] Flatten gal took : 144 ms
[2023-03-12 17:36:06] [INFO ] Input system was already deterministic with 1776 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1811/1811 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 355 transition count 1782
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 355 transition count 1782
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 349 transition count 1776
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 349 transition count 1776
Applied a total of 70 rules in 28 ms. Remains 349 /384 variables (removed 35) and now considering 1776/1811 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 349/384 places, 1776/1811 transitions.
[2023-03-12 17:36:06] [INFO ] Flatten gal took : 140 ms
[2023-03-12 17:36:06] [INFO ] Flatten gal took : 145 ms
[2023-03-12 17:36:07] [INFO ] Input system was already deterministic with 1776 transitions.
[2023-03-12 17:36:07] [INFO ] Flatten gal took : 162 ms
[2023-03-12 17:36:07] [INFO ] Flatten gal took : 181 ms
[2023-03-12 17:36:07] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 13 ms.
[2023-03-12 17:36:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 384 places, 1811 transitions and 26534 arcs took 16 ms.
Total runtime 75798 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/641/ctl_0_ --ctl=/tmp/641/ctl_1_ --ctl=/tmp/641/ctl_2_ --ctl=/tmp/641/ctl_3_ --ctl=/tmp/641/ctl_4_ --ctl=/tmp/641/ctl_5_ --ctl=/tmp/641/ctl_6_ --ctl=/tmp/641/ctl_7_ --ctl=/tmp/641/ctl_8_ --ctl=/tmp/641/ctl_9_ --ctl=/tmp/641/ctl_10_ --ctl=/tmp/641/ctl_11_ --ctl=/tmp/641/ctl_12_ --ctl=/tmp/641/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 14976836 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094836 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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="AutonomousCar-PT-10b"
export BK_EXAMINATION="CTLCardinality"
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 AutonomousCar-PT-10b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598200681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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