Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987939300625.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SimpleLoadBal-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939300625
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 3.6K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 20:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 24 05:38 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 SimpleLoadBal-PT-20-00
FORMULA_NAME SimpleLoadBal-PT-20-01
FORMULA_NAME SimpleLoadBal-PT-20-02
FORMULA_NAME SimpleLoadBal-PT-20-03
FORMULA_NAME SimpleLoadBal-PT-20-04
FORMULA_NAME SimpleLoadBal-PT-20-05
FORMULA_NAME SimpleLoadBal-PT-20-06
FORMULA_NAME SimpleLoadBal-PT-20-07
FORMULA_NAME SimpleLoadBal-PT-20-08
FORMULA_NAME SimpleLoadBal-PT-20-09
FORMULA_NAME SimpleLoadBal-PT-20-10
FORMULA_NAME SimpleLoadBal-PT-20-11
FORMULA_NAME SimpleLoadBal-PT-20-12
FORMULA_NAME SimpleLoadBal-PT-20-13
FORMULA_NAME SimpleLoadBal-PT-20-14
FORMULA_NAME SimpleLoadBal-PT-20-15

=== Now, execution of the tool begins

BK_START 1591255283417

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:21:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 07:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:21:25] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2020-06-04 07:21:25] [INFO ] Transformed 194 places.
[2020-06-04 07:21:25] [INFO ] Transformed 2205 transitions.
[2020-06-04 07:21:25] [INFO ] Parsed PT model containing 194 places and 2205 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 699 ms. (steps per millisecond=143 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1]
[2020-06-04 07:21:26] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2020-06-04 07:21:26] [INFO ] Invariants computation overflowed in 28 ms
[2020-06-04 07:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:26] [INFO ] [Real]Absence check using state equation in 189 ms returned unsat
[2020-06-04 07:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:27] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2020-06-04 07:21:27] [INFO ] State equation strengthened by 841 read => feed constraints.
[2020-06-04 07:21:28] [INFO ] [Real]Added 841 Read/Feed constraints in 269 ms returned sat
[2020-06-04 07:21:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:29] [INFO ] [Nat]Absence check using state equation in 1067 ms returned sat
[2020-06-04 07:21:29] [INFO ] [Nat]Added 841 Read/Feed constraints in 435 ms returned sat
[2020-06-04 07:21:30] [INFO ] Deduced a trap composed of 27 places in 575 ms
[2020-06-04 07:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 749 ms
[2020-06-04 07:21:31] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 846 ms.
[2020-06-04 07:21:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t347 0) (or (and (and (> t96 0) (< o96 o347)) (or (and (> t106 0) (< o106 o347)) (and (> t126 0) (< o126 o347)) (and (> t146 0) (< o146 o347)) (and (> t166 0) (< o166 o347)) (and (> t186 0) (< o186 o347)) (and (> t206 0) (< o206 o347)) (and (> t226 0) (< o226 o347)) (and (> t246 0) (< o246 o347)) (and (> t266 0) (< o266 o347)) (and (> t286 0) (< o286 o347)) (and (> t306 0) (< o306 o347)) (and (> t326 0) (< o326 o347)) (and (> t346 0) (< o346 o347)) (and (> t366 0) (< o366 o347)) (and (> t386 0) (< o386 o347)) (and (> t406 0) (< o406 o347)) (and (> t426 0) (< o426 o347)) (and (> t446 0) (< o446 o347)) (and (> t466 0) (< o466 o347)) (and (> t486 0) (< o486 o347)) (and (> t907 0) (< o907 o347)) (and (> t985 0) (< o985 o347)) (and (> t986 0) (< o986 o347)) (and (> t987 0) (< o987 o347)) (and (> t988 0) (< o988 o347)) (and (> t989 0) (< o989 o347)) (and (> t990 0) (< o990 o347)) (and (> t991 0) (< o991 o347)) (and (> t992 0) (< o992 o347)) (and (> t993 0) (< o993 o347)) (and (> t994 0) (< o994 o347)) (and (> t995 0) (< o995 o347)) (and (> t996 0) (< o996 o347)) (and (> t997 0) (< o997 o347)) (and (> t998 0) (< o998 o347)) (and (> t999 0) (< o999 o347)) (and (> t1000 0) (< o1000 o347)) (and (> t1001 0) (< o1001 o347)) (and (> t1002 0) (< o1002 o347)) (and (> t1003 0) (< o1003 o347)) (and (> t1004 0) (< o1004 o347)) (and (> t1365 0) (< o1365 o347)) (and (> t1366 0) (< o1366 o347)) (and (> t1367 0) (< o1367 o347)) (and (> t1368 0) (< o1368 o347)) (and (> t1369 0) (< o1369 o347)) (and (> t1370 0) (< o1370 o347)) (and (> t1371 0) (< o1371 o347)) (and (> t1372 0) (< o1372 o347)) (and (> t1373 0) (< o1373 o347)) (and (> t1374 0) (< o1374 o347)) (and (> t1375 0) (< o1375 o347)) (and (> t1376 0) (< o1376 o347)) (and (> t1377 0) (< o1377 o347)) (and (> t1378 0) (< o1378 o347)) (and (> t1379 0) (< o1379 o347)) (and (> t1380 0) (< o1380 o347)) (and (> t1381 0) (< o1381 o347)) (and (> t1382 0) (< o1382 o347)) (and (> t1383 0) (< o1383 o347)) (and (> t1384 0) (< o1384 o347)) (and (> t1708 0) (< o1708 o347))) (or (and (> t506 0) (< o506 o347)) (and (> t526 0) (< o526 o347)) (and (> t546 0) (< o546 o347)) (and (> t566 0) (< o566 o347)) (and (> t586 0) (< o586 o347)) (and (> t606 0) (< o606 o347)) (and (> t626 0) (< o626 o347)) (and (> t646 0) (< o646 o347)) (and (> t666 0) (< o666 o347)) (and (> t686 0) (< o686 o347)) (and (> t706 0) (< o706 o347)) (and (> t726 0) (< o726 o347)) (and (> t746 0) (< o746 o347)) (and (> t766 0) (< o766 o347)) (and (> t786 0) (< o786 o347)) (and (> t806 0) (< o806 o347)) (and (> t826 0) (< o826 o347)) (and (> t846 0) (< o846 o347)) (and (> t866 0) (< o866 o347)) (and (> t886 0) (< o886 o347)) (and (> t927 0) (< o927 o347)) (and (> t985 0) (< o985 o347)) (and (> t986 0) (< o986 o347)) (and (> t987 0) (< o987 o347)) (and (> t988 0) (< o988 o347)) (and (> t989 0) (< o989 o347)) (and (> t990 0) (< o990 o347)) (and (> t991 0) (< o991 o347)) (and (> t992 0) (< o992 o347)) (and (> t993 0) (< o993 o347)) (and (> t994 0) (< o994 o347)) (and (> t995 0) (< o995 o347)) (and (> t996 0) (< o996 o347)) (and (> t997 0) (< o997 o347)) (and (> t998 0) (< o998 o347)) (and (> t999 0) (< o999 o347)) (and (> t1000 0) (< o1000 o347)) (and (> t1001 0) (< o1001 o347)) (and (> t1002 0) (< o1002 o347)) (and (> t1003 0) (< o1003 o347)) (and (> t1004 0) (< o1004 o347)) (and (> t1365 0) (< o1365 o347)) (and (> t1366 0) (< o1366 o347)) (and (> t1367 0) (< o1367 o347)) (and (> t1368 0) (< o1368 o347)) (and (> t1369 0) (< o1369 o347)) (and (> t1370 0) (< o1370 o347)) (and (> t1371 0) (< o1371 o347)) (and (> t1372 0) (< o1372 o347)) (and (> t1373 0) (< o1373 o347)) (and (> t1374 0) (< o1374 o347)) (and (> t1375 0) (< o1375 o347)) (and (> t1376 0) (< o1376 o347)) (and (> t1377 0) (< o1377 o347)) (and (> t1378 0) (< o1378 o347)) (and (> t1379 0) (< o1379 o347)) (and (> t1380 0) (< o1380 o347)) (and (> t1381 0) (< o1381 o347)) (and (> t1382 0) (< o1382 o347)) (and (> t1383 0) (< o1383 o347)) (and (> t1384 0) (< o1384 o347)) (and (> t1728 0) (< o1728 o347)))) (and (and (> t96 0) (< o96 o347)) (or (and (> t106 0) (< o106 o347)) (and (> t126 0) (< o126 o347)) (and (> t146 0) (< o146 o347)) (and (> t166 0) (< o166 o347)) (and (> t186 0) (< o186 o347)) (and (> t206 0) (< o206 o347)) (and (> t226 0) (< o226 o347)) (and (> t246 0) (< o246 o347)) (and (> t266 0) (< o266 o347)) (and (> t286 0) (< o286 o347)) (and (> t306 0) (< o306 o347)) (and (> t326 0) (< o326 o347)) (and (> t346 0) (< o346 o347)) (and (> t366 0) (< o366 o347)) (and (> t386 0) (< o386 o347)) (and (> t406 0) (< o406 o347)) (and (> t426 0) (< o426 o347)) (and (> t446 0) (< o446 o347)) (and (> t466 0) (< o466 o347)) (and (> t486 0) (< o486 o347)) (and (> t907 0) (< o907 o347)) (and (> t985 0) (< o985 o347)) (and (> t986 0) (< o986 o347)) (and (> t987 0) (< o987 o347)) (and (> t988 0) (< o988 o347)) (and (> t989 0) (< o989 o347)) (and (> t990 0) (< o990 o347)) (and (> t991 0) (< o991 o347)) (and (> t992 0) (< o992 o347)) (and (> t993 0) (< o993 o347)) (and (> t994 0) (< o994 o347)) (and (> t995 0) (< o995 o347)) (and (> t996 0) (< o996 o347)) (and (> t997 0) (< o997 o347)) (and (> t998 0) (< o998 o347)) (and (> t999 0) (< o999 o347)) (and (> t1000 0) (< o1000 o347)) (and (> t1001 0) (< o1001 o347)) (and (> t1002 0) (< o1002 o347)) (and (> t1003 0) (< o1003 o347)) (and (> t1004 0) (< o1004 o347)) (and (> t1365 0) (< o1365 o347)) (and (> t1366 0) (< o1366 o347)) (and (> t1367 0) (< o1367 o347)) (and (> t1368 0) (< o1368 o347)) (and (> t1369 0) (< o1369 o347)) (and (> t1370 0) (< o1370 o347)) (and (> t1371 0) (< o1371 o347)) (and (> t1372 0) (< o1372 o347)) (and (> t1373 0) (< o1373 o347)) (and (> t1374 0) (< o1374 o347)) (and (> t1375 0) (< o1375 o347)) (and (> t1376 0) (< o1376 o347)) (and (> t1377 0) (< o1377 o347)) (and (> t1378 0) (< o1378 o347)) (and (> t1379 0) (< o1379 o347)) (and (> t1380 0) (< o1380 o347)) (and (> t1381 0) (< o1381 o347)) (and (> t1382 0) (< o1382 o347)) (and (> t1383 0) (< o1383 o347)) (and (> t1384 0) (< o1384 o347)) (and (> t1708 0) (< o1708 o347))) (or (and (> t507 0) (< o507 o347)) (and (> t527 0) (< o527 o347)) (and (> t547 0) (< o547 o347)) (and (> t567 0) (< o567 o347)) (and (> t587 0) (< o587 o347)) (and (> t607 0) (< o607 o347)) (and (> t627 0) (< o627 o347)) (and (> t647 0) (< o647 o347)) (and (> t667 0) (< o667 o347)) (and (> t687 0) (< o687 o347)) (and (> t707 0) (< o707 o347)) (and (> t727 0) (< o727 o347)) (and (> t747 0) (< o747 o347)) (and (> t767 0) (< o767 o347)) (and (> t787 0) (< o787 o347)) (and (> t807 0) (< o807 o347)) (and (> t827 0) (< o827 o347)) (and (> t847 0) (< o847 o347)) (and (> t867 0) (< o867 o347)) (and (> t887 0) (< o887 o347)) (and (> t928 0) (< o928 o347)) (and (> t1005 0) (< o1005 o347)) (and (> t1006 0) (< o1006 o347)) (and (> t1007 0) (< o1007 o347)) (and (> t1008 0) (< o1008 o347)) (and (> t1009 0) (< o1009 o347)) (and (> t1010 0) (< o1010 o347)) (and (> t1011 0) (< o1011 o347)) (and (> t1012 0) (< o1012 o347)) (and (> t1013 0) (< o1013 o347)) (and (> t1014 0) (< o1014 o347)) (and (> t1015 0) (< o1015 o347)) (and (> t1016 0) (< o1016 o347)) (and (> t1017 0) (< o1017 o347)) (and (> t1018 0) (< o1018 o347)) (and (> t1019 0) (< o1019 o347)) (and (> t1020 0) (< o1020 o347)) (and (> t1021 0) (< o1021 o347)) (and (> t1022 0) (< o1022 o347)) (and (> t1023 0) (< o1023 o347)) (and (> t1024 0) (< o1024 o347)) (and (> t1385 0) (< o1385 o347)) (and (> t1386 0) (< o1386 o347)) (and (> t1387 0) (< o1387 o347)) (and (> t1388 0) (< o1388 o347)) (and (> t1389 0) (< o1389 o347)) (and (> t1390 0) (< o1390 o347)) (and (> t1391 0) (< o1391 o347)) (and (> t1392 0) (< o1392 o347)) (and (> t1393 0) (< o1393 o347)) (and (> t1394 0) (< o1394 o347)) (and (> t1395 0) (< o1395 o347)) (and (> t1396 0) (< o1396 o347)) (and (> t1397 0) (< o1397 o347)) (and (> t1398 0) (< o1398 o347)) (and (> t1399 0) (< o1399 o347)) (and (> t1400 0) (< o1400 o347)) (and (> t1401 0) (< o1401 o347)) (and (> t1402 0) (< o1402 o347)) (and (> t1403 0) (< o1403 o347)) (and (> t1404 0) (< o1404 o347)) (and (> t1729 0) (< o1729 o347))))))") while checking expression at index 1
[2020-06-04 07:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:49] [INFO ] [Real]Absence check using state equation in 1582 ms returned unsat
[2020-06-04 07:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:50] [INFO ] [Real]Absence check using state equation in 602 ms returned unsat
[2020-06-04 07:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:50] [INFO ] [Real]Absence check using state equation in 110 ms returned unsat
[2020-06-04 07:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using state equation in 732 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:51] [INFO ] [Real]Absence check using state equation in 152 ms returned unsat
[2020-06-04 07:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:52] [INFO ] [Real]Absence check using state equation in 1098 ms returned sat
[2020-06-04 07:21:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:53] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2020-06-04 07:21:53] [INFO ] [Nat]Added 841 Read/Feed constraints in 358 ms returned sat
[2020-06-04 07:21:55] [INFO ] Deduced a trap composed of 25 places in 1718 ms
[2020-06-04 07:21:55] [INFO ] Deduced a trap composed of 107 places in 490 ms
[2020-06-04 07:21:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2393 ms
[2020-06-04 07:21:56] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 276 ms.
[2020-06-04 07:22:12] [INFO ] Added : 315 causal constraints over 63 iterations in 16491 ms. Result :unknown
[2020-06-04 07:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:12] [INFO ] [Real]Absence check using state equation in 332 ms returned unsat
[2020-06-04 07:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:13] [INFO ] [Real]Absence check using state equation in 196 ms returned unsat
[2020-06-04 07:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:14] [INFO ] [Real]Absence check using state equation in 1340 ms returned unsat
[2020-06-04 07:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:14] [INFO ] [Real]Absence check using state equation in 143 ms returned unsat
[2020-06-04 07:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:15] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2020-06-04 07:22:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:15] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2020-06-04 07:22:16] [INFO ] [Nat]Added 841 Read/Feed constraints in 486 ms returned sat
[2020-06-04 07:22:17] [INFO ] Deduced a trap composed of 29 places in 696 ms
[2020-06-04 07:22:17] [INFO ] Deduced a trap composed of 31 places in 286 ms
[2020-06-04 07:22:17] [INFO ] Deduced a trap composed of 31 places in 209 ms
[2020-06-04 07:22:17] [INFO ] Deduced a trap composed of 31 places in 215 ms
[2020-06-04 07:22:18] [INFO ] Deduced a trap composed of 30 places in 390 ms
[2020-06-04 07:22:18] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-06-04 07:22:19] [INFO ] Deduced a trap composed of 30 places in 341 ms
[2020-06-04 07:22:20] [INFO ] Deduced a trap composed of 23 places in 1308 ms
[2020-06-04 07:22:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4275 ms
[2020-06-04 07:22:20] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 228 ms.
[2020-06-04 07:22:35] [INFO ] Added : 300 causal constraints over 60 iterations in 14722 ms. Result :unknown
[2020-06-04 07:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:35] [INFO ] [Real]Absence check using state equation in 622 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
[2020-06-04 07:22:36] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 07:22:36] [INFO ] Flatten gal took : 370 ms
FORMULA SimpleLoadBal-PT-20-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:22:36] [INFO ] Flatten gal took : 174 ms
[2020-06-04 07:22:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 07:22:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SimpleLoadBal-PT-20 @ 3570 seconds

FORMULA SimpleLoadBal-PT-20-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3554
rslt: Output for LTLCardinality @ SimpleLoadBal-PT-20

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 07:22:37 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G ((p32 <= p16)) OR (p99 <= p72))))",
"processed_size": 42,
"rewrites": 45
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F ((p32 + 1 <= p40)) AND ((p40 <= p32) OR X ((p32 + 1 <= p40))))))",
"processed_size": 73,
"rewrites": 45
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(F ((F ((p149 <= p30)) AND X ((p149 <= p30)))) U X ((p149 <= p30)))",
"processed_size": 67,
"rewrites": 45
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p93 <= 0) OR (p168 + 1 <= p172))",
"processed_size": 35,
"rewrites": 47
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 323
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p109 <= p7)))",
"processed_size": 20,
"rewrites": 45
},
"result":
{
"edges": 237,
"markings": 233,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((p61 + 1 <= p131)) AND (p131 <= p61))))",
"processed_size": 49,
"rewrites": 45
},
"result":
{
"edges": 79,
"markings": 79,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1777
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p14 <= p36) OR (p38 <= p18)))",
"processed_size": 35,
"rewrites": 45
},
"result":
{
"edges": 36,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((((p146 + 1 <= p18) AND (p24 <= 0)) AND (G (((p146 + 1 <= p18) AND (p24 <= 0))) OR G (F ((p105 + 1 <= p91))))))",
"processed_size": 114,
"rewrites": 45
},
"result":
{
"edges": 123,
"markings": 123,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 74856,
"runtime": 16.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((* AND (G(*) OR G(F(*))))) : F(G(**)) : G(F((G(**) AND **))) : X(G((G(**) OR **))) : F(**) : G(**) : X(G((F(**) AND (** OR X(**))))) : (F((F(**) AND X(**))) U X(**))"
},
"net":
{
"arcs": 15678,
"conflict_clusters": 45,
"places": 194,
"places_significant": 145,
"singleton_clusters": 0,
"transitions": 2205
},
"result":
{
"preliminary_value": "no no no no no no no yes ",
"value": "no no no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2399/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 194
lola: finding significant places
lola: 194 places, 2205 transitions, 145 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: NOT(G ((F (((p182 <= p17) U F (G ((p91 <= p105))))) U ((p18 <= p146) OR (1 <= p24))))) : F (G (X (F (G ((p109 <= p7)))))) : F (G (F ((((p91 <= p112) U (1 <= 0)) OR (G ((p61 + 1 <= p131)) AND (p131 <= p61)))))) : (G (X ((G ((p32 <= p16)) OR (p99 <= p72)))) AND NOT(((1 <= p91) U (1 <= 0)))) : F (((NOT(G (X ((p172 <= p168)))) AND (p14 <= p190)) U ((1 <= p93) AND (p172 <= p168)))) : G (((p14 <= p36) OR (p38 <= p18))) : NOT(F (X (NOT(((p40 <= p32) U X ((p32 + 1 <= p40))))))) : (F ((F ((p149 <= p30)) AND X ((p149 <= p30)))) U X ((p149 <= p30)))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p32 <= p16)) OR (p99 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p32 <= p16)) OR (p99 <= p72))))
lola: processed formula length: 42
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 81 markings, 81 edges
lola: ========================================
lola: subprocess 1 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p32 + 1 <= p40)) AND ((p40 <= p32) OR X ((p32 + 1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p32 + 1 <= p40)) AND ((p40 <= p32) OR X ((p32 + 1 <= p40))))))
lola: processed formula length: 73
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 81 markings, 81 edges
lola: ========================================
lola: subprocess 2 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((p149 <= p30)) AND X ((p149 <= p30)))) U X ((p149 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((F ((p149 <= p30)) AND X ((p149 <= p30)))) U X ((p149 <= p30)))
lola: processed formula length: 67
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 3 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p93) AND (p172 <= p168)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p93 <= 0) OR (p168 + 1 <= p172))
lola: processed formula length: 35
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 4 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p109 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p109 <= p7)))
lola: processed formula length: 20
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 233 markings, 237 edges
lola: subprocess 5 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p61 + 1 <= p131)) AND (p131 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p61 + 1 <= p131)) AND (p131 <= p61))))
lola: processed formula length: 49
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 79 markings, 79 edges
lola: ========================================
lola: subprocess 6 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p14 <= p36) OR (p38 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p14 <= p36) OR (p38 <= p18)))
lola: processed formula length: 35
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================
lola: subprocess 7 will run for 3554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p146 + 1 <= p18) AND (p24 <= 0)) AND (G (((p146 + 1 <= p18) AND (p24 <= 0))) OR G (F ((p105 + 1 <= p91))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p146 + 1 <= p18) AND (p24 <= 0)) AND (G (((p146 + 1 <= p18) AND (p24 <= 0))) OR G (F ((p105 + 1 <= p91))))))
lola: processed formula length: 114
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 123 markings, 123 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes
lola:
preliminary result: no no no no no no no yes
lola: memory consumption: 74856 KB
lola: time consumption: 16 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

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="SimpleLoadBal-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is SimpleLoadBal-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939300625"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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