/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 -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-fe2097d-m [2023-05-31 12:44:30,835 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-05-31 12:44:30,926 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 12:44:30,936 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-31 12:44:30,937 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-05-31 12:44:30,938 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-05-31 12:44:30,938 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-31 12:44:30,939 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-05-31 12:44:30,939 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-05-31 12:44:30,945 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-05-31 12:44:30,945 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-05-31 12:44:30,945 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-05-31 12:44:30,946 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-05-31 12:44:30,947 INFO L137 SettingsManager]: * Save file in source directory=true [2023-05-31 12:44:30,947 INFO L137 SettingsManager]: * Use automatic naming=true [2023-05-31 12:44:30,947 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 [2023-05-31 12:44:31,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-31 12:44:31,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-31 12:44:31,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-31 12:44:31,249 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-31 12:44:31,250 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-31 12:44:31,252 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 12:44:31,252 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-05-31 12:44:31,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-31 12:44:31,278 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-31 12:44:31,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-31 12:44:31,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-31 12:44:31,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-05-31 12:44:31,291 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,291 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,295 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,296 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,297 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,300 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,300 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,301 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-31 12:44:31,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-31 12:44:31,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-05-31 12:44:31,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-05-31 12:44:31,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 12:44:31" (1/1) ... [2023-05-31 12:44:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-05-31 12:44:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-31 12:44:31,330 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 12:44:31,354 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 12:44:31,374 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-31 12:44:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-31 12:44:31,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-31 12:44:31,432 INFO L236 CfgBuilder]: Building ICFG [2023-05-31 12:44:31,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-31 12:44:31,436 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-05-31 12:44:31,491 INFO L277 CfgBuilder]: Performing block encoding [2023-05-31 12:44:31,511 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-31 12:44:31,511 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-31 12:44:31,513 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 12:44:31 BoogieIcfgContainer [2023-05-31 12:44:31,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-31 12:44:31,514 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-05-31 12:44:31,514 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-05-31 12:44:31,514 INFO L274 PluginConnector]: IcfgToChc initialized [2023-05-31 12:44:31,516 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 12:44:31" (1/1) ... [2023-05-31 12:44:31,750 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,763 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 12:44:31,766 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,773 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,783 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,786 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,791 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,794 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,797 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 12:44:31,803 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 12:44:31,853 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,873 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 12:44:31,880 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,887 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,892 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 12:44:31,897 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,902 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,910 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,918 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 12:44:31,937 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 12:44:31,956 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-05-31 12:44:31,961 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 12:44:31,963 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-05-31 12:44:31,971 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-05-31 12:44:31,975 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-05-31 12:44:31,977 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-05-31 12:44:31,979 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-05-31 12:44:31,984 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-05-31 12:44:31,988 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-05-31 12:44:31,990 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-05-31 12:44:32,023 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-05-31 12:44:32,025 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 12:44:32,028 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-05-31 12:44:32,031 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-05-31 12:44:32,034 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-05-31 12:44:32,039 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-05-31 12:44:32,042 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-05-31 12:44:32,044 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-05-31 12:44:32,045 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-05-31 12:44:32,047 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-05-31 12:44:32,063 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,066 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 12:44:32,067 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,069 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,071 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,073 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,076 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,078 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,080 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,081 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-05-31 12:44:32,093 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,095 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 12:44:32,096 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,097 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,099 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-05-31 12:44:32,101 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-05-31 12:44:32,102 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,107 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,109 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,111 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-05-31 12:44:32,123 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 12:44:32,132 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 12:44:32,135 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 12:44:32,139 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 12:44:32,142 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 12:44:32,145 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 12:44:32,147 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 12:44:32,150 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 12:44:32,151 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 12:44:32,155 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 12:44:32,163 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,166 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 12:44:32,167 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,170 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,172 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,173 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,174 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,176 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,177 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-05-31 12:44:32,179 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 12:44:32,185 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 12:44:32,186 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 12:44:32,187 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 12:44:32,188 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-05-31 12:44:32,189 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-05-31 12:44:32,190 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-05-31 12:44:32,191 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-05-31 12:44:32,192 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-05-31 12:44:32,192 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-05-31 12:44:32,196 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-05-31 12:44:32,201 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,203 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 12:44:32,204 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,208 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,210 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,211 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,212 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,213 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,214 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,216 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-05-31 12:44:32,223 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 12:44:32,225 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 12:44:32,226 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 12:44:32,227 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-05-31 12:44:32,228 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-05-31 12:44:32,229 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-05-31 12:44:32,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-05-31 12:44:32,231 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-05-31 12:44:32,232 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-05-31 12:44:32,234 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-05-31 12:44:32,288 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 12:44:32 HornClauseAST [2023-05-31 12:44:32,288 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-05-31 12:44:32,289 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-05-31 12:44:32,289 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-05-31 12:44:32,289 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-05-31 12:44:32,290 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 12:44:32" (1/1) ... [2023-05-31 12:44:32,290 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID16258834257691268055.smt2 [2023-05-31 12:44:32,342 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-05-31 12:44:32,343 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-05-31 12:44:32,343 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-05-31 12:44:32,343 INFO L274 PluginConnector]: ChcSolver initialized [2023-05-31 12:44:32,345 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 12:44:32" (1/1) ... [2023-05-31 12:44:32,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-05-31 12:44:32,379 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 12:44:32,384 INFO L158 Benchmark]: Toolchain (without parser) took 1104.62ms. Allocated memory is still 352.3MB. Free memory was 329.0MB in the beginning and 282.6MB in the end (delta: 46.4MB). Peak memory consumption was 48.6MB. Max. memory is 15.0GB. [2023-05-31 12:44:32,385 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 352.3MB. Free memory was 330.1MB in the beginning and 329.9MB in the end (delta: 167.5kB). There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 12:44:32,386 INFO L158 Benchmark]: Boogie Preprocessor took 23.48ms. Allocated memory is still 352.3MB. Free memory was 329.0MB in the beginning and 327.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-05-31 12:44:32,387 INFO L158 Benchmark]: RCFGBuilder took 210.15ms. Allocated memory is still 352.3MB. Free memory was 327.0MB in the beginning and 317.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-05-31 12:44:32,388 INFO L158 Benchmark]: IcfgToChc took 774.08ms. Allocated memory is still 352.3MB. Free memory was 317.6MB in the beginning and 292.0MB in the end (delta: 25.5MB). Peak memory consumption was 27.6MB. Max. memory is 15.0GB. [2023-05-31 12:44:32,389 INFO L158 Benchmark]: ChcSmtPrinter took 53.74ms. Allocated memory is still 352.3MB. Free memory was 292.0MB in the beginning and 284.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-05-31 12:44:32,390 INFO L158 Benchmark]: ChcSolver took 39.14ms. Allocated memory is still 352.3MB. Free memory was 284.7MB in the beginning and 282.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-05-31 12:44:32,397 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.18ms. Allocated memory is still 352.3MB. Free memory was 330.1MB in the beginning and 329.9MB in the end (delta: 167.5kB). There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 23.48ms. Allocated memory is still 352.3MB. Free memory was 329.0MB in the beginning and 327.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 210.15ms. Allocated memory is still 352.3MB. Free memory was 327.0MB in the beginning and 317.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 774.08ms. Allocated memory is still 352.3MB. Free memory was 317.6MB in the beginning and 292.0MB in the end (delta: 25.5MB). Peak memory consumption was 27.6MB. Max. memory is 15.0GB. * ChcSmtPrinter took 53.74ms. Allocated memory is still 352.3MB. Free memory was 292.0MB in the beginning and 284.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * ChcSolver took 39.14ms. Allocated memory is still 352.3MB. Free memory was 284.7MB in the beginning and 282.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 12:44:32,424 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...