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.r394-oct2-167903717600174.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 marciexred
Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679497483386

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:04:46] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-03-22 15:04:46] [INFO ] Transformed 6003 places.
[2023-03-22 15:04:46] [INFO ] Transformed 5903 transitions.
[2023-03-22 15:04:46] [INFO ] Found NUPN structural information;
[2023-03-22 15:04:46] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 723 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 14) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-22 15:04:48] [INFO ] Computed 901 place invariants in 55 ms
[2023-03-22 15:04:51] [INFO ] After 2534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 15:04:54] [INFO ] [Nat]Absence check using 901 positive place invariants in 1269 ms returned sat
[2023-03-22 15:05:16] [INFO ] After 20422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 15:05:16] [INFO ] After 20441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 15:05:16] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 535 ms.
Support contains 148 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 6003 transition count 5436
Reduce places removed 467 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 480 rules applied. Total rules applied 947 place count 5536 transition count 5423
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 960 place count 5523 transition count 5423
Performed 489 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 489 Pre rules applied. Total rules applied 960 place count 5523 transition count 4934
Deduced a syphon composed of 489 places in 28 ms
Reduce places removed 489 places and 0 transitions.
Iterating global reduction 3 with 978 rules applied. Total rules applied 1938 place count 5034 transition count 4934
Discarding 663 places :
Symmetric choice reduction at 3 with 663 rule applications. Total rules 2601 place count 4371 transition count 4271
Iterating global reduction 3 with 663 rules applied. Total rules applied 3264 place count 4371 transition count 4271
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 3264 place count 4371 transition count 4000
Deduced a syphon composed of 271 places in 23 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 3806 place count 4100 transition count 4000
Performed 1421 Post agglomeration using F-continuation condition.Transition count delta: 1421
Deduced a syphon composed of 1421 places in 46 ms
Reduce places removed 1421 places and 0 transitions.
Iterating global reduction 3 with 2842 rules applied. Total rules applied 6648 place count 2679 transition count 2579
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 669 times.
Drop transitions removed 669 transitions
Iterating global reduction 3 with 669 rules applied. Total rules applied 7317 place count 2679 transition count 2579
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7318 place count 2678 transition count 2578
Applied a total of 7318 rules in 2565 ms. Remains 2678 /6003 variables (removed 3325) and now considering 2578/5903 (removed 3325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2567 ms. Remains : 2678/6003 places, 2578/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 9) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2578 rows 2678 cols
[2023-03-22 15:05:20] [INFO ] Computed 901 place invariants in 127 ms
[2023-03-22 15:05:21] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 15:05:22] [INFO ] [Nat]Absence check using 895 positive place invariants in 347 ms returned sat
[2023-03-22 15:05:22] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 15:05:28] [INFO ] After 5629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 15:05:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 15:05:31] [INFO ] After 2915ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 15:05:32] [INFO ] Deduced a trap composed of 8 places in 678 ms of which 10 ms to minimize.
[2023-03-22 15:05:33] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 1 ms to minimize.
[2023-03-22 15:05:34] [INFO ] Deduced a trap composed of 9 places in 625 ms of which 14 ms to minimize.
[2023-03-22 15:05:35] [INFO ] Deduced a trap composed of 7 places in 635 ms of which 2 ms to minimize.
[2023-03-22 15:05:35] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 2 ms to minimize.
[2023-03-22 15:05:36] [INFO ] Deduced a trap composed of 15 places in 494 ms of which 1 ms to minimize.
[2023-03-22 15:05:36] [INFO ] Deduced a trap composed of 7 places in 415 ms of which 1 ms to minimize.
[2023-03-22 15:05:37] [INFO ] Deduced a trap composed of 7 places in 393 ms of which 1 ms to minimize.
[2023-03-22 15:05:38] [INFO ] Deduced a trap composed of 12 places in 432 ms of which 1 ms to minimize.
[2023-03-22 15:05:38] [INFO ] Deduced a trap composed of 21 places in 485 ms of which 1 ms to minimize.
[2023-03-22 15:05:39] [INFO ] Deduced a trap composed of 17 places in 674 ms of which 1 ms to minimize.
[2023-03-22 15:05:40] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 1 ms to minimize.
[2023-03-22 15:05:40] [INFO ] Deduced a trap composed of 21 places in 466 ms of which 1 ms to minimize.
[2023-03-22 15:05:41] [INFO ] Deduced a trap composed of 9 places in 445 ms of which 1 ms to minimize.
[2023-03-22 15:05:42] [INFO ] Deduced a trap composed of 7 places in 532 ms of which 7 ms to minimize.
[2023-03-22 15:05:42] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 1 ms to minimize.
[2023-03-22 15:05:42] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-22 15:05:43] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-22 15:05:44] [INFO ] Deduced a trap composed of 8 places in 459 ms of which 13 ms to minimize.
[2023-03-22 15:05:44] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2023-03-22 15:05:45] [INFO ] Deduced a trap composed of 19 places in 797 ms of which 1 ms to minimize.
[2023-03-22 15:05:46] [INFO ] Deduced a trap composed of 15 places in 701 ms of which 21 ms to minimize.
[2023-03-22 15:05:46] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 14238 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 15:05:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:05:46] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1373 ms.
Support contains 143 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 2578/2578 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2678 transition count 2577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2677 transition count 2577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 2671 transition count 2571
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 2671 transition count 2571
Applied a total of 15 rules in 325 ms. Remains 2671 /2678 variables (removed 7) and now considering 2571/2578 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 2671/2678 places, 2571/2578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 39830 steps, run timeout after 3010 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39830 steps, saw 37504 distinct states, run finished after 3014 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2671 cols
[2023-03-22 15:05:52] [INFO ] Computed 901 place invariants in 40 ms
[2023-03-22 15:05:53] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 15:05:54] [INFO ] [Nat]Absence check using 895 positive place invariants in 207 ms returned sat
[2023-03-22 15:05:54] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 15:05:59] [INFO ] After 5218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 15:05:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 15:06:02] [INFO ] After 2988ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 15:06:03] [INFO ] Deduced a trap composed of 7 places in 450 ms of which 2 ms to minimize.
[2023-03-22 15:06:04] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 1 ms to minimize.
[2023-03-22 15:06:04] [INFO ] Deduced a trap composed of 13 places in 459 ms of which 1 ms to minimize.
[2023-03-22 15:06:05] [INFO ] Deduced a trap composed of 11 places in 607 ms of which 1 ms to minimize.
[2023-03-22 15:06:06] [INFO ] Deduced a trap composed of 7 places in 541 ms of which 1 ms to minimize.
[2023-03-22 15:06:06] [INFO ] Deduced a trap composed of 8 places in 428 ms of which 1 ms to minimize.
[2023-03-22 15:06:07] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-22 15:06:07] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 1 ms to minimize.
[2023-03-22 15:06:08] [INFO ] Deduced a trap composed of 8 places in 886 ms of which 1 ms to minimize.
[2023-03-22 15:06:09] [INFO ] Deduced a trap composed of 8 places in 1026 ms of which 1 ms to minimize.
[2023-03-22 15:06:10] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 1 ms to minimize.
[2023-03-22 15:06:10] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 18 ms to minimize.
[2023-03-22 15:06:11] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 2 ms to minimize.
[2023-03-22 15:06:11] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 0 ms to minimize.
[2023-03-22 15:06:12] [INFO ] Deduced a trap composed of 18 places in 343 ms of which 3 ms to minimize.
[2023-03-22 15:06:13] [INFO ] Deduced a trap composed of 15 places in 547 ms of which 14 ms to minimize.
[2023-03-22 15:06:14] [INFO ] Deduced a trap composed of 21 places in 989 ms of which 2 ms to minimize.
[2023-03-22 15:06:14] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 20 ms to minimize.
[2023-03-22 15:06:15] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 1 ms to minimize.
[2023-03-22 15:06:15] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 1 ms to minimize.
[2023-03-22 15:06:16] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 14 ms to minimize.
[2023-03-22 15:06:17] [INFO ] Deduced a trap composed of 7 places in 1140 ms of which 1 ms to minimize.
[2023-03-22 15:06:18] [INFO ] Deduced a trap composed of 21 places in 543 ms of which 2 ms to minimize.
[2023-03-22 15:06:21] [INFO ] Deduced a trap composed of 3 places in 3244 ms of which 21 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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 15:06:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:06:21] [INFO ] After 28257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1114 ms.
Support contains 143 out of 2671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 106 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2671/2671 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 89 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-22 15:06:22] [INFO ] Invariant cache hit.
[2023-03-22 15:06:25] [INFO ] Implicit Places using invariants in 2933 ms returned [2656]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2939 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2670/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 88 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3118 ms. Remains : 2670/2671 places, 2571/2571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 7) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2571 rows 2670 cols
[2023-03-22 15:06:27] [INFO ] Computed 900 place invariants in 23 ms
[2023-03-22 15:06:28] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:06:30] [INFO ] [Nat]Absence check using 894 positive place invariants in 1403 ms returned sat
[2023-03-22 15:06:30] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 15:06:36] [INFO ] After 5753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 15:06:37] [INFO ] Deduced a trap composed of 7 places in 1017 ms of which 3 ms to minimize.
[2023-03-22 15:06:38] [INFO ] Deduced a trap composed of 11 places in 658 ms of which 2 ms to minimize.
[2023-03-22 15:06:39] [INFO ] Deduced a trap composed of 9 places in 801 ms of which 1 ms to minimize.
[2023-03-22 15:06:40] [INFO ] Deduced a trap composed of 7 places in 720 ms of which 2 ms to minimize.
[2023-03-22 15:06:41] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 1 ms to minimize.
[2023-03-22 15:06:42] [INFO ] Deduced a trap composed of 13 places in 648 ms of which 1 ms to minimize.
[2023-03-22 15:06:43] [INFO ] Deduced a trap composed of 11 places in 1140 ms of which 1 ms to minimize.
[2023-03-22 15:06:44] [INFO ] Deduced a trap composed of 9 places in 732 ms of which 2 ms to minimize.
[2023-03-22 15:06:45] [INFO ] Deduced a trap composed of 4 places in 840 ms of which 1 ms to minimize.
[2023-03-22 15:06:46] [INFO ] Deduced a trap composed of 6 places in 806 ms of which 1 ms to minimize.
[2023-03-22 15:06:47] [INFO ] Deduced a trap composed of 10 places in 902 ms of which 2 ms to minimize.
[2023-03-22 15:06:47] [INFO ] Deduced a trap composed of 14 places in 819 ms of which 1 ms to minimize.
[2023-03-22 15:06:48] [INFO ] Deduced a trap composed of 8 places in 704 ms of which 1 ms to minimize.
[2023-03-22 15:06:49] [INFO ] Deduced a trap composed of 19 places in 494 ms of which 1 ms to minimize.
[2023-03-22 15:06:49] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 0 ms to minimize.
[2023-03-22 15:06:50] [INFO ] Deduced a trap composed of 12 places in 754 ms of which 2 ms to minimize.
[2023-03-22 15:06:51] [INFO ] Deduced a trap composed of 12 places in 911 ms of which 2 ms to minimize.
[2023-03-22 15:06:52] [INFO ] Deduced a trap composed of 10 places in 450 ms of which 13 ms to minimize.
[2023-03-22 15:06:53] [INFO ] Deduced a trap composed of 11 places in 1210 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 15:06:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:06:53] [INFO ] After 25594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 870 ms.
Support contains 141 out of 2670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2670 transition count 2570
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2669 transition count 2570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2668 transition count 2569
Applied a total of 4 rules in 282 ms. Remains 2668 /2670 variables (removed 2) and now considering 2569/2571 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 2668/2670 places, 2569/2571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 60961 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60961 steps, saw 57272 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2569 rows 2668 cols
[2023-03-22 15:06:59] [INFO ] Computed 900 place invariants in 31 ms
[2023-03-22 15:07:00] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:07:01] [INFO ] [Nat]Absence check using 894 positive place invariants in 380 ms returned sat
[2023-03-22 15:07:01] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-22 15:07:05] [INFO ] After 3651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 15:07:06] [INFO ] Deduced a trap composed of 9 places in 544 ms of which 1 ms to minimize.
[2023-03-22 15:07:07] [INFO ] Deduced a trap composed of 10 places in 584 ms of which 41 ms to minimize.
[2023-03-22 15:07:07] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 4 ms to minimize.
[2023-03-22 15:07:08] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 4 ms to minimize.
[2023-03-22 15:07:08] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 1 ms to minimize.
[2023-03-22 15:07:09] [INFO ] Deduced a trap composed of 9 places in 442 ms of which 1 ms to minimize.
[2023-03-22 15:07:10] [INFO ] Deduced a trap composed of 9 places in 416 ms of which 1 ms to minimize.
[2023-03-22 15:07:10] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2023-03-22 15:07:11] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 1 ms to minimize.
[2023-03-22 15:07:11] [INFO ] Deduced a trap composed of 11 places in 691 ms of which 0 ms to minimize.
[2023-03-22 15:07:14] [INFO ] Deduced a trap composed of 7 places in 2515 ms of which 1 ms to minimize.
[2023-03-22 15:07:15] [INFO ] Deduced a trap composed of 8 places in 360 ms of which 1 ms to minimize.
[2023-03-22 15:07:15] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 0 ms to minimize.
[2023-03-22 15:07:16] [INFO ] Deduced a trap composed of 11 places in 418 ms of which 1 ms to minimize.
[2023-03-22 15:07:16] [INFO ] Deduced a trap composed of 14 places in 356 ms of which 2 ms to minimize.
[2023-03-22 15:07:17] [INFO ] Deduced a trap composed of 13 places in 619 ms of which 1 ms to minimize.
[2023-03-22 15:07:17] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2023-03-22 15:07:18] [INFO ] Deduced a trap composed of 10 places in 380 ms of which 1 ms to minimize.
[2023-03-22 15:07:19] [INFO ] Deduced a trap composed of 12 places in 816 ms of which 27 ms to minimize.
[2023-03-22 15:07:20] [INFO ] Deduced a trap composed of 9 places in 643 ms of which 2 ms to minimize.
[2023-03-22 15:07:20] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2023-03-22 15:07:21] [INFO ] Deduced a trap composed of 11 places in 770 ms of which 1 ms to minimize.
[2023-03-22 15:07:22] [INFO ] Deduced a trap composed of 8 places in 395 ms of which 1 ms to minimize.
[2023-03-22 15:07:22] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 1 ms to minimize.
[2023-03-22 15:07:23] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 0 ms to minimize.
[2023-03-22 15:07:23] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 1 ms to minimize.
[2023-03-22 15:07:24] [INFO ] Deduced a trap composed of 10 places in 520 ms of which 13 ms to minimize.
[2023-03-22 15:07:24] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 1 ms to minimize.
[2023-03-22 15:07:25] [INFO ] Deduced a trap composed of 26 places in 361 ms of which 1 ms to minimize.
[2023-03-22 15:07:25] [INFO ] Deduced a trap composed of 28 places in 463 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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 15:07:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:07:25] [INFO ] After 25487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 819 ms.
Support contains 141 out of 2668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2668/2668 places, 2569/2569 transitions.
Applied a total of 0 rules in 87 ms. Remains 2668 /2668 variables (removed 0) and now considering 2569/2569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2668/2668 places, 2569/2569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2668/2668 places, 2569/2569 transitions.
Applied a total of 0 rules in 130 ms. Remains 2668 /2668 variables (removed 0) and now considering 2569/2569 (removed 0) transitions.
[2023-03-22 15:07:26] [INFO ] Invariant cache hit.
[2023-03-22 15:07:28] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2023-03-22 15:07:28] [INFO ] Invariant cache hit.
[2023-03-22 15:07:35] [INFO ] Implicit Places using invariants and state equation in 6933 ms returned []
Implicit Place search using SMT with State Equation took 8782 ms to find 0 implicit places.
[2023-03-22 15:07:35] [INFO ] Redundant transitions in 258 ms returned []
[2023-03-22 15:07:35] [INFO ] Invariant cache hit.
[2023-03-22 15:07:38] [INFO ] Dead Transitions using invariants and state equation in 3045 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12233 ms. Remains : 2668/2668 places, 2569/2569 transitions.
Applied a total of 0 rules in 108 ms. Remains 2668 /2668 variables (removed 0) and now considering 2569/2569 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-22 15:07:39] [INFO ] Invariant cache hit.
[2023-03-22 15:07:39] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:07:40] [INFO ] [Nat]Absence check using 894 positive place invariants in 293 ms returned sat
[2023-03-22 15:07:40] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 15 ms returned sat
[2023-03-22 15:07:45] [INFO ] After 4688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 15:07:46] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 1 ms to minimize.
[2023-03-22 15:07:47] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 0 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 0 ms to minimize.
[2023-03-22 15:07:49] [INFO ] Deduced a trap composed of 7 places in 442 ms of which 3 ms to minimize.
[2023-03-22 15:07:49] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2023-03-22 15:07:50] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-22 15:07:50] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 0 ms to minimize.
[2023-03-22 15:07:50] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 0 ms to minimize.
[2023-03-22 15:07:51] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2023-03-22 15:07:52] [INFO ] Deduced a trap composed of 11 places in 733 ms of which 1 ms to minimize.
[2023-03-22 15:07:52] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-22 15:07:53] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 2 ms to minimize.
[2023-03-22 15:07:53] [INFO ] Deduced a trap composed of 13 places in 685 ms of which 2 ms to minimize.
[2023-03-22 15:07:54] [INFO ] Deduced a trap composed of 19 places in 650 ms of which 27 ms to minimize.
[2023-03-22 15:07:55] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 0 ms to minimize.
[2023-03-22 15:07:55] [INFO ] Deduced a trap composed of 9 places in 580 ms of which 1 ms to minimize.
[2023-03-22 15:07:56] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 0 ms to minimize.
[2023-03-22 15:07:56] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 0 ms to minimize.
[2023-03-22 15:07:57] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 0 ms to minimize.
[2023-03-22 15:07:57] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 0 ms to minimize.
[2023-03-22 15:07:58] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2023-03-22 15:07:58] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 0 ms to minimize.
[2023-03-22 15:07:59] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 0 ms to minimize.
[2023-03-22 15:07:59] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 1 ms to minimize.
[2023-03-22 15:07:59] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2023-03-22 15:08:00] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 0 ms to minimize.
[2023-03-22 15:08:00] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 0 ms to minimize.
[2023-03-22 15:08:00] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 0 ms to minimize.
[2023-03-22 15:08:01] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 0 ms to minimize.
[2023-03-22 15:08:01] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 14966 ms
[2023-03-22 15:08:01] [INFO ] Deduced a trap composed of 6 places in 407 ms of which 1 ms to minimize.
[2023-03-22 15:08:02] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-22 15:08:02] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2023-03-22 15:08:03] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 0 ms to minimize.
[2023-03-22 15:08:03] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 2 ms to minimize.
[2023-03-22 15:08:04] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 1 ms to minimize.
[2023-03-22 15:08:04] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-22 15:08:04] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 1 ms to minimize.
[2023-03-22 15:08:05] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 0 ms to minimize.
[2023-03-22 15:08:05] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 1 ms to minimize.
[2023-03-22 15:08:06] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 1 ms to minimize.
[2023-03-22 15:08:06] [INFO ] Deduced a trap composed of 16 places in 378 ms of which 5 ms to minimize.
[2023-03-22 15:08:07] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 1 ms to minimize.
[2023-03-22 15:08:07] [INFO ] Deduced a trap composed of 18 places in 404 ms of which 1 ms to minimize.
[2023-03-22 15:08:08] [INFO ] Deduced a trap composed of 30 places in 519 ms of which 0 ms to minimize.
[2023-03-22 15:08:09] [INFO ] Deduced a trap composed of 21 places in 555 ms of which 1 ms to minimize.
[2023-03-22 15:08:09] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 42 ms to minimize.
[2023-03-22 15:08:09] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2023-03-22 15:08:12] [INFO ] Deduced a trap composed of 6 places in 2467 ms of which 3 ms to minimize.
[2023-03-22 15:08:12] [INFO ] Deduced a trap composed of 22 places in 338 ms of which 1 ms to minimize.
[2023-03-22 15:08:13] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2023-03-22 15:08:13] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 1 ms to minimize.
[2023-03-22 15:08:14] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 1 ms to minimize.
[2023-03-22 15:08:14] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 0 ms to minimize.
[2023-03-22 15:08:14] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 1 ms to minimize.
[2023-03-22 15:08:15] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 1 ms to minimize.
[2023-03-22 15:08:15] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 1 ms to minimize.
[2023-03-22 15:08:16] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 1 ms to minimize.
[2023-03-22 15:08:17] [INFO ] Deduced a trap composed of 19 places in 654 ms of which 2 ms to minimize.
[2023-03-22 15:08:17] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 0 ms to minimize.
[2023-03-22 15:08:17] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2023-03-22 15:08:18] [INFO ] Deduced a trap composed of 45 places in 297 ms of which 0 ms to minimize.
[2023-03-22 15:08:19] [INFO ] Deduced a trap composed of 19 places in 1092 ms of which 1 ms to minimize.
[2023-03-22 15:08:19] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-22 15:08:20] [INFO ] Deduced a trap composed of 21 places in 485 ms of which 1 ms to minimize.
[2023-03-22 15:08:20] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 18950 ms
[2023-03-22 15:08:21] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 1 ms to minimize.
[2023-03-22 15:08:22] [INFO ] Deduced a trap composed of 9 places in 469 ms of which 1 ms to minimize.
[2023-03-22 15:08:23] [INFO ] Deduced a trap composed of 8 places in 383 ms of which 1 ms to minimize.
[2023-03-22 15:08:23] [INFO ] Deduced a trap composed of 9 places in 471 ms of which 1 ms to minimize.
[2023-03-22 15:08:24] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 1 ms to minimize.
[2023-03-22 15:08:25] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2023-03-22 15:08:25] [INFO ] Deduced a trap composed of 10 places in 405 ms of which 0 ms to minimize.
[2023-03-22 15:08:26] [INFO ] Deduced a trap composed of 11 places in 452 ms of which 0 ms to minimize.
[2023-03-22 15:08:26] [INFO ] Deduced a trap composed of 10 places in 377 ms of which 2 ms to minimize.
[2023-03-22 15:08:27] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-22 15:08:27] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 3 ms to minimize.
[2023-03-22 15:08:28] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 1 ms to minimize.
[2023-03-22 15:08:28] [INFO ] Deduced a trap composed of 12 places in 409 ms of which 0 ms to minimize.
[2023-03-22 15:08:29] [INFO ] Deduced a trap composed of 22 places in 516 ms of which 0 ms to minimize.
[2023-03-22 15:08:30] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 1 ms to minimize.
[2023-03-22 15:08:30] [INFO ] Deduced a trap composed of 8 places in 447 ms of which 1 ms to minimize.
[2023-03-22 15:08:31] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 1 ms to minimize.
[2023-03-22 15:08:31] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
[2023-03-22 15:08:32] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 0 ms to minimize.
[2023-03-22 15:08:32] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2023-03-22 15:08:33] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 2 ms to minimize.
[2023-03-22 15:08:33] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 1 ms to minimize.
[2023-03-22 15:08:34] [INFO ] Deduced a trap composed of 18 places in 388 ms of which 1 ms to minimize.
[2023-03-22 15:08:34] [INFO ] Deduced a trap composed of 19 places in 619 ms of which 1 ms to minimize.
[2023-03-22 15:08:35] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
[2023-03-22 15:08:36] [INFO ] Deduced a trap composed of 26 places in 613 ms of which 1 ms to minimize.
[2023-03-22 15:08:36] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 13 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 0 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 1 ms to minimize.
[2023-03-22 15:08:38] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 0 ms to minimize.
[2023-03-22 15:08:38] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2023-03-22 15:08:39] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 1 ms to minimize.
[2023-03-22 15:08:39] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2023-03-22 15:08:39] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 18119 ms
[2023-03-22 15:08:41] [INFO ] Deduced a trap composed of 4 places in 1061 ms of which 15 ms to minimize.
[2023-03-22 15:08:42] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 1 ms to minimize.
[2023-03-22 15:08:43] [INFO ] Deduced a trap composed of 12 places in 645 ms of which 1 ms to minimize.
[2023-03-22 15:08:43] [INFO ] Deduced a trap composed of 12 places in 455 ms of which 0 ms to minimize.
[2023-03-22 15:08:44] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2023-03-22 15:08:44] [INFO ] Deduced a trap composed of 8 places in 345 ms of which 0 ms to minimize.
[2023-03-22 15:08:45] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 1 ms to minimize.
[2023-03-22 15:08:45] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2023-03-22 15:08:46] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-22 15:08:47] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 1 ms to minimize.
[2023-03-22 15:08:47] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 0 ms to minimize.
[2023-03-22 15:08:47] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2023-03-22 15:08:48] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 0 ms to minimize.
[2023-03-22 15:08:48] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2023-03-22 15:08:49] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 2 ms to minimize.
[2023-03-22 15:08:49] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 1 ms to minimize.
[2023-03-22 15:08:50] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 0 ms to minimize.
[2023-03-22 15:08:50] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 1 ms to minimize.
[2023-03-22 15:08:51] [INFO ] Deduced a trap composed of 14 places in 352 ms of which 1 ms to minimize.
[2023-03-22 15:08:52] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2023-03-22 15:08:52] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-22 15:08:53] [INFO ] Deduced a trap composed of 12 places in 403 ms of which 0 ms to minimize.
[2023-03-22 15:08:53] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2023-03-22 15:08:53] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2023-03-22 15:08:54] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2023-03-22 15:08:54] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2023-03-22 15:08:55] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 1 ms to minimize.
[2023-03-22 15:08:55] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 1 ms to minimize.
[2023-03-22 15:08:55] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 0 ms to minimize.
[2023-03-22 15:08:56] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 0 ms to minimize.
[2023-03-22 15:08:56] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 0 ms to minimize.
[2023-03-22 15:08:56] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 0 ms to minimize.
[2023-03-22 15:08:57] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 1 ms to minimize.
[2023-03-22 15:08:57] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 16987 ms
[2023-03-22 15:08:58] [INFO ] Deduced a trap composed of 8 places in 325 ms of which 1 ms to minimize.
[2023-03-22 15:08:58] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2023-03-22 15:08:59] [INFO ] Deduced a trap composed of 13 places in 495 ms of which 1 ms to minimize.
[2023-03-22 15:08:59] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 1 ms to minimize.
[2023-03-22 15:09:00] [INFO ] Deduced a trap composed of 19 places in 445 ms of which 19 ms to minimize.
[2023-03-22 15:09:00] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 1 ms to minimize.
[2023-03-22 15:09:01] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 0 ms to minimize.
[2023-03-22 15:09:01] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2023-03-22 15:09:01] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 0 ms to minimize.
[2023-03-22 15:09:02] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2023-03-22 15:09:03] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 1 ms to minimize.
[2023-03-22 15:09:03] [INFO ] Deduced a trap composed of 18 places in 366 ms of which 1 ms to minimize.
[2023-03-22 15:09:04] [INFO ] Deduced a trap composed of 29 places in 704 ms of which 0 ms to minimize.
[2023-03-22 15:09:05] [INFO ] Deduced a trap composed of 12 places in 669 ms of which 0 ms to minimize.
[2023-03-22 15:09:05] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 0 ms to minimize.
[2023-03-22 15:09:06] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 1 ms to minimize.
[2023-03-22 15:09:06] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 1 ms to minimize.
[2023-03-22 15:09:07] [INFO ] Deduced a trap composed of 22 places in 542 ms of which 1 ms to minimize.
[2023-03-22 15:09:07] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 9783 ms
[2023-03-22 15:09:08] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2023-03-22 15:09:08] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 14 ms to minimize.
[2023-03-22 15:09:09] [INFO ] Deduced a trap composed of 7 places in 469 ms of which 1 ms to minimize.
[2023-03-22 15:09:10] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 3 ms to minimize.
[2023-03-22 15:09:10] [INFO ] Deduced a trap composed of 15 places in 341 ms of which 0 ms to minimize.
[2023-03-22 15:09:11] [INFO ] Deduced a trap composed of 12 places in 519 ms of which 1 ms to minimize.
[2023-03-22 15:09:11] [INFO ] Deduced a trap composed of 15 places in 483 ms of which 1 ms to minimize.
[2023-03-22 15:09:12] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 0 ms to minimize.
[2023-03-22 15:09:12] [INFO ] Deduced a trap composed of 16 places in 479 ms of which 1 ms to minimize.
[2023-03-22 15:09:13] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 16 ms to minimize.
[2023-03-22 15:09:13] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2023-03-22 15:09:14] [INFO ] Deduced a trap composed of 18 places in 574 ms of which 3 ms to minimize.
[2023-03-22 15:09:15] [INFO ] Deduced a trap composed of 17 places in 348 ms of which 1 ms to minimize.
[2023-03-22 15:09:15] [INFO ] Deduced a trap composed of 14 places in 341 ms of which 1 ms to minimize.
[2023-03-22 15:09:16] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 0 ms to minimize.
[2023-03-22 15:09:16] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 0 ms to minimize.
[2023-03-22 15:09:17] [INFO ] Deduced a trap composed of 20 places in 373 ms of which 1 ms to minimize.
[2023-03-22 15:09:17] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 0 ms to minimize.
[2023-03-22 15:09:17] [INFO ] Deduced a trap composed of 30 places in 399 ms of which 0 ms to minimize.
[2023-03-22 15:09:18] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 1 ms to minimize.
[2023-03-22 15:09:18] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 10647 ms
[2023-03-22 15:09:18] [INFO ] After 97409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3213 ms.
[2023-03-22 15:09:21] [INFO ] After 101954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 15:09:21] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 17 ms.
[2023-03-22 15:09:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2668 places, 2569 transitions and 12522 arcs took 12 ms.
[2023-03-22 15:09:22] [INFO ] Flatten gal took : 322 ms
Total runtime 276349 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_100B
(NrP: 2668 NrTr: 2569 NrArc: 12522)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.792sec

net check time: 0m 0.002sec

init dd package: 0m 3.139sec


before gc: list nodes free: 1601479

after gc: idd nodes used:97717, unused:63902283; list nodes free:263788159

before gc: list nodes free: 1135946

after gc: idd nodes used:133658, unused:63866342; list nodes free:263623053

before gc: list nodes free: 1631262

after gc: idd nodes used:294204, unused:63705796; list nodes free:264966526

before gc: list nodes free: 1645380

after gc: idd nodes used:436784, unused:63563216; list nodes free:274821111

before gc: list nodes free: 1816214

after gc: idd nodes used:587675, unused:63412325; list nodes free:274125805

before gc: list nodes free: 870658

after gc: idd nodes used:825504, unused:63174496; list nodes free:275141279

before gc: list nodes free: 11280616

after gc: idd nodes used:784317, unused:63215683; list nodes free:275335097

before gc: list nodes free: 10609765

after gc: idd nodes used:930430, unused:63069570; list nodes free:274669104

before gc: list nodes free: 9826610

after gc: idd nodes used:938895, unused:63061105; list nodes free:274629995

before gc: list nodes free: 12548123

after gc: idd nodes used:976363, unused:63023637; list nodes free:274459763

before gc: list nodes free: 11061793

after gc: idd nodes used:1307640, unused:62692360; list nodes free:272893824
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6277084 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16092964 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.052sec

109967 133695 121320 131898 135144 455184 510834 628386 796049 705451 861799 911620 930691 956195 978835 988324 1196878

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="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717600174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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