/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/thread-pooling/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularVerifier.xml --chcsolver.chc.solver.backend TREEAUTOMIZER --chcsolver.produce.chc.model.if.query.is.sat false --chcsolver.produce.derivation.if.query.is.unsat false --chcsolver.produce.unsat.core.if.query.is.unsat true --treeautomizer.smt.solver Internal_SMTInterpol -i ../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-645efe7-m [2023-05-31 18:20:49,304 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-05-31 18:20:49,377 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/ThreadModularVerifier.Settings.epf [2023-05-31 18:20:49,383 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-31 18:20:49,385 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-05-31 18:20:49,385 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-05-31 18:20:49,386 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-31 18:20:49,386 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-05-31 18:20:49,386 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-05-31 18:20:49,393 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-05-31 18:20:49,393 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-05-31 18:20:49,393 INFO L137 SettingsManager]: * Assume program has a precondition=false [2023-05-31 18:20:49,394 INFO L137 SettingsManager]: * Conditional Independence=PRECOMPUTED_CONDITIONS [2023-05-31 18:20:49,396 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-05-31 18:20:49,396 INFO L137 SettingsManager]: * Save file in source directory=true [2023-05-31 18:20:49,396 INFO L137 SettingsManager]: * Use automatic naming=true [2023-05-31 18:20:49,396 INFO L137 SettingsManager]: * File name=CHC_conditional WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: CHC solver backend -> TREEAUTOMIZER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce CHC model if query is SAT -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce derivation if query is UNSAT -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce UNSAT core if query is UNSAT -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer: SMT solver -> Internal_SMTInterpol [2023-05-31 18:20:49,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-31 18:20:49,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-31 18:20:49,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-31 18:20:49,624 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-31 18:20:49,625 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-31 18:20:49,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl [2023-05-31 18:20:49,626 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl' [2023-05-31 18:20:49,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-31 18:20:49,655 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-31 18:20:49,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-31 18:20:49,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-31 18:20:49,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-05-31 18:20:49,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-31 18:20:49,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-31 18:20:49,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-05-31 18:20:49,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-05-31 18:20:49,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-05-31 18:20:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-31 18:20:49,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-05-31 18:20:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-05-31 18:20:49,756 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-31 18:20:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-31 18:20:49,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-31 18:20:49,801 INFO L236 CfgBuilder]: Building ICFG [2023-05-31 18:20:49,802 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-31 18:20:49,889 INFO L277 CfgBuilder]: Performing block encoding [2023-05-31 18:20:49,898 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-31 18:20:49,899 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-31 18:20:49,901 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 06:20:49 BoogieIcfgContainer [2023-05-31 18:20:49,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-31 18:20:49,901 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-05-31 18:20:49,902 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-05-31 18:20:49,902 INFO L274 PluginConnector]: IcfgToChc initialized [2023-05-31 18:20:49,904 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 06:20:49" (1/1) ... [2023-05-31 18:20:50,095 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,098 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,101 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,104 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,106 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,152 INFO L167 QuantifierPusher]: treesize reduction 6, result has 33.3 percent of original size [2023-05-31 18:20:50,153 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-05-31 18:20:50,155 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume m == false;m := true;' is: false [2023-05-31 18:20:50,159 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,163 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,170 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,178 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,182 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,201 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,207 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,208 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,210 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,216 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,218 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,222 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,225 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,237 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,240 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-05-31 18:20:50,270 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'c := next;' is: true [2023-05-31 18:20:50,272 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'c := next;' is: true [2023-05-31 18:20:50,274 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'c := next;' is: true [2023-05-31 18:20:50,276 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'c := next;' is: true [2023-05-31 18:20:50,278 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'c := next;' is: true [2023-05-31 18:20:50,279 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'c := next;' is: true [2023-05-31 18:20:50,281 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'c := next;' is: true [2023-05-31 18:20:50,283 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'c := next;' is: true [2023-05-31 18:20:50,285 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,288 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,290 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,292 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,294 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'c := next;' is: true [2023-05-31 18:20:50,296 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := next;' is: true [2023-05-31 18:20:50,297 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'c := next;' is: true [2023-05-31 18:20:50,299 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'c := next;' is: true [2023-05-31 18:20:50,319 INFO L167 QuantifierPusher]: treesize reduction 6, result has 71.4 percent of original size [2023-05-31 18:20:50,321 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-05-31 18:20:50,322 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'c := next;' is: false [2023-05-31 18:20:50,324 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'c := next;' is: true [2023-05-31 18:20:50,326 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,328 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,330 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,332 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-05-31 18:20:50,348 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,351 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'next := next + 10;' is: true [2023-05-31 18:20:50,352 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,366 INFO L167 QuantifierPusher]: treesize reduction 6, result has 70.0 percent of original size [2023-05-31 18:20:50,368 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2023-05-31 18:20:50,393 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'next := next + 10;' is: (<= (+ next 10) len) [2023-05-31 18:20:50,398 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'next := next + 10;' is: true [2023-05-31 18:20:50,400 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,402 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'next := next + 10;' is: true [2023-05-31 18:20:50,408 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,413 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,414 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,417 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,418 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,420 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'next := next + 10;' is: true [2023-05-31 18:20:50,421 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,423 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,435 INFO L167 QuantifierPusher]: treesize reduction 6, result has 71.4 percent of original size [2023-05-31 18:20:50,436 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-05-31 18:20:50,437 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'next := next + 10;' is: false [2023-05-31 18:20:50,439 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,456 INFO L167 QuantifierPusher]: treesize reduction 6, result has 71.4 percent of original size [2023-05-31 18:20:50,457 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-05-31 18:20:50,458 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'next := next + 10;' is: false [2023-05-31 18:20:50,461 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,463 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,465 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,466 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-05-31 18:20:50,476 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,477 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume next <= len;' is: true [2023-05-31 18:20:50,478 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,479 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,481 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume next <= len;' is: true [2023-05-31 18:20:50,482 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,483 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume next <= len;' is: true [2023-05-31 18:20:50,484 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,485 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,487 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,488 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,489 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,491 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume next <= len;' is: true [2023-05-31 18:20:50,491 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,493 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,494 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,495 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,496 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,497 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,499 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,500 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,501 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-05-31 18:20:50,513 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,515 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,516 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,517 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,519 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,521 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,522 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,524 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,526 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,527 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,529 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,531 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,532 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,533 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,534 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,535 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,550 INFO L167 QuantifierPusher]: treesize reduction 6, result has 70.0 percent of original size [2023-05-31 18:20:50,552 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2023-05-31 18:20:50,562 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(next <= len);' is: (< len next) [2023-05-31 18:20:50,564 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,569 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,573 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,575 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,579 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-05-31 18:20:50,588 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := next;' is: true [2023-05-31 18:20:50,589 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := next;' is: true [2023-05-31 18:20:50,590 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := next;' is: true [2023-05-31 18:20:50,591 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := next;' is: true [2023-05-31 18:20:50,592 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := next;' is: true [2023-05-31 18:20:50,593 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := next;' is: true [2023-05-31 18:20:50,594 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := next;' is: true [2023-05-31 18:20:50,595 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := next;' is: true [2023-05-31 18:20:50,598 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,601 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,603 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,604 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,605 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := next;' is: true [2023-05-31 18:20:50,606 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := next;' is: true [2023-05-31 18:20:50,607 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := next;' is: true [2023-05-31 18:20:50,608 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := next;' is: true [2023-05-31 18:20:50,618 INFO L167 QuantifierPusher]: treesize reduction 6, result has 71.4 percent of original size [2023-05-31 18:20:50,619 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-05-31 18:20:50,619 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := next;' is: false [2023-05-31 18:20:50,620 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := next;' is: true [2023-05-31 18:20:50,621 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,622 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,623 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,625 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-05-31 18:20:50,634 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := len;' is: true [2023-05-31 18:20:50,635 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := len;' is: true [2023-05-31 18:20:50,637 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := len;' is: true [2023-05-31 18:20:50,638 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := len;' is: true [2023-05-31 18:20:50,638 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := len;' is: true [2023-05-31 18:20:50,639 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := len;' is: true [2023-05-31 18:20:50,640 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := len;' is: true [2023-05-31 18:20:50,641 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := len;' is: true [2023-05-31 18:20:50,643 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,644 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,645 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,646 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,647 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := len;' is: true [2023-05-31 18:20:50,648 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := len;' is: true [2023-05-31 18:20:50,649 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := len;' is: true [2023-05-31 18:20:50,650 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := len;' is: true [2023-05-31 18:20:50,651 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := len;' is: true [2023-05-31 18:20:50,653 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := len;' is: true [2023-05-31 18:20:50,655 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,658 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,660 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,662 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-05-31 18:20:50,669 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'm := false;' is: true [2023-05-31 18:20:50,670 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'm := false;' is: true [2023-05-31 18:20:50,671 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'm := false;' is: true [2023-05-31 18:20:50,672 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'm := false;' is: true [2023-05-31 18:20:50,673 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'm := false;' is: true [2023-05-31 18:20:50,675 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'm := false;' is: true [2023-05-31 18:20:50,676 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'm := false;' is: true [2023-05-31 18:20:50,687 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-05-31 18:20:50,689 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-05-31 18:20:50,690 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'm := false;' is: false [2023-05-31 18:20:50,692 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,693 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,694 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,695 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,696 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'm := false;' is: true [2023-05-31 18:20:50,697 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'm := false;' is: true [2023-05-31 18:20:50,698 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'm := false;' is: true [2023-05-31 18:20:50,700 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'm := false;' is: true [2023-05-31 18:20:50,701 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'm := false;' is: true [2023-05-31 18:20:50,706 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'm := false;' is: true [2023-05-31 18:20:50,707 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,708 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,710 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,713 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-05-31 18:20:50,724 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,725 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,726 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,727 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,728 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,735 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,736 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,737 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,739 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,740 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,741 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,742 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,748 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,749 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,750 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,755 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,757 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,758 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,759 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,760 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,761 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,772 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-05-31 18:20:50,779 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume c < end;' is: true [2023-05-31 18:20:50,780 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume c < end;' is: true [2023-05-31 18:20:50,781 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume c < end;' is: true [2023-05-31 18:20:50,782 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume c < end;' is: true [2023-05-31 18:20:50,783 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume c < end;' is: true [2023-05-31 18:20:50,784 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume c < end;' is: true [2023-05-31 18:20:50,785 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume c < end;' is: true [2023-05-31 18:20:50,786 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume c < end;' is: true [2023-05-31 18:20:50,787 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,788 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,789 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,790 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,791 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume c < end;' is: true [2023-05-31 18:20:50,792 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < end;' is: true [2023-05-31 18:20:50,793 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume c < end;' is: true [2023-05-31 18:20:50,794 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume c < end;' is: true [2023-05-31 18:20:50,795 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume c < end;' is: true [2023-05-31 18:20:50,796 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume c < end;' is: true [2023-05-31 18:20:50,798 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,799 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,801 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,802 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-05-31 18:20:50,809 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;' is: true [2023-05-31 18:20:50,809 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;' is: true [2023-05-31 18:20:50,810 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;' is: true [2023-05-31 18:20:50,811 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;' is: true [2023-05-31 18:20:50,812 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;' is: true [2023-05-31 18:20:50,812 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;' is: true [2023-05-31 18:20:50,813 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;' is: true [2023-05-31 18:20:50,814 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;' is: true [2023-05-31 18:20:50,815 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,816 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,817 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,818 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,819 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;' is: true [2023-05-31 18:20:50,820 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:50,821 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;' is: true [2023-05-31 18:20:50,821 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;' is: true [2023-05-31 18:20:50,822 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;' is: true [2023-05-31 18:20:50,823 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;' is: true [2023-05-31 18:20:50,824 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,825 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,826 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,827 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-05-31 18:20:50,834 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,836 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,837 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,838 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,838 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,839 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,849 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-05-31 18:20:50,850 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2023-05-31 18:20:50,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 280 [2023-05-31 18:20:50,905 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 0];' is: (not (= ULTIMATE.start_~~left~~c ULTIMATE.start_~~right~~c)) [2023-05-31 18:20:50,906 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,908 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,909 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,910 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,911 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,913 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,918 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,920 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,921 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,922 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,922 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,924 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,925 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,926 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,927 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-05-31 18:20:50,935 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := c;' is: true [2023-05-31 18:20:50,936 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := c;' is: true [2023-05-31 18:20:50,937 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := c;' is: true [2023-05-31 18:20:50,938 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := c;' is: true [2023-05-31 18:20:50,938 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := c;' is: true [2023-05-31 18:20:50,939 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := c;' is: true [2023-05-31 18:20:50,940 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := c;' is: true [2023-05-31 18:20:50,941 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := c;' is: true [2023-05-31 18:20:50,942 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,943 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,944 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,945 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,946 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := c;' is: true [2023-05-31 18:20:50,947 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := c;' is: true [2023-05-31 18:20:50,948 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := c;' is: true [2023-05-31 18:20:50,949 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := c;' is: true [2023-05-31 18:20:50,950 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := c;' is: true [2023-05-31 18:20:50,951 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := c;' is: true [2023-05-31 18:20:50,952 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,953 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,954 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,955 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-05-31 18:20:50,963 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,965 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:50,966 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,967 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,968 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:50,969 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,970 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:50,971 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,972 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,973 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,974 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,975 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,977 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:50,979 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,980 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,981 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,982 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,984 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,985 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,987 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,988 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,989 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,995 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,996 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:50,997 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,998 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:50,999 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,000 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,001 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,002 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,003 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,004 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,005 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,006 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,007 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,008 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,009 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,010 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,011 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,012 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,013 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,014 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,016 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,017 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,023 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,024 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,025 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,026 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,027 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,028 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,029 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,030 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,031 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,032 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,033 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,034 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,035 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,037 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,038 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,040 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,041 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,043 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,044 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,046 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,047 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,048 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,054 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,055 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,056 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,057 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,058 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,059 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,060 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,061 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,062 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,063 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,064 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,065 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,066 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,067 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,068 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,069 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,070 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,071 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,072 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,074 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,075 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,076 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,081 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,082 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,083 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,084 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,085 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,086 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,088 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,089 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,091 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,092 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,094 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,095 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,096 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,097 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,098 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,099 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,100 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,101 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,102 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,103 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,104 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,105 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,112 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,113 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,114 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,115 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,116 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,117 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,118 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,119 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,120 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,121 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,122 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,124 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,125 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,125 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,126 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,127 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,128 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,129 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,131 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,132 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,133 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,134 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,139 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,140 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,141 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,142 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,143 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-05-31 18:20:51,144 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,145 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,147 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,148 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,149 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,150 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,151 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,152 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-05-31 18:20:51,153 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,153 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,154 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,156 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,156 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,157 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,159 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,160 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,161 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-05-31 18:20:51,167 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,168 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,169 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,170 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,171 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,171 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,173 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,173 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,174 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,175 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,176 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,177 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,184 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-05-31 18:20:51,185 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2023-05-31 18:20:51,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2023-05-31 18:20:51,203 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 1];' is: (not (= ULTIMATE.start_~~left~~c ULTIMATE.start_~~right~~c)) [2023-05-31 18:20:51,203 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,204 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,205 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,206 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,207 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,208 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,209 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,210 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,211 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-05-31 18:20:51,216 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,217 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,218 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,220 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,221 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,221 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,222 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,225 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,226 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,227 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,228 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,229 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,231 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,232 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,233 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,234 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,235 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,236 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,237 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,238 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-05-31 18:20:51,304 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:51 HornClauseAST [2023-05-31 18:20:51,305 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-05-31 18:20:51,305 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-05-31 18:20:51,305 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-05-31 18:20:51,305 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-05-31 18:20:51,306 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:51" (1/1) ... [2023-05-31 18:20:51,307 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/CHC_conditional_thread-pooling.bpl_UID1162690905101095678.smt2 [2023-05-31 18:20:51,342 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-05-31 18:20:51,343 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-05-31 18:20:51,343 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-05-31 18:20:51,343 INFO L274 PluginConnector]: ChcSolver initialized [2023-05-31 18:20:51,344 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:51" (1/1) ... [2023-05-31 18:20:51,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-05-31 18:20:51,375 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver has thrown an exception: java.lang.UnsupportedOperationException: Proofs are not supported at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getProof(Scriptor.java:168) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:358) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.graph.TreeAutomizerCEGAR.retrieveInterpolantsMap(TreeAutomizerCEGAR.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.graph.TreeAutomizerCEGAR.iterate(TreeAutomizerCEGAR.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.TreeAutomizerChcScript.solve(TreeAutomizerChcScript.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.TreeAutomizerChcScript.solve(TreeAutomizerChcScript.java:82) at de.uni_freiburg.informatik.ultimate.plugins.chcsolver.ChcSolverObserver.process(ChcSolverObserver.java:77) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.DFSTreeWalker.runObserver(DFSTreeWalker.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-31 18:20:51,378 INFO L158 Benchmark]: Toolchain (without parser) took 1722.02ms. Allocated memory was 329.3MB in the beginning and 505.4MB in the end (delta: 176.2MB). Free memory was 278.3MB in the beginning and 447.4MB in the end (delta: -169.0MB). Peak memory consumption was 9.0MB. Max. memory is 15.0GB. [2023-05-31 18:20:51,378 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 329.3MB. Free memory is still 279.3MB. There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 18:20:51,379 INFO L158 Benchmark]: Boogie Preprocessor took 32.37ms. Allocated memory is still 329.3MB. Free memory was 278.2MB in the beginning and 276.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-05-31 18:20:51,379 INFO L158 Benchmark]: RCFGBuilder took 211.01ms. Allocated memory is still 329.3MB. Free memory was 276.2MB in the beginning and 267.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-05-31 18:20:51,380 INFO L158 Benchmark]: IcfgToChc took 1403.20ms. Allocated memory was 329.3MB in the beginning and 505.4MB in the end (delta: 176.2MB). Free memory was 267.0MB in the beginning and 461.1MB in the end (delta: -194.1MB). Peak memory consumption was 84.5MB. Max. memory is 15.0GB. [2023-05-31 18:20:51,380 INFO L158 Benchmark]: ChcSmtPrinter took 36.97ms. Allocated memory is still 505.4MB. Free memory was 461.1MB in the beginning and 450.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. [2023-05-31 18:20:51,380 INFO L158 Benchmark]: ChcSolver took 34.23ms. Allocated memory is still 505.4MB. Free memory was 450.7MB in the beginning and 447.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. [2023-05-31 18:20:51,383 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 329.3MB. Free memory is still 279.3MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 32.37ms. Allocated memory is still 329.3MB. Free memory was 278.2MB in the beginning and 276.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 211.01ms. Allocated memory is still 329.3MB. Free memory was 276.2MB in the beginning and 267.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 1403.20ms. Allocated memory was 329.3MB in the beginning and 505.4MB in the end (delta: 176.2MB). Free memory was 267.0MB in the beginning and 461.1MB in the end (delta: -194.1MB). Peak memory consumption was 84.5MB. Max. memory is 15.0GB. * ChcSmtPrinter took 36.97ms. Allocated memory is still 505.4MB. Free memory was 461.1MB in the beginning and 450.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. * ChcSolver took 34.23ms. Allocated memory is still 505.4MB. Free memory was 450.7MB in the beginning and 447.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - ExceptionOrErrorResult: UnsupportedOperationException: Proofs are not supported de.uni_freiburg.informatik.ultimate.plugins.chcsolver: UnsupportedOperationException: Proofs are not supported: de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getProof(Scriptor.java:168) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-05-31 18:20:51,402 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...