/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 GOLEM --chcsolver.produce.chc.model.if.query.is.sat true --chcsolver.produce.derivation.if.query.is.unsat false --chcsolver.produce.unsat.core.if.query.is.unsat false -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 10:59:46,043 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 10:59:46,122 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 10:59:46,130 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 10:59:46,131 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 10:59:46,131 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 10:59:46,132 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 10:59:46,132 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 10:59:46,133 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 10:59:46,137 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 10:59:46,138 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 10:59:46,138 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 10:59:46,138 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 10:59:46,140 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 10:59:46,140 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 10:59:46,140 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 -> GOLEM 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce UNSAT core if query is UNSAT -> false [2023-06-12 10:59:46,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 10:59:46,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 10:59:46,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 10:59:46,408 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 10:59:46,410 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 10:59:46,412 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 10:59:46,412 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-12 10:59:46,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 10:59:46,436 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-06-12 10:59:46,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 10:59:46,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 10:59:46,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 10:59:46,453 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,454 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,461 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,462 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,465 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,468 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,468 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,469 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 10:59:46,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 10:59:46,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 10:59:46,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 10:59:46,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 10:59:46" (1/1) ... [2023-06-12 10:59:46,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 10:59:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 10:59:46,502 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 10:59:46,516 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 10:59:46,540 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 10:59:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 10:59:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 10:59:46,582 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 10:59:46,584 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 10:59:46,586 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-12 10:59:46,642 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 10:59:46,659 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 10:59:46,660 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 10:59:46,661 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 10:59:46 BoogieIcfgContainer [2023-06-12 10:59:46,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 10:59:46,662 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 10:59:46,662 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 10:59:46,662 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 10:59:46,667 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 10:59:46" (1/1) ... [2023-06-12 10:59:46,907 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,916 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 10:59:46,917 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,920 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,923 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,925 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,927 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,929 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,931 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 10:59:46,934 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 10:59:46,967 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:46,973 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 10:59:46,977 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:46,980 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:46,990 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 10:59:46,996 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:47,006 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:47,010 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:47,017 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 10:59:47,044 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 10:59:47,059 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 10:59:47,062 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 10:59:47,063 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 10:59:47,066 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 10:59:47,068 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 10:59:47,070 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 10:59:47,071 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 10:59:47,073 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 10:59:47,075 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 10:59:47,077 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-12 10:59:47,099 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 10:59:47,104 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 10:59:47,105 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 10:59:47,110 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 10:59:47,112 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 10:59:47,114 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 10:59:47,115 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 10:59:47,116 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 10:59:47,118 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 10:59:47,120 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-12 10:59:47,128 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,131 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 10:59:47,132 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,133 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,135 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,137 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,138 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,140 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,141 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,143 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-12 10:59:47,151 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,154 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 10:59:47,155 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,156 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,158 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 10:59:47,159 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 10:59:47,161 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,162 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,163 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,165 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-12 10:59:47,174 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 10:59:47,182 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 10:59:47,185 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 10:59:47,187 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 10:59:47,190 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 10:59:47,192 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 10:59:47,194 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 10:59:47,196 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 10:59:47,198 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 10:59:47,200 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 10:59:47,208 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,212 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 10:59:47,214 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,219 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,222 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,228 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,231 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,235 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 10:59:47,237 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 10:59:47,247 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 10:59:47,249 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 10:59:47,249 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 10:59:47,250 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 10:59:47,252 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 10:59:47,256 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 10:59:47,258 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 10:59:47,260 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 10:59:47,261 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 10:59:47,266 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 10:59:47,274 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,281 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 10:59:47,283 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,285 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,290 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,291 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,293 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,295 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,297 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,298 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-12 10:59:47,306 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 10:59:47,308 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 10:59:47,309 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 10:59:47,310 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 10:59:47,311 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 10:59:47,315 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 10:59:47,316 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 10:59:47,318 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 10:59:47,319 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 10:59:47,320 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 10:59:47,373 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 10:59:47 HornClauseAST [2023-06-12 10:59:47,373 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 10:59:47,374 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 10:59:47,374 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 10:59:47,374 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 10:59:47,375 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 10:59:47" (1/1) ... [2023-06-12 10:59:47,376 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID5212976690198420661.smt2 [2023-06-12 10:59:47,426 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 10:59:47,427 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-06-12 10:59:47,427 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-06-12 10:59:47,427 INFO L274 PluginConnector]: ChcSolver initialized [2023-06-12 10:59:47,429 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 10:59:47" (1/1) ... [2023-06-12 10:59:47,429 INFO L88 GolemChcScript]: Writing script to file /tmp/golem_1589180392210267475.smt2 [2023-06-12 10:59:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem [2023-06-12 10:59:47,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem --print-witness /tmp/golem_1589180392210267475.smt2 (exit command is null, workingDir is null) [2023-06-12 10:59:47,476 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: golem (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem --print-witness /tmp/golem_1589180392210267475.smt2 (2) without exit command) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.lib.chc.GolemChcScript.solve(GolemChcScript.java:107) at de.uni_freiburg.informatik.ultimate.lib.chc.GolemChcScript.solve(GolemChcScript.java:79) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) 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) ... 17 more [2023-06-12 10:59:47,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem --print-witness /tmp/golem_1589180392210267475.smt2 (2)] Waiting until timeout for monitored process [2023-06-12 10:59:47,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem --print-witness /tmp/golem_1589180392210267475.smt2 (2)] Ended with exit code 134 [2023-06-12 10:59:47,481 INFO L158 Benchmark]: Toolchain (without parser) took 1044.62ms. Allocated memory is still 325.1MB. Free memory was 282.0MB in the beginning and 244.1MB in the end (delta: 38.0MB). Peak memory consumption was 39.1MB. Max. memory is 15.0GB. [2023-06-12 10:59:47,483 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 325.1MB. Free memory is still 283.0MB. There was no memory consumed. Max. memory is 15.0GB. [2023-06-12 10:59:47,484 INFO L158 Benchmark]: Boogie Preprocessor took 33.46ms. Allocated memory is still 325.1MB. Free memory was 281.9MB in the beginning and 280.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 10:59:47,484 INFO L158 Benchmark]: RCFGBuilder took 190.27ms. Allocated memory is still 325.1MB. Free memory was 280.0MB in the beginning and 270.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-06-12 10:59:47,485 INFO L158 Benchmark]: IcfgToChc took 711.09ms. Allocated memory is still 325.1MB. Free memory was 270.6MB in the beginning and 253.9MB in the end (delta: 16.8MB). Peak memory consumption was 20.2MB. Max. memory is 15.0GB. [2023-06-12 10:59:47,485 INFO L158 Benchmark]: ChcSmtPrinter took 52.53ms. Allocated memory is still 325.1MB. Free memory was 253.9MB in the beginning and 247.1MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. [2023-06-12 10:59:47,486 INFO L158 Benchmark]: ChcSolver took 53.09ms. Allocated memory is still 325.1MB. Free memory was 247.1MB in the beginning and 244.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 10:59:47,489 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.20ms. Allocated memory is still 325.1MB. Free memory is still 283.0MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 33.46ms. Allocated memory is still 325.1MB. Free memory was 281.9MB in the beginning and 280.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 190.27ms. Allocated memory is still 325.1MB. Free memory was 280.0MB in the beginning and 270.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 711.09ms. Allocated memory is still 325.1MB. Free memory was 270.6MB in the beginning and 253.9MB in the end (delta: 16.8MB). Peak memory consumption was 20.2MB. Max. memory is 15.0GB. * ChcSmtPrinter took 52.53ms. Allocated memory is still 325.1MB. Free memory was 253.9MB in the beginning and 247.1MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. * ChcSolver took 53.09ms. Allocated memory is still 325.1MB. Free memory was 247.1MB in the beginning and 244.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - ExceptionOrErrorResult: SMTLIBException: golem (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem --print-witness /tmp/golem_1589180392210267475.smt2 (2) without exit command) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.chcsolver: SMTLIBException: golem (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/golem --print-witness /tmp/golem_1589180392210267475.smt2 (2) without exit command) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-06-12 10:59:47,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...