/usr/bin/java -Xmx15000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularVerifier.xml --chcsolver.chc.solver.backend TREEAUTOMIZER --chcsolver.produce.chc.model.if.query.is.sat false --chcsolver.produce.derivation.if.query.is.unsat false --chcsolver.produce.unsat.core.if.query.is.unsat true --rcfgbuilder.smt.solver Internal_SMTInterpol -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-3a8dd60-m [2023-06-12 11:30:22,535 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 11:30:22,603 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf [2023-06-12 11:30:22,612 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 11:30:22,614 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 11:30:22,615 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 11:30:22,615 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 11:30:22,615 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 11:30:22,616 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 11:30:22,620 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 11:30:22,621 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 11:30:22,621 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 11:30:22,622 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 11:30:22,623 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 11:30:22,623 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 11:30:22,623 INFO L137 SettingsManager]: * File name=CHC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: CHC solver backend -> TREEAUTOMIZER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce CHC model if query is SAT -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce derivation if query is UNSAT -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce UNSAT core if query is UNSAT -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: SMT solver -> Internal_SMTInterpol [2023-06-12 11:30:22,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 11:30:22,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 11:30:22,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 11:30:22,867 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 11:30:22,868 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 11:30:22,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl [2023-06-12 11:30:22,869 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-12 11:30:22,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 11:30:22,896 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-06-12 11:30:22,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 11:30:22,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 11:30:22,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 11:30:22,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 11:30:22,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 11:30:22,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 11:30:22,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 11:30:22,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 11:30:22" (1/1) ... [2023-06-12 11:30:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 11:30:23,026 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 11:30:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 11:30:23,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 11:30:23,058 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 11:30:23,060 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 11:30:23,064 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-12 11:30:23,126 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 11:30:23,144 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 11:30:23,144 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 11:30:23,146 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 11:30:23 BoogieIcfgContainer [2023-06-12 11:30:23,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 11:30:23,146 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 11:30:23,147 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 11:30:23,147 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 11:30:23,150 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 11:30:23" (1/1) ... [2023-06-12 11:30:23,329 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,336 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,337 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,339 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,342 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,344 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,346 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,348 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,349 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,353 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 11:30:23,380 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,396 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,399 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,404 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,408 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,412 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,416 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,419 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,423 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 11:30:23,435 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: false [2023-06-12 11:30:23,454 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 11:30:23,458 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'sum := 0;' is: true [2023-06-12 11:30:23,460 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 11:30:23,464 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 11:30:23,470 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 11:30:23,473 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 11:30:23,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 11:30:23,477 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 11:30:23,478 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 11:30:23,482 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-12 11:30:23,493 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 11:30:23,497 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'idx := 0;' is: true [2023-06-12 11:30:23,498 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 11:30:23,500 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 11:30:23,503 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 11:30:23,505 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 11:30:23,507 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 11:30:23,508 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 11:30:23,510 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 11:30:23,513 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-12 11:30:23,524 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,530 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,532 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,534 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,537 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,538 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,540 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,550 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,553 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,557 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-12 11:30:23,600 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,603 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume idx < n;' is: true [2023-06-12 11:30:23,604 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,606 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,608 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 11:30:23,629 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 11:30:23,630 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,632 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,633 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,635 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-12 11:30:23,646 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,772 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: false [2023-06-12 11:30:23,775 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,779 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,783 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,786 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,789 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,791 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,794 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,797 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 11:30:23,806 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,809 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,810 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,812 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,814 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,816 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,818 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,819 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,821 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,823 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 11:30:23,830 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 11:30:23,832 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume true;' is: true [2023-06-12 11:30:23,833 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 11:30:23,834 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 11:30:23,835 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 11:30:23,836 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 11:30:23,837 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 11:30:23,838 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 11:30:23,839 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 11:30:23,840 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 11:30:23,846 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,849 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,850 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,851 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,853 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,854 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,856 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,857 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,858 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,860 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-12 11:30:23,866 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 11:30:23,868 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume true;' is: true [2023-06-12 11:30:23,868 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 11:30:23,869 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 11:30:23,870 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 11:30:23,871 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 11:30:23,872 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 11:30:23,873 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 11:30:23,874 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 11:30:23,875 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 11:30:23,935 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 11:30:23 HornClauseAST [2023-06-12 11:30:23,935 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 11:30:23,936 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 11:30:23,936 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 11:30:23,936 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 11:30:23,937 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 11:30:23" (1/1) ... [2023-06-12 11:30:23,938 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID13689536170643191862.smt2 [2023-06-12 11:30:23,985 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 11:30:23,986 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-06-12 11:30:23,986 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-06-12 11:30:23,986 INFO L274 PluginConnector]: ChcSolver initialized [2023-06-12 11:30:23,987 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 11:30:23" (1/1) ... [2023-06-12 11:30:24,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier Received shutdown request... [2023-06-12 11:59:41,860 INFO L257 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver. Reason: Timeout or Toolchain cancelled by user [2023-06-12 11:59:41,862 INFO L158 Benchmark]: Toolchain (without parser) took 1758965.41ms. Allocated memory was 320.9MB in the beginning and 8.3GB in the end (delta: 8.0GB). Free memory was 278.0MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 5.1GB. Max. memory is 15.0GB. [2023-06-12 11:59:41,863 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 320.9MB. Free memory is still 279.1MB. There was no memory consumed. Max. memory is 15.0GB. [2023-06-12 11:59:41,863 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 320.9MB. Free memory was 278.0MB in the beginning and 276.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 11:59:41,864 INFO L158 Benchmark]: RCFGBuilder took 213.87ms. Allocated memory is still 320.9MB. Free memory was 276.1MB in the beginning and 266.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. [2023-06-12 11:59:41,864 INFO L158 Benchmark]: IcfgToChc took 788.76ms. Allocated memory is still 320.9MB. Free memory was 266.3MB in the beginning and 243.3MB in the end (delta: 23.1MB). Peak memory consumption was 28.9MB. Max. memory is 15.0GB. [2023-06-12 11:59:41,865 INFO L158 Benchmark]: ChcSmtPrinter took 49.40ms. Allocated memory is still 320.9MB. Free memory was 243.3MB in the beginning and 236.5MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. [2023-06-12 11:59:41,865 INFO L158 Benchmark]: ChcSolver took 1757875.23ms. Allocated memory was 320.9MB in the beginning and 8.3GB in the end (delta: 8.0GB). Free memory was 236.5MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 5.1GB. Max. memory is 15.0GB. [2023-06-12 11:59:41,868 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 320.9MB. Free memory is still 279.1MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 320.9MB. Free memory was 278.0MB in the beginning and 276.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 213.87ms. Allocated memory is still 320.9MB. Free memory was 276.1MB in the beginning and 266.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. * IcfgToChc took 788.76ms. Allocated memory is still 320.9MB. Free memory was 266.3MB in the beginning and 243.3MB in the end (delta: 23.1MB). Peak memory consumption was 28.9MB. Max. memory is 15.0GB. * ChcSmtPrinter took 49.40ms. Allocated memory is still 320.9MB. Free memory was 243.3MB in the beginning and 236.5MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. * ChcSolver took 1757875.23ms. Allocated memory was 320.9MB in the beginning and 8.3GB in the end (delta: 8.0GB). Free memory was 236.5MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 5.1GB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.chcsolver) Toolchain cancelled while TreeAutomizerCEGAR was refining abstraction,while Minimize was minimizing tree automaton,while Totalize was totalizing tree automaton with 35 nodes. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown