/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 --treeautomizer.smt.solver Internal_SMTInterpol -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-645efe7-m [2023-05-31 18:20:44,557 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-05-31 18:20:44,610 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf [2023-05-31 18:20:44,616 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-31 18:20:44,617 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-05-31 18:20:44,618 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-05-31 18:20:44,618 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-31 18:20:44,618 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-05-31 18:20:44,619 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-05-31 18:20:44,620 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-05-31 18:20:44,620 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-05-31 18:20:44,620 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-05-31 18:20:44,621 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-05-31 18:20:44,621 INFO L137 SettingsManager]: * Save file in source directory=true [2023-05-31 18:20:44,621 INFO L137 SettingsManager]: * Use automatic naming=true [2023-05-31 18:20:44,622 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.treeautomizer: SMT solver -> Internal_SMTInterpol [2023-05-31 18:20:44,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-31 18:20:44,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-31 18:20:44,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-31 18:20:44,819 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-31 18:20:44,820 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-31 18:20:44,821 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-05-31 18:20:44,821 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-05-31 18:20:44,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-31 18:20:44,841 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-31 18:20:44,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-31 18:20:44,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-31 18:20:44,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-05-31 18:20:44,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-31 18:20:44,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-31 18:20:44,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-05-31 18:20:44,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-05-31 18:20:44,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:44" (1/1) ... [2023-05-31 18:20:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-05-31 18:20:44,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-31 18:20:44,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-05-31 18:20:44,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-05-31 18:20:44,941 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-31 18:20:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-31 18:20:44,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-31 18:20:44,986 INFO L236 CfgBuilder]: Building ICFG [2023-05-31 18:20:44,988 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-31 18:20:44,991 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-05-31 18:20:45,066 INFO L277 CfgBuilder]: Performing block encoding [2023-05-31 18:20:45,084 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-31 18:20:45,085 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-31 18:20:45,087 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 06:20:45 BoogieIcfgContainer [2023-05-31 18:20:45,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-31 18:20:45,088 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-05-31 18:20:45,088 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-05-31 18:20:45,088 INFO L274 PluginConnector]: IcfgToChc initialized [2023-05-31 18:20:45,090 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 06:20:45" (1/1) ... [2023-05-31 18:20:45,270 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,276 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-05-31 18:20:45,278 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,281 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,284 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,286 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,288 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,296 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,298 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,305 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:45,370 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,378 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-05-31 18:20:45,381 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,391 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,396 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,405 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,409 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,412 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,414 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:45,422 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-05-31 18:20:45,438 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-05-31 18:20:45,441 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-05-31 18:20:45,443 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-05-31 18:20:45,445 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-05-31 18:20:45,447 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-05-31 18:20:45,449 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-05-31 18:20:45,451 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-05-31 18:20:45,453 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-05-31 18:20:45,454 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-05-31 18:20:45,457 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-05-31 18:20:45,469 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-05-31 18:20:45,472 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-05-31 18:20:45,473 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-05-31 18:20:45,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-05-31 18:20:45,478 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-05-31 18:20:45,479 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-05-31 18:20:45,481 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-05-31 18:20:45,483 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-05-31 18:20:45,485 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-05-31 18:20:45,487 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-05-31 18:20:45,496 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,499 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-05-31 18:20:45,500 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,502 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,505 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,506 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,508 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,510 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,512 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,514 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:45,522 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,525 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-05-31 18:20:45,527 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,528 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,530 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-05-31 18:20:45,532 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-05-31 18:20:45,533 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,534 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,536 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,538 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-05-31 18:20:45,547 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-05-31 18:20:45,556 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-05-31 18:20:45,558 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-05-31 18:20:45,561 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-05-31 18:20:45,564 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-05-31 18:20:45,566 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-05-31 18:20:45,568 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-05-31 18:20:45,570 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-05-31 18:20:45,572 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-05-31 18:20:45,575 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-05-31 18:20:45,583 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,588 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-05-31 18:20:45,591 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,593 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,595 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,597 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,599 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,600 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,602 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,604 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:45,609 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:45,611 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-05-31 18:20:45,612 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:45,613 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-05-31 18:20:45,614 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-05-31 18:20:45,615 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-05-31 18:20:45,616 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-05-31 18:20:45,617 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-05-31 18:20:45,618 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-05-31 18:20:45,619 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-05-31 18:20:45,624 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,627 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-05-31 18:20:45,628 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,630 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,632 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,633 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,635 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,636 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,638 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,639 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:45,651 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:45,653 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-05-31 18:20:45,654 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:45,655 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-05-31 18:20:45,656 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-05-31 18:20:45,657 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-05-31 18:20:45,658 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-05-31 18:20:45,659 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-05-31 18:20:45,660 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-05-31 18:20:45,661 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-05-31 18:20:45,704 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:45 HornClauseAST [2023-05-31 18:20:45,705 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-05-31 18:20:45,705 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-05-31 18:20:45,705 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-05-31 18:20:45,705 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-05-31 18:20:45,706 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:45" (1/1) ... [2023-05-31 18:20:45,707 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID9926846536608536161.smt2 [2023-05-31 18:20:45,750 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-05-31 18:20:45,751 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-05-31 18:20:45,751 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-05-31 18:20:45,751 INFO L274 PluginConnector]: ChcSolver initialized [2023-05-31 18:20:45,753 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:45" (1/1) ... [2023-05-31 18:20:45,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-05-31 18:20:45,799 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver has thrown an exception: java.lang.UnsupportedOperationException: Proofs are not supported at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getProof(Scriptor.java:168) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:358) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.graph.TreeAutomizerCEGAR.retrieveInterpolantsMap(TreeAutomizerCEGAR.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.graph.TreeAutomizerCEGAR.iterate(TreeAutomizerCEGAR.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.TreeAutomizerChcScript.solve(TreeAutomizerChcScript.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.TreeAutomizerChcScript.solve(TreeAutomizerChcScript.java:82) at de.uni_freiburg.informatik.ultimate.plugins.chcsolver.ChcSolverObserver.process(ChcSolverObserver.java:77) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.DFSTreeWalker.runObserver(DFSTreeWalker.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-31 18:20:45,807 INFO L158 Benchmark]: Toolchain (without parser) took 964.51ms. Allocated memory was 316.7MB in the beginning and 484.4MB in the end (delta: 167.8MB). Free memory was 264.4MB in the beginning and 448.8MB in the end (delta: -184.4MB). There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 18:20:45,809 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 316.7MB. Free memory was 265.5MB in the beginning and 265.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 18:20:45,809 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 316.7MB. Free memory was 264.3MB in the beginning and 262.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. [2023-05-31 18:20:45,810 INFO L158 Benchmark]: RCFGBuilder took 215.49ms. Allocated memory is still 316.7MB. Free memory was 262.4MB in the beginning and 253.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-05-31 18:20:45,811 INFO L158 Benchmark]: IcfgToChc took 617.05ms. Allocated memory is still 316.7MB. Free memory was 253.1MB in the beginning and 232.7MB in the end (delta: 20.4MB). Peak memory consumption was 22.4MB. Max. memory is 15.0GB. [2023-05-31 18:20:45,812 INFO L158 Benchmark]: ChcSmtPrinter took 44.67ms. Allocated memory is still 316.7MB. Free memory was 232.7MB in the beginning and 225.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-05-31 18:20:45,813 INFO L158 Benchmark]: ChcSolver took 54.16ms. Allocated memory was 316.7MB in the beginning and 484.4MB in the end (delta: 167.8MB). Free memory was 225.4MB in the beginning and 448.8MB in the end (delta: -223.4MB). There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 18:20:45,821 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.16ms. Allocated memory is still 316.7MB. Free memory was 265.5MB in the beginning and 265.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 316.7MB. Free memory was 264.3MB in the beginning and 262.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. * RCFGBuilder took 215.49ms. Allocated memory is still 316.7MB. Free memory was 262.4MB in the beginning and 253.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 617.05ms. Allocated memory is still 316.7MB. Free memory was 253.1MB in the beginning and 232.7MB in the end (delta: 20.4MB). Peak memory consumption was 22.4MB. Max. memory is 15.0GB. * ChcSmtPrinter took 44.67ms. Allocated memory is still 316.7MB. Free memory was 232.7MB in the beginning and 225.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * ChcSolver took 54.16ms. Allocated memory was 316.7MB in the beginning and 484.4MB in the end (delta: 167.8MB). Free memory was 225.4MB in the beginning and 448.8MB in the end (delta: -223.4MB). There was no memory consumed. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - ExceptionOrErrorResult: UnsupportedOperationException: Proofs are not supported de.uni_freiburg.informatik.ultimate.plugins.chcsolver: UnsupportedOperationException: Proofs are not supported: de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getProof(Scriptor.java:168) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-05-31 18:20:45,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...