NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0}> (0 + DName^0), num^0 -> (1 + num^0)}> 0}> (1 + i^0)}> (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef270, status^0 -> (0 + undef270), tmp99^0 -> undef275}> (0 + undef364), a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef364, tmp55^0 -> undef367}> 0, unset^0 -> undef415}> Fresh variables: undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, Undef variables: undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + i^0)}> 0, num^0 -> 0}> 0, num^0 -> 0}> 0, num^0 -> 0}> 0}> 0}> Fresh variables: undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, Undef variables: undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + i^0, rest remain the same}> Variables: Pdolen^0, i^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, num^0 -> 0, rest remain the same}> 0, num^0 -> 0, rest remain the same}> 0, num^0 -> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 2 ) ( 9 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002204 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001197s Ranking function: -1 + Pdolen^0 - i^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001767 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: 0, num^0 -> 0, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 0, num^0 -> 0, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000836s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000974s LOG: NarrowEntry size 1 It's unfeasible. Removing transition: 1 + i^0, rest remain the same}> ENTRIES: END ENTRIES: GRAPH: END GRAPH: EXIT: 0, num^0 -> 0, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002409s Time used: 0.002303 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004788s Time used: 0.004605 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007521s Time used: 0.007284 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.022306s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: Variables: Checking conditional non-termination of SCC {l4}... > No exit transition to close. Calling reachability with... Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, num^0 -> 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: Transition: 0, rest remain the same}> Conditions: OPEN EXITS: 0, num^0 -> 0, rest remain the same}> (condsUp: undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2) 0, rest remain the same}> (condsUp: 1 <= undef364, undef364 = undef367) 0, rest remain the same}> 0, num^0 -> 0, rest remain the same}> (condsUp: undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2) 0, rest remain the same}> (condsUp: 1 <= undef364, undef364 = undef367) 0, rest remain the same}> 0, num^0 -> 0, rest remain the same}> (condsUp: undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2) 0, rest remain the same}> (condsUp: 1 <= undef364, undef364 = undef367) 0, rest remain the same}> 0, num^0 -> 0, rest remain the same}> (condsUp: undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2) 0, rest remain the same}> (condsUp: 1 <= undef364, undef364 = undef367) 0, rest remain the same}> 0, num^0 -> 0, rest remain the same}> (condsUp: undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1) 0, num^0 -> 0, rest remain the same}> (condsUp: undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2) 0, rest remain the same}> (condsUp: 1 <= undef364, undef364 = undef367) 0, rest remain the same}> --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + i^0 <= Pdolen^0, undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2, Transition: Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef364, undef364 = undef367, Transition: Conditions: Pdolen^0 <= i^0, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2, Transition: Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef364, undef364 = undef367, Transition: Conditions: Pdolen^0 <= i^0, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2, Transition: Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef364, undef364 = undef367, Transition: Conditions: Pdolen^0 <= i^0, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2, Transition: Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef364, undef364 = undef367, Transition: Conditions: Pdolen^0 <= i^0, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef270 <= 0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, 3 <= undef270, undef270 = undef275, undef364 = undef367, undef277 = 1, Transition: Conditions: 1 + i^0 <= Pdolen^0, undef364 <= 0, undef270 = undef275, undef364 = undef367, undef277 = 1, undef270 = 2, Transition: Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef364, undef364 = undef367, Transition: Conditions: Pdolen^0 <= i^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate