/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_tx -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_ty -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}> = 0)> = 0))> = ((2 * main_tx) + main_y)))> = ((2 * main_tx) + main_y))> = (main_ty + 1)))> = (main_ty + 1))> = (main_tx + 1))> = (main_tx + 1)))> main_x, main_ty -> main_y, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_5}> = 0)> = 0))> = ((2 * main_tx) + main_y))> = ((2 * main_tx) + main_y)))> = (main_ty + 1))> = (main_ty + 1)))> = (main_tx + 1))> = (main_tx + 1)))> ¿functionCall(__VERIFIER_nondet_int)}> main_x, main_ty -> main_y}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_7}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_8}> main_x}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_9}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [7 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | tx | local variable | integer | | y | local variable | integer | | ty | local variable | integer | | n | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0)> = 0))> = ((2 * main_tx) + main_y)) /\ (main_y >= (main_ty + 1)) /\ (main_x >= (main_tx + 1)) /\ (undef15 = 0), par{main_x -> undef18, main_tx -> main_x}> = ((2 * main_tx) + main_y)) /\ (main_y >= (main_ty + 1)) /\ (main_x >= (main_tx + 1)) /\ (undef15 = 1), par{main_x -> undef16, main_tx -> main_x, main_y -> undef17, main_ty -> main_y}> = ((2 * main_tx) + main_y)) /\ (main_y >= (main_ty + 1)) /\ not((main_x >= (main_tx + 1)))> = ((2 * main_tx) + main_y)) /\ not((main_y >= (main_ty + 1)))> = ((2 * main_tx) + main_y)))> Fresh variables: undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef18, main_tx -> main_x, rest remain the same}> undef16, main_tx -> main_x, main_y -> undef17, main_ty -> main_y, rest remain the same}> Variables: main_x, main_tx, main_y, main_ty, main_n Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 15 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007067 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002381s Ranking function: 1 + (~(2) / 3)*main_tx + (~(1) / 3)*main_ty + (1 / 3)*main_n New Graphs: Proving termination of subgraph 2 Analyzing SCC {l15}... No cycles found. Program Terminates