/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef293}> undef492}> undef738, __rho_7_^0 -> undef759, k2^0 -> (~(1) + k2^0)}> (0 + Irql^0), keR^0 -> 0}> undef953, k3^0 -> (0 + undef953), keA^0 -> 0}> (0 + CromData^0)}> undef1233}> 0}> undef1569}> (0 + undef1635), __rho_3_^0 -> undef1635, k1^0 -> (~(1) + k1^0)}> undef1706, i___099^0 -> (0 + Irql^0), k2^0 -> (0 + undef1706), keA^0 -> 0, keR^0 -> 0}> 0, a4545^0 -> 2, a4646^0 -> (0 + BusResetIrp^0), prevCancel^0 -> (0 + undef1956), ret_IoSetCancelRoutine4444^0 -> undef1956}> (~(1) + k5^0)}> undef2095, __rho_56_^0 -> undef2112, prevCancel^0 -> 0}> (0 + Irql^0), keR^0 -> 0}> (0 + pIrb^0), a3434^0 -> (0 + ResourceIrp^0), a3737^0 -> (0 + pIrb^0), a3838^0 -> (0 + ResourceIrp^0), b3333^0 -> 0, b3535^0 -> (0 + pIrb^0), ntStatus^0 -> (0 + undef2431), ret_t1394_SubmitIrpSynch3636^0 -> undef2431}> (0 + ResourceIrp^0)}> undef2514, k1^0 -> (0 + undef2514), keA^0 -> 0, ntStatus^0 -> (0 + undef2563), ret_IoSetDeviceInterfaceState44^0 -> undef2563}> 1, b2929^0 -> 0, pIrb^0 -> (0 + undef2630), ret_ExAllocatePool3030^0 -> undef2630}> (0 + undef2966), StackSize^0 -> undef2913, __rho_99_^0 -> undef2927, a2525^0 -> (0 + undef2913), b2626^0 -> 0, pIrb^0 -> undef2963, ret_IoAllocateIrp2727^0 -> undef2966}> undef2985, i___04040^0 -> (0 + Irql^0), k5^0 -> (0 + undef2985), keA^0 -> 0, keR^0 -> 0}> (0 + undef3057), __rho_12_^0 -> undef3057, i___02424^0 -> (0 + Irql^0), k4^0 -> (~(1) + k4^0), keR^0 -> 0}> (0 + DeviceObject^0), b22^0 -> (0 + Irp^0), ntStatus^0 -> (0 + undef3247), ret_t1394Diag_PnpStopDevice33^0 -> undef3247}> undef3260, i___02020^0 -> (0 + Irql^0), k4^0 -> (0 + undef3260), keR^0 -> 0}> undef3325, a1818^0 -> (0 + undef3325), i^0 -> undef3362, i___01717^0 -> (0 + Irql^0), k3^0 -> (~(1) + k3^0), keR^0 -> 0}> undef3404, keA^0 -> 0, keR^0 -> 0}> Fresh variables: undef293, undef492, undef738, undef759, undef805, undef873, undef874, undef875, undef953, undef1010, undef1011, undef1012, undef1233, undef1348, undef1349, undef1350, undef1569, undef1635, undef1706, undef1753, undef1754, undef1755, undef1756, undef1757, undef1758, undef1956, undef2095, undef2112, undef2228, undef2229, undef2230, undef2431, undef2514, undef2563, undef2566, undef2567, undef2568, undef2630, undef2913, undef2927, undef2963, undef2966, undef2971, undef2985, undef3039, undef3040, undef3041, undef3042, undef3043, undef3044, undef3057, undef3112, undef3113, undef3114, undef3247, undef3260, undef3316, undef3317, undef3318, undef3325, undef3362, undef3386, undef3387, undef3388, undef3389, undef3404, Undef variables: undef293, undef492, undef738, undef759, undef805, undef873, undef874, undef875, undef953, undef1010, undef1011, undef1012, undef1233, undef1348, undef1349, undef1350, undef1569, undef1635, undef1706, undef1753, undef1754, undef1755, undef1756, undef1757, undef1758, undef1956, undef2095, undef2112, undef2228, undef2229, undef2230, undef2431, undef2514, undef2563, undef2566, undef2567, undef2568, undef2630, undef2913, undef2927, undef2963, undef2966, undef2971, undef2985, undef3039, undef3040, undef3041, undef3042, undef3043, undef3044, undef3057, undef3112, undef3113, undef3114, undef3247, undef3260, undef3316, undef3317, undef3318, undef3325, undef3362, undef3386, undef3387, undef3388, undef3389, undef3404, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (0 + undef1706)}> (0 + undef3260)}> (0 + undef2985)}> (~(1) + k4^0)}> (~(1) + k4^0)}> (~(1) + k4^0)}> (~(1) + k4^0)}> (~(1) + k5^0)}> Fresh variables: undef293, undef492, undef738, undef759, undef805, undef873, undef874, undef875, undef953, undef1010, undef1011, undef1012, undef1233, undef1348, undef1349, undef1350, undef1569, undef1635, undef1706, undef1753, undef1754, undef1755, undef1756, undef1757, undef1758, undef1956, undef2095, undef2112, undef2228, undef2229, undef2230, undef2431, undef2514, undef2563, undef2566, undef2567, undef2568, undef2630, undef2913, undef2927, undef2963, undef2966, undef2971, undef2985, undef3039, undef3040, undef3041, undef3042, undef3043, undef3044, undef3057, undef3112, undef3113, undef3114, undef3247, undef3260, undef3316, undef3317, undef3318, undef3325, undef3362, undef3386, undef3387, undef3388, undef3389, undef3404, Undef variables: undef293, undef492, undef738, undef759, undef805, undef873, undef874, undef875, undef953, undef1010, undef1011, undef1012, undef1233, undef1348, undef1349, undef1350, undef1569, undef1635, undef1706, undef1753, undef1754, undef1755, undef1756, undef1757, undef1758, undef1956, undef2095, undef2112, undef2228, undef2229, undef2230, undef2431, undef2514, undef2563, undef2566, undef2567, undef2568, undef2630, undef2913, undef2927, undef2963, undef2966, undef2971, undef2985, undef3039, undef3040, undef3041, undef3042, undef3043, undef3044, undef3057, undef3112, undef3113, undef3114, undef3247, undef3260, undef3316, undef3317, undef3318, undef3325, undef3362, undef3386, undef3387, undef3388, undef3389, undef3404, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> Variables: k1^0 Graph 2: Transitions: -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> Variables: k2^0 Graph 3: Transitions: Variables: Graph 4: Transitions: -1 + k4^0, rest remain the same}> -1 + k4^0, rest remain the same}> -1 + k4^0, rest remain the same}> -1 + k4^0, rest remain the same}> Variables: k4^0 Graph 5: Transitions: -1 + k5^0, rest remain the same}> Variables: k5^0 Graph 6: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef1706, rest remain the same}> Graph 3 Graph 4 undef3260, rest remain the same}> Graph 5 undef2985, rest remain the same}> Graph 6 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 8 , 1 ) ( 11 , 3 ) ( 16 , 4 ) ( 20 , 5 ) ( 26 , 6 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.008437 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004661s Ranking function: -1 + k1^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.035498 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014684s Ranking function: -1 + k2^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.001694 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: undef1706, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST [576 : 577] [576 : 578] LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> END GRAPH: EXIT: undef1706, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [576 : 579] [576 : 580] [576 : 581] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.187946s LOG: NarrowEntry size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef1706, rest remain the same}> END ENTRIES: GRAPH: -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST [576 : 582] [576 : 583] [576 : 584] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.124280s Cannot prove unreachability [576 : 600] [576 : 601] Successful child: 600 Program does NOT terminate