/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 --icfgtochc.break.symmetry.of.preference.order false --chcsolver.chc.solver.backend ELDARICA --chcsolver.produce.chc.model.if.query.is.sat true --chcsolver.produce.derivation.if.query.is.unsat true --chcsolver.produce.unsat.core.if.query.is.unsat true -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 12:29:44,393 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 12:29:44,461 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 12:29:44,472 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 12:29:44,474 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 12:29:44,475 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 12:29:44,475 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 12:29:44,476 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 12:29:44,476 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 12:29:44,482 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 12:29:44,483 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 12:29:44,483 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 12:29:44,484 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 12:29:44,485 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 12:29:44,486 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 12:29:44,486 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.icfgtochc: Break symmetry of preference order -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: CHC solver backend -> ELDARICA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce CHC model if query is SAT -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce derivation if query is UNSAT -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce UNSAT core if query is UNSAT -> true [2023-06-12 12:29:44,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 12:29:44,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 12:29:44,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 12:29:44,755 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 12:29:44,756 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 12:29:44,757 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 12:29:44,758 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-12 12:29:44,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 12:29:44,780 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-06-12 12:29:44,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 12:29:44,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 12:29:44,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 12:29:44,796 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,797 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,805 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,805 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,808 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,811 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,812 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,813 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 12:29:44" (1/1) ... [2023-06-12 12:29:44,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 12:29:44,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 12:29:44,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 12:29:44,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 12:29:44,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 12:29:44" (1/1) ... [2023-06-12 12:29:44,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 12:29:44,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 12:29:44,850 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-06-12 12:29:44,858 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-06-12 12:29:44,886 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 12:29:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 12:29:44,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 12:29:44,938 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 12:29:44,940 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 12:29:44,943 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-12 12:29:45,044 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 12:29:45,060 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 12:29:45,063 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 12:29:45,065 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 12:29:45 BoogieIcfgContainer [2023-06-12 12:29:45,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 12:29:45,066 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 12:29:45,067 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 12:29:45,067 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 12:29:45,068 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 12:29:45" (1/1) ... [2023-06-12 12:29:45,257 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,263 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 12:29:45,264 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,267 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,270 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,272 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,273 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,275 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,277 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 12:29:45,279 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 12:29:45,325 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,350 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 12:29:45,353 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,356 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,361 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 12:29:45,364 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,366 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,369 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,372 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 12:29:45,380 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 12:29:45,389 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 12:29:45,392 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 12:29:45,393 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 12:29:45,395 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 12:29:45,397 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 12:29:45,399 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 12:29:45,401 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 12:29:45,402 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 12:29:45,404 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 12:29:45,405 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-12 12:29:45,412 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 12:29:45,415 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 12:29:45,416 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 12:29:45,417 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 12:29:45,419 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 12:29:45,421 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 12:29:45,422 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 12:29:45,424 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 12:29:45,425 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 12:29:45,427 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-12 12:29:45,437 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 12:29: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 'assume !(idx < n);' is: true [2023-06-12 12:29:45,443 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,445 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,451 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,454 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,456 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,460 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,461 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,464 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-12 12:29:45,474 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,479 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 12:29:45,480 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,484 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,486 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 12:29:45,488 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 12:29:45,489 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,493 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,495 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,498 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-12 12:29:45,507 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 12:29:45,517 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 12:29:45,520 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 12:29:45,524 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 12:29:45,526 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 12:29:45,530 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 12:29:45,533 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 12:29:45,534 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 12:29:45,536 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 12:29:45,544 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 12:29:45,552 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29: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 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,559 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,561 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,566 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,567 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,569 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,572 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,574 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 12:29:45,577 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 12:29:45,587 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 12:29:45,589 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 12:29:45,590 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 12:29:45,591 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 12:29:45,592 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 12:29:45,594 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 12:29:45,594 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 12:29:45,595 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 12:29:45,596 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 12:29:45,600 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 12:29:45,606 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,609 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 12:29:45,611 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,613 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,617 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,619 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,623 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,624 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,625 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,627 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-12 12:29:45,633 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 12:29:45,635 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 12:29:45,636 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 12:29:45,637 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 12:29:45,638 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 12:29:45,639 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 12:29:45,640 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 12:29:45,642 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 12:29:45,642 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 12:29:45,644 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 12:29:45,692 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 12:29:45 HornClauseAST [2023-06-12 12:29:45,693 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 12:29:45,693 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 12:29:45,694 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 12:29:45,694 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 12:29:45,695 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 12:29:45" (1/1) ... [2023-06-12 12:29:45,695 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID14764336176756475363.smt2 [2023-06-12 12:29:45,719 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 12:29:45,720 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-06-12 12:29:45,720 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-06-12 12:29:45,720 INFO L274 PluginConnector]: ChcSolver initialized [2023-06-12 12:29:45,722 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 12:29:45" (1/1) ... [2023-06-12 12:29:45,723 WARN L147 ChcSolverObserver]: Derivation production is not supported by backend [2023-06-12 12:29:45,723 WARN L153 ChcSolverObserver]: UNSAT core production is not supported by backend [2023-06-12 12:29:45,723 INFO L90 EldaricaCliChcScript]: Writing script to file /tmp/eldarica_5560659384795465738.smt2 [2023-06-12 12:29:45,738 ERROR L181 MonitoredProcess]: Could not determine absolute path of external process, hoping that OS will resolve eld [2023-06-12 12:29:45,738 INFO L189 MonitoredProcess]: No working directory specified, using eld [2023-06-12 12:29:45,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with eld -disj -ssol /tmp/eldarica_5560659384795465738.smt2 (exit command is null, workingDir is null) [2023-06-12 12:29:45,752 INFO L327 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_5560659384795465738.smt2 (2)] Waiting until timeout for monitored process [2023-06-12 12:48:41,379 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: out of memory at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.lib.chc.EldaricaCliChcScript.solve(EldaricaCliChcScript.java:107) at de.uni_freiburg.informatik.ultimate.lib.chc.EldaricaCliChcScript.solve(EldaricaCliChcScript.java:81) at de.uni_freiburg.informatik.ultimate.plugins.chcsolver.ChcSolverObserver.process(ChcSolverObserver.java:86) 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-06-12 12:48:41,384 INFO L158 Benchmark]: Toolchain (without parser) took 1136602.84ms. Allocated memory is still 316.7MB. Free memory was 268.6MB in the beginning and 233.5MB in the end (delta: 35.1MB). Peak memory consumption was 34.9MB. Max. memory is 15.0GB. [2023-06-12 12:48:41,384 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 316.7MB. Free memory is still 269.7MB. There was no memory consumed. Max. memory is 15.0GB. [2023-06-12 12:48:41,385 INFO L158 Benchmark]: Boogie Preprocessor took 32.59ms. Allocated memory is still 316.7MB. Free memory was 268.6MB in the beginning and 266.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 12:48:41,385 INFO L158 Benchmark]: RCFGBuilder took 250.73ms. Allocated memory is still 316.7MB. Free memory was 266.7MB in the beginning and 257.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-06-12 12:48:41,386 INFO L158 Benchmark]: IcfgToChc took 626.36ms. Allocated memory is still 316.7MB. Free memory was 257.5MB in the beginning and 246.1MB in the end (delta: 11.3MB). Peak memory consumption was 13.9MB. Max. memory is 15.0GB. [2023-06-12 12:48:41,386 INFO L158 Benchmark]: ChcSmtPrinter took 26.15ms. Allocated memory is still 316.7MB. Free memory was 246.1MB in the beginning and 240.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. [2023-06-12 12:48:41,387 INFO L158 Benchmark]: ChcSolver took 1135662.03ms. Allocated memory is still 316.7MB. Free memory was 240.9MB in the beginning and 233.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-06-12 12:48:41,390 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.17ms. Allocated memory is still 316.7MB. Free memory is still 269.7MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 32.59ms. Allocated memory is still 316.7MB. Free memory was 268.6MB in the beginning and 266.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 250.73ms. Allocated memory is still 316.7MB. Free memory was 266.7MB in the beginning and 257.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 626.36ms. Allocated memory is still 316.7MB. Free memory was 257.5MB in the beginning and 246.1MB in the end (delta: 11.3MB). Peak memory consumption was 13.9MB. Max. memory is 15.0GB. * ChcSmtPrinter took 26.15ms. Allocated memory is still 316.7MB. Free memory was 246.1MB in the beginning and 240.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. * ChcSolver took 1135662.03ms. Allocated memory is still 316.7MB. Free memory was 240.9MB in the beginning and 233.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - ExceptionOrErrorResult: SMTLIBException: out of memory de.uni_freiburg.informatik.ultimate.plugins.chcsolver: SMTLIBException: out of memory: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-06-12 12:48:41,407 WARN L435 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_5560659384795465738.smt2 (2)] Forcibly destroying the process [2023-06-12 12:48:41,576 INFO L540 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_5560659384795465738.smt2 (2)] Forceful destruction successful, exit code 0 [2023-06-12 12:48:41,580 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...