0.00/0.05 NO 0.00/0.05 0.00/0.05 Solver Timeout: 4 0.00/0.05 Global Timeout: 300 0.00/0.05 No parsing errors! 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 (0 + x^0)}> 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 undef105}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 0.00/0.05 0.00/0.05 undef171}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 0.00/0.05 0.00/0.05 undef237}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 0.00/0.05 0.00/0.05 undef303}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 2}> 0.00/0.05 undef356}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 2}> 0.00/0.05 undef409}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 2}> 0.00/0.05 undef462}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 1}> 0.00/0.05 undef515}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 1}> 0.00/0.05 undef568}> 0.00/0.05 0}> 0.00/0.05 1}> 0.00/0.05 1}> 0.00/0.05 (0 + x^0)}> 0.00/0.05 2}> 0.00/0.05 0.00/0.05 (0 + x^0)}> 0.00/0.05 1}> 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef105, undef171, undef237, undef303, undef356, undef409, undef462, undef515, undef568, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef105, undef171, undef237, undef303, undef356, undef409, undef462, undef515, undef568, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 Preprocessed LLVMGraph 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 1}> 0.00/0.05 2}> 0.00/0.05 1}> 0.00/0.05 2}> 0.00/0.05 2}> 0.00/0.05 1}> 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef105, undef171, undef237, undef303, undef356, undef409, undef462, undef515, undef568, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef105, undef171, undef237, undef303, undef356, undef409, undef462, undef515, undef568, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 ************************************************************* 0.00/0.05 ******************************************************************************************* 0.00/0.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Init Location: 0 0.00/0.05 Graph 0: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 1: 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 2: 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 3: 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 4: 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 5: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Precedence: 0.00/0.05 Graph 0 0.00/0.05 0.00/0.05 Graph 1 0.00/0.05 2, rest remain the same}> 0.00/0.05 0.00/0.05 Graph 2 0.00/0.05 0.00/0.05 0.00/0.05 Graph 3 0.00/0.05 2, rest remain the same}> 0.00/0.05 0.00/0.05 Graph 4 0.00/0.05 2, rest remain the same}> 0.00/0.05 0.00/0.05 Graph 5 0.00/0.05 0.00/0.05 1, rest remain the same}> 0.00/0.05 1, rest remain the same}> 0.00/0.05 1, rest remain the same}> 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 Map Locations to Subgraph: 0.00/0.05 ( 0 , 0 ) 0.00/0.05 ( 4 , 5 ) 0.00/0.05 ( 7 , 1 ) 0.00/0.05 ( 8 , 2 ) 0.00/0.05 ( 12 , 3 ) 0.00/0.05 ( 15 , 4 ) 0.00/0.05 0.00/0.05 ******************************************************************************************* 0.00/0.05 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Proving termination of subgraph 0 0.00/0.05 Proving termination of subgraph 1 0.00/0.05 Checking unfeasibility... 0.00/0.05 Time used: 0.000928 0.00/0.05 0.00/0.05 > No variable changes in termination graph. 0.00/0.05 Checking conditional unfeasibility... 0.00/0.05 Termination failed. Trying to show unreachability... 0.00/0.05 Proving unreachability of entry: 2, rest remain the same}> 0.00/0.05 0.00/0.05 LOG: CALL check - Post:1 <= 0 - Process 1 0.00/0.05 * Exit transition: 2, rest remain the same}> 0.00/0.05 * Postcondition : 1 <= 0 0.00/0.05 0.00/0.05 LOG: CALL solveLinear 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear - Elapsed time: 0.000518s 0.00/0.05 > Postcondition is not implied! 0.00/0.05 0.00/0.05 LOG: RETURN check - Elapsed time: 0.000589s 0.00/0.05 Cannot prove unreachability 0.00/0.05 0.00/0.05 Proving non-termination of subgraph 1 0.00/0.05 Transitions: 0.00/0.05 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Checking conditional non-termination of SCC {l7}... 0.00/0.05 > No exit transition to close. 0.00/0.05 Calling reachability with... 0.00/0.05 Transition: 0.00/0.05 Conditions: 0.00/0.05 OPEN EXITS: 0.00/0.05 0.00/0.05 0.00/0.05 --- Reachability graph --- 0.00/0.05 > Graph without transitions. 0.00/0.05 0.00/0.05 Calling reachability with... 0.00/0.05 Transition: 2, rest remain the same}> 0.00/0.05 Conditions: 0.00/0.05 OPEN EXITS: 0.00/0.05 2, rest remain the same}> 0.00/0.05 0.00/0.05 > Conditions are reachable! 0.00/0.05 0.00/0.05 Program does NOT terminate 0.00/0.05 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.05 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.05 EOF