/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 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 09:45:10,364 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 09:45:10,431 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 09:45:10,440 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 09:45:10,441 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 09:45:10,442 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 09:45:10,442 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 09:45:10,443 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 09:45:10,443 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 09:45:10,448 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 09:45:10,448 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 09:45:10,448 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 09:45:10,449 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 09:45:10,450 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 09:45:10,450 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 09:45:10,451 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 -> 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 09:45:10,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 09:45:10,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 09:45:10,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 09:45:10,729 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 09:45:10,730 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 09:45:10,732 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 09:45:10,732 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-12 09:45:10,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 09:45:10,759 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-06-12 09:45:10,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 09:45:10,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 09:45:10,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 09:45:10,775 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,777 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,784 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,785 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,788 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,790 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,790 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,791 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 09:45:10" (1/1) ... [2023-06-12 09:45:10,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 09:45:10,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 09:45:10,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 09:45:10,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 09:45:10,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 09:45:10" (1/1) ... [2023-06-12 09:45:10,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 09:45:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 09:45:10,823 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 09:45:10,833 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 09:45:10,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 09:45:10,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 09:45:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 09:45:10,909 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 09:45:10,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 09:45:10,914 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-12 09:45:10,992 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 09:45:11,012 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 09:45:11,012 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 09:45:11,014 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 09:45:11 BoogieIcfgContainer [2023-06-12 09:45:11,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 09:45:11,015 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 09:45:11,016 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 09:45:11,016 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 09:45:11,017 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 09:45:11" (1/1) ... [2023-06-12 09:45:11,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,240 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 09:45:11,242 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,244 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,247 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,249 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,251 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,253 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,255 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 09:45:11,258 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 09:45:11,286 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,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 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,311 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,315 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,327 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 09:45:11,330 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,333 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,336 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,339 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 09:45:11,354 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 09:45:11,389 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 09:45:11,397 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 09:45:11,399 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 09:45:11,403 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 09:45:11,414 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 09:45:11,416 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 09:45:11,417 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 09:45:11,419 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 09:45:11,421 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 09:45:11,423 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-12 09:45:11,437 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 09:45:11,440 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 09:45:11,441 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 09:45:11,443 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 09:45:11,444 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 09:45:11,446 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 09:45:11,448 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 09:45:11,449 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 09:45:11,450 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 09:45:11,452 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-12 09:45:11,460 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,463 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 09:45:11,464 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,466 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,468 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,469 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,471 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,472 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,474 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-12 09:45:11,483 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,485 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 09:45:11,486 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,488 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,490 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 09:45:11,491 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 09:45:11,492 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,500 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,503 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,506 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-12 09:45:11,516 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 09:45:11,525 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: false [2023-06-12 09:45:11,527 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 09:45:11,529 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 09:45:11,531 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 09:45:11,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 09:45:11,535 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 09:45:11,537 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 09:45:11,539 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 09:45:11,542 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 09:45:11,553 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,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 09:45:11,558 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,563 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,566 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,568 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,570 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,573 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,575 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 09:45:11,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 09:45:11,591 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 09:45:11,593 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 09:45:11,594 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 09:45:11,595 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 09:45:11,596 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 09:45:11,603 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 09:45:11,604 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 09:45:11,605 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 09:45:11,606 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 09:45:11,611 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 09:45:11,619 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,622 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 09:45:11,625 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,629 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,632 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,634 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,635 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,636 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,638 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,639 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-12 09:45:11,649 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 09:45:11,651 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 09:45:11,652 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 09:45:11,653 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 09:45:11,654 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 09:45:11,655 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 09:45:11,656 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 09:45:11,657 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 09:45:11,658 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 09:45:11,659 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 09:45:11,711 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 09:45:11 HornClauseAST [2023-06-12 09:45:11,711 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 09:45:11,712 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 09:45:11,712 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 09:45:11,712 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 09:45:11,713 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 09:45:11" (1/1) ... [2023-06-12 09:45:11,714 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID57874075940150650.smt2 [2023-06-12 09:45:11,748 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 09:45:11,749 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-06-12 09:45:11,749 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-06-12 09:45:11,749 INFO L274 PluginConnector]: ChcSolver initialized [2023-06-12 09:45:11,751 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 09:45:11" (1/1) ... [2023-06-12 09:45:11,752 WARN L147 ChcSolverObserver]: Derivation production is not supported by backend [2023-06-12 09:45:11,752 WARN L153 ChcSolverObserver]: UNSAT core production is not supported by backend [2023-06-12 09:45:11,753 INFO L90 EldaricaCliChcScript]: Writing script to file /tmp/eldarica_15838850630590537183.smt2 [2023-06-12 09:45:11,767 ERROR L181 MonitoredProcess]: Could not determine absolute path of external process, hoping that OS will resolve eld [2023-06-12 09:45:11,767 INFO L189 MonitoredProcess]: No working directory specified, using eld [2023-06-12 09:45:11,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with eld -disj -ssol /tmp/eldarica_15838850630590537183.smt2 (exit command is null, workingDir is null) [2023-06-12 09:45:11,779 INFO L327 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_15838850630590537183.smt2 (2)] Waiting until timeout for monitored process Received shutdown request... [2023-06-12 10:12:17,189 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-06-12 10:12:17,190 WARN L340 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_15838850630590537183.smt2 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-06-12 10:12:18,190 WARN L435 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_15838850630590537183.smt2 (2)] Forcibly destroying the process [2023-06-12 10:12:18,198 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 [2023-06-12 10:12:18,338 INFO L540 MonitoredProcess]: [MP eld -disj -ssol /tmp/eldarica_15838850630590537183.smt2 (2)] Forceful destruction successful, exit code 137 [2023-06-12 10:12:18,339 INFO L257 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver. Reason: Timeout or Toolchain cancelled by user [2023-06-12 10:12:18,341 INFO L158 Benchmark]: Toolchain (without parser) took 1627581.72ms. Allocated memory was 329.3MB in the beginning and 503.3MB in the end (delta: 174.1MB). Free memory was 282.2MB in the beginning and 467.3MB in the end (delta: -185.0MB). Peak memory consumption was 49.2MB. Max. memory is 15.0GB. [2023-06-12 10:12:18,342 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 329.3MB. Free memory is still 283.2MB. There was no memory consumed. Max. memory is 15.0GB. [2023-06-12 10:12:18,342 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 329.3MB. Free memory was 282.1MB in the beginning and 280.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 10:12:18,343 INFO L158 Benchmark]: RCFGBuilder took 221.99ms. Allocated memory is still 329.3MB. Free memory was 280.2MB in the beginning and 270.9MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. [2023-06-12 10:12:18,343 INFO L158 Benchmark]: IcfgToChc took 696.17ms. Allocated memory is still 329.3MB. Free memory was 270.8MB in the beginning and 252.4MB in the end (delta: 18.4MB). Peak memory consumption was 20.2MB. Max. memory is 15.0GB. [2023-06-12 10:12:18,344 INFO L158 Benchmark]: ChcSmtPrinter took 36.22ms. Allocated memory is still 329.3MB. Free memory was 252.4MB in the beginning and 245.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. [2023-06-12 10:12:18,344 INFO L158 Benchmark]: ChcSolver took 1626591.08ms. Allocated memory was 329.3MB in the beginning and 503.3MB in the end (delta: 174.1MB). Free memory was 245.3MB in the beginning and 467.3MB in the end (delta: -222.0MB). Peak memory consumption was 10.2MB. Max. memory is 15.0GB. [2023-06-12 10:12:18,346 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 329.3MB. Free memory is still 283.2MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 329.3MB. Free memory was 282.1MB in the beginning and 280.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 221.99ms. Allocated memory is still 329.3MB. Free memory was 280.2MB in the beginning and 270.9MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. * IcfgToChc took 696.17ms. Allocated memory is still 329.3MB. Free memory was 270.8MB in the beginning and 252.4MB in the end (delta: 18.4MB). Peak memory consumption was 20.2MB. Max. memory is 15.0GB. * ChcSmtPrinter took 36.22ms. Allocated memory is still 329.3MB. Free memory was 252.4MB in the beginning and 245.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. * ChcSolver took 1626591.08ms. Allocated memory was 329.3MB in the beginning and 503.3MB in the end (delta: 174.1MB). Free memory was 245.3MB in the beginning and 467.3MB in the end (delta: -222.0MB). Peak memory consumption was 10.2MB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.chcsolver) Toolchain cancelled while executing Executor. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown