Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400039.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 20:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 20:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M May 18 16:42 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 CANConstruction-PT-070-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2023-13
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716219549079

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-20 15:39:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-20 15:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:39:11] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2024-05-20 15:39:11] [INFO ] Transformed 10642 places.
[2024-05-20 15:39:11] [INFO ] Transformed 20160 transitions.
[2024-05-20 15:39:11] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 20160 rows 10642 cols
[2024-05-20 15:39:12] [INFO ] Computed 141 invariants in 298 ms
[2024-05-20 15:39:16] [INFO ] After 3263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-20 15:39:19] [INFO ] [Nat]Absence check using 71 positive place invariants in 216 ms returned sat
[2024-05-20 15:39:19] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 77 ms returned sat
[2024-05-20 15:39:41] [INFO ] After 20373ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2024-05-20 15:39:41] [INFO ] State equation strengthened by 9730 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 15:39:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 15:39:41] [INFO ] After 25232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 202 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 466 transitions
Trivial Post-agglo rules discarded 466 transitions
Performed 466 trivial Post agglomeration. Transition count delta: 466
Iterating post reduction 0 with 466 rules applied. Total rules applied 466 place count 10642 transition count 19694
Reduce places removed 466 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 471 rules applied. Total rules applied 937 place count 10176 transition count 19689
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 942 place count 10171 transition count 19689
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 942 place count 10171 transition count 19681
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 958 place count 10163 transition count 19681
Discarding 4680 places :
Symmetric choice reduction at 3 with 4680 rule applications. Total rules 5638 place count 5483 transition count 10321
Iterating global reduction 3 with 4680 rules applied. Total rules applied 10318 place count 5483 transition count 10321
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 6 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 10440 place count 5422 transition count 10260
Free-agglomeration rule applied 43 times.
Iterating global reduction 3 with 43 rules applied. Total rules applied 10483 place count 5422 transition count 10217
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 10526 place count 5379 transition count 10217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 10529 place count 5379 transition count 10214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 10532 place count 5376 transition count 10214
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 5 with 102 rules applied. Total rules applied 10634 place count 5376 transition count 10214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 10638 place count 5376 transition count 10214
Applied a total of 10638 rules in 9205 ms. Remains 5376 /10642 variables (removed 5266) and now considering 10214/20160 (removed 9946) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9207 ms. Remains : 5376/10642 places, 10214/20160 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 13) seen :5
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10214 rows 5376 cols
[2024-05-20 15:39:51] [INFO ] Computed 141 invariants in 82 ms
[2024-05-20 15:39:52] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 15:39:53] [INFO ] [Nat]Absence check using 71 positive place invariants in 125 ms returned sat
[2024-05-20 15:39:53] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2024-05-20 15:40:00] [INFO ] After 6626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 15:40:00] [INFO ] State equation strengthened by 9832 read => feed constraints.
[2024-05-20 15:40:07] [INFO ] After 6664ms SMT Verify possible using 9832 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-20 15:40:13] [INFO ] After 12159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3746 ms.
[2024-05-20 15:40:16] [INFO ] After 24314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 112 ms.
Support contains 148 out of 5376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5376/5376 places, 10214/10214 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 5376 transition count 10213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5375 transition count 10213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 5373 transition count 10209
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5373 transition count 10209
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 52 place count 5350 transition count 10186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 5348 transition count 10186
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 5348 transition count 10186
Applied a total of 58 rules in 5379 ms. Remains 5348 /5376 variables (removed 28) and now considering 10186/10214 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5380 ms. Remains : 5348/5376 places, 10186/10214 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 8) seen :3
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10186 rows 5348 cols
[2024-05-20 15:40:22] [INFO ] Computed 141 invariants in 68 ms
[2024-05-20 15:40:23] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 15:40:24] [INFO ] [Nat]Absence check using 71 positive place invariants in 106 ms returned sat
[2024-05-20 15:40:24] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 57 ms returned sat
[2024-05-20 15:40:31] [INFO ] After 5908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 15:40:31] [INFO ] State equation strengthened by 9861 read => feed constraints.
[2024-05-20 15:40:35] [INFO ] After 4397ms SMT Verify possible using 9861 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 15:40:39] [INFO ] After 8152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2516 ms.
[2024-05-20 15:40:41] [INFO ] After 17947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 90 out of 5348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5348/5348 places, 10186/10186 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 0 with 2 rules applied. Total rules applied 2 place count 5348 transition count 10184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5346 transition count 10184
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 5342 transition count 10176
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 5342 transition count 10176
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 54 place count 5321 transition count 10155
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 5318 transition count 10156
Applied a total of 60 rules in 4248 ms. Remains 5318 /5348 variables (removed 30) and now considering 10156/10186 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4248 ms. Remains : 5318/5348 places, 10156/10186 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 5) seen :1
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10156 rows 5318 cols
[2024-05-20 15:40:46] [INFO ] Computed 141 invariants in 75 ms
[2024-05-20 15:40:47] [INFO ] After 864ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 15:40:48] [INFO ] [Nat]Absence check using 71 positive place invariants in 113 ms returned sat
[2024-05-20 15:40:48] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 73 ms returned sat
[2024-05-20 15:40:55] [INFO ] After 6544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 15:40:55] [INFO ] State equation strengthened by 9890 read => feed constraints.
[2024-05-20 15:40:59] [INFO ] After 4267ms SMT Verify possible using 9890 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 15:41:03] [INFO ] After 7531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2238 ms.
[2024-05-20 15:41:05] [INFO ] After 17633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 49 ms.
Support contains 87 out of 5318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5318/5318 places, 10156/10156 transitions.
Applied a total of 0 rules in 1107 ms. Remains 5318 /5318 variables (removed 0) and now considering 10156/10156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1108 ms. Remains : 5318/5318 places, 10156/10156 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 70681 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70681 steps, saw 60236 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 15:41:09] [INFO ] Invariant cache hit.
[2024-05-20 15:41:10] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 15:41:11] [INFO ] [Nat]Absence check using 71 positive place invariants in 106 ms returned sat
[2024-05-20 15:41:11] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 70 ms returned sat
[2024-05-20 15:41:18] [INFO ] After 6021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 15:41:18] [INFO ] State equation strengthened by 9890 read => feed constraints.
[2024-05-20 15:41:22] [INFO ] After 4272ms SMT Verify possible using 9890 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 15:41:25] [INFO ] After 7372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1689 ms.
[2024-05-20 15:41:27] [INFO ] After 16375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 30 ms.
Support contains 87 out of 5318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5318/5318 places, 10156/10156 transitions.
Applied a total of 0 rules in 1073 ms. Remains 5318 /5318 variables (removed 0) and now considering 10156/10156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 5318/5318 places, 10156/10156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5318/5318 places, 10156/10156 transitions.
Applied a total of 0 rules in 1087 ms. Remains 5318 /5318 variables (removed 0) and now considering 10156/10156 (removed 0) transitions.
[2024-05-20 15:41:29] [INFO ] Invariant cache hit.
[2024-05-20 15:41:33] [INFO ] Implicit Places using invariants in 4076 ms returned []
Implicit Place search using SMT only with invariants took 4081 ms to find 0 implicit places.
[2024-05-20 15:41:33] [INFO ] Invariant cache hit.
[2024-05-20 15:41:39] [INFO ] Dead Transitions using invariants and state equation in 6144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11319 ms. Remains : 5318/5318 places, 10156/10156 transitions.
Graph (trivial) has 9622 edges and 5318 vertex of which 4641 / 5318 are part of one of the 66 SCC in 14 ms
Free SCC test removed 4575 places
Drop transitions removed 9051 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9060 transitions.
Graph (complete) has 1567 edges and 743 vertex of which 524 are kept as prefixes of interest. Removing 219 places using SCC suffix rule.2 ms
Discarding 219 places :
Also discarding 89 output transitions
Drop transitions removed 89 transitions
Drop transitions removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 351 rules applied. Total rules applied 353 place count 524 transition count 656
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 484 rules applied. Total rules applied 837 place count 320 transition count 376
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 2 with 145 rules applied. Total rules applied 982 place count 241 transition count 310
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 982 place count 241 transition count 300
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1002 place count 231 transition count 300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1006 place count 227 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 1010 place count 227 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1011 place count 227 transition count 295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1011 place count 227 transition count 293
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1015 place count 225 transition count 293
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 4 with 2 rules applied. Total rules applied 1017 place count 224 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1023 place count 221 transition count 295
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1026 place count 221 transition count 292
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1027 place count 220 transition count 292
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1028 place count 219 transition count 291
Iterating global reduction 5 with 1 rules applied. Total rules applied 1029 place count 219 transition count 291
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1049 place count 219 transition count 271
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1070 place count 199 transition count 270
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 1099 place count 199 transition count 270
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1122 place count 176 transition count 247
Iterating global reduction 6 with 23 rules applied. Total rules applied 1145 place count 176 transition count 247
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 1166 place count 155 transition count 226
Applied a total of 1166 rules in 126 ms. Remains 155 /5318 variables (removed 5163) and now considering 226/10156 (removed 9930) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 226 rows 155 cols
[2024-05-20 15:41:39] [INFO ] Computed 25 invariants in 0 ms
[2024-05-20 15:41:39] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 15:41:39] [INFO ] [Nat]Absence check using 24 positive place invariants in 3 ms returned sat
[2024-05-20 15:41:39] [INFO ] [Nat]Absence check using 24 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 15:41:39] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 15:41:40] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-20 15:41:40] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-20 15:41:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-20 15:41:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5318 places, 10156 transitions and 40541 arcs took 50 ms.
[2024-05-20 15:41:40] [INFO ] Flatten gal took : 496 ms
Total runtime 150337 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-070
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-070-ReachabilityCardinality-2023-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716219728898

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-ReachabilityCardinality-2024-04: AG 0 0 0 0 1 0 0 0
CANConstruction-PT-070-ReachabilityCardinality-2024-08: AG 0 0 0 0 1 0 0 0
CANConstruction-PT-070-ReachabilityCardinality-2024-09: EF 0 0 0 0 1 0 0 0
CANConstruction-PT-070-ReachabilityCardinality-2023-13: AG 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 23 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 4
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type EXCL) for 6 CANConstruction-PT-070-ReachabilityCardinality-2024-09
lola: time limit : 893 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 6 CANConstruction-PT-070-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 6 CANConstruction-PT-070-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 6 CANConstruction-PT-070-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 12 (type FNDP) for CANConstruction-PT-070-ReachabilityCardinality-2024-09
lola: result : true
lola: fired transitions : 27
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for CANConstruction-PT-070-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 15 (type SRCH) for CANConstruction-PT-070-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 16 (type EXCL) for CANConstruction-PT-070-ReachabilityCardinality-2024-09 (obsolete)
lola: LAUNCH task # 30 (type EXCL) for 3 CANConstruction-PT-070-ReachabilityCardinality-2024-08
lola: time limit : 1191 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 9 CANConstruction-PT-070-ReachabilityCardinality-2023-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 9 CANConstruction-PT-070-ReachabilityCardinality-2023-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 22 (type SRCH) for 9 CANConstruction-PT-070-ReachabilityCardinality-2023-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 22 (type SRCH) for CANConstruction-PT-070-ReachabilityCardinality-2023-13
lola: result : true
lola: markings : 75
lola: fired transitions : 90
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for CANConstruction-PT-070-ReachabilityCardinality-2023-13 (obsolete)
lola: CANCELED task # 20 (type EQUN) for CANConstruction-PT-070-ReachabilityCardinality-2023-13 (obsolete)
lola: LAUNCH task # 33 (type FNDP) for 0 CANConstruction-PT-070-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 0 CANConstruction-PT-070-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 0 CANConstruction-PT-070-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 19 (type FNDP) for CANConstruction-PT-070-ReachabilityCardinality-2023-13
lola: result : true
lola: fired transitions : 122
lola: tried executions : 4
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-13.sara.
lola: FINISHED task # 36 (type SRCH) for CANConstruction-PT-070-ReachabilityCardinality-2024-04
lola: result : true
lola: markings : 32
lola: fired transitions : 32
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for CANConstruction-PT-070-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 34 (type EQUN) for CANConstruction-PT-070-ReachabilityCardinality-2024-04 (obsolete)
lola: LAUNCH task # 26 (type FNDP) for 3 CANConstruction-PT-070-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type EQUN) for 3 CANConstruction-PT-070-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type SRCH) for 3 CANConstruction-PT-070-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 33 (type FNDP) for CANConstruction-PT-070-ReachabilityCardinality-2024-04
lola: result : true
lola: fired transitions : 33
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 29 (type SRCH) for CANConstruction-PT-070-ReachabilityCardinality-2024-08
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 26 (type FNDP) for CANConstruction-PT-070-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 27 (type EQUN) for CANConstruction-PT-070-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 30 (type EXCL) for CANConstruction-PT-070-ReachabilityCardinality-2024-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-070-ReachabilityCardinality-2024-04: AG false tandem / insertion
CANConstruction-PT-070-ReachabilityCardinality-2024-08: AG false tandem / insertion
CANConstruction-PT-070-ReachabilityCardinality-2024-09: EF true findpath
CANConstruction-PT-070-ReachabilityCardinality-2023-13: AG false tandem / insertion


Time elapsed: 27 secs. Pages in use: 3

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="CANConstruction-PT-070"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-070, 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 r087-tall-171620521400039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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