/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/ThreadModularUniHorn.xml -i ../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-5ab1b01-m [2023-07-03 22:51:28,957 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-07-03 22:51:29,359 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/ThreadModularVerifier.Settings.epf [2023-07-03 22:51:29,446 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-07-03 22:51:29,457 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-07-03 22:51:29,458 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-07-03 22:51:29,458 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-07-03 22:51:29,458 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-07-03 22:51:29,459 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-07-03 22:51:29,475 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-07-03 22:51:29,475 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-07-03 22:51:29,476 INFO L137 SettingsManager]: * Assume program has a precondition=false [2023-07-03 22:51:29,476 INFO L137 SettingsManager]: * Conditional Independence=PRECOMPUTED_CONDITIONS [2023-07-03 22:51:29,478 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-07-03 22:51:29,488 INFO L137 SettingsManager]: * Save file in source directory=true [2023-07-03 22:51:29,488 INFO L137 SettingsManager]: * Use automatic naming=true [2023-07-03 22:51:29,488 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 [2023-07-03 22:51:29,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-07-03 22:51:29,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-07-03 22:51:29,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-07-03 22:51:29,775 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-07-03 22:51:29,776 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-07-03 22:51:29,777 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-07-03 22:51:29,784 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl' [2023-07-03 22:51:29,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-07-03 22:51:29,847 INFO L133 ToolchainWalker]: Walking toolchain with 8 elements. [2023-07-03 22:51:29,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-07-03 22:51:29,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-07-03 22:51:29,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-07-03 22:51:29,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-07-03 22:51:29,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-07-03 22:51:29,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-07-03 22:51:29,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-07-03 22:51:29,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/1) ... [2023-07-03 22:51:29,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-07-03 22:51:29,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-07-03 22:51:29,962 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-07-03 22:51:29,985 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-07-03 22:51:30,004 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-07-03 22:51:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-07-03 22:51:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-07-03 22:51:30,054 INFO L236 CfgBuilder]: Building ICFG [2023-07-03 22:51:30,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-07-03 22:51:30,137 INFO L277 CfgBuilder]: Performing block encoding [2023-07-03 22:51:30,148 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-07-03 22:51:30,149 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-07-03 22:51:30,151 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.07 10:51:30 BoogieIcfgContainer [2023-07-03 22:51:30,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-07-03 22:51:30,152 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-07-03 22:51:30,153 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-07-03 22:51:30,153 INFO L274 PluginConnector]: IcfgToChc initialized [2023-07-03 22:51:30,155 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.07 10:51:30" (1/1) ... [2023-07-03 22:51:30,346 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := c;' is: true [2023-07-03 22:51:30,349 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,352 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume c < end;' is: true [2023-07-03 22:51:30,355 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume next <= len;' is: true [2023-07-03 22:51:30,358 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:30,405 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'm := false;' is: false [2023-07-03 22:51:30,415 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,416 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,419 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,422 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,426 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,429 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,431 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:30,433 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;' is: true [2023-07-03 22:51:30,435 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := len;' is: true [2023-07-03 22:51:30,438 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := next;' is: true [2023-07-03 22:51:30,441 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'next := next + 10;' is: true [2023-07-03 22:51:30,452 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'c := next;' is: true [2023-07-03 22:51:30,455 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:30,458 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,461 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,463 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,498 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := c;' is: true [2023-07-03 22:51:30,505 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,507 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume c < end;' is: true [2023-07-03 22:51:30,519 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume next <= len;' is: true [2023-07-03 22:51:30,530 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:30,531 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'm := false;' is: true [2023-07-03 22:51:30,533 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,535 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,540 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,543 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,545 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,547 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,548 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:30,550 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;' is: true [2023-07-03 22:51:30,551 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := len;' is: true [2023-07-03 22:51:30,556 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := next;' is: true [2023-07-03 22:51:30,581 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'next := next + 10;' is: false [2023-07-03 22:51:30,583 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'c := next;' is: true [2023-07-03 22:51:30,585 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:30,591 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,595 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,603 INFO L180 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,628 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := c;' is: true [2023-07-03 22:51:30,631 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,633 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume c < end;' is: true [2023-07-03 22:51:30,635 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume next <= len;' is: true [2023-07-03 22:51:30,672 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(next <= len);' is: (< len next) [2023-07-03 22:51:30,674 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'm := false;' is: true [2023-07-03 22:51:30,676 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,678 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,680 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,681 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,683 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,691 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,693 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:30,694 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;' is: true [2023-07-03 22:51:30,697 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := len;' is: true [2023-07-03 22:51:30,717 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := next;' is: false [2023-07-03 22:51:30,719 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'next := next + 10;' is: true [2023-07-03 22:51:30,747 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'c := next;' is: false [2023-07-03 22:51:30,749 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:30,751 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,755 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,758 INFO L180 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,782 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := c;' is: true [2023-07-03 22:51:30,784 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,786 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume c < end;' is: true [2023-07-03 22:51:30,787 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume next <= len;' is: true [2023-07-03 22:51:30,788 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:30,790 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'm := false;' is: true [2023-07-03 22:51:30,791 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,792 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,795 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,797 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,799 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,800 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,803 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:30,804 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;' is: true [2023-07-03 22:51:30,805 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := len;' is: true [2023-07-03 22:51:30,806 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := next;' is: true [2023-07-03 22:51:30,856 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'next := next + 10;' is: (<= (+ next 10) len) [2023-07-03 22:51:30,857 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'c := next;' is: true [2023-07-03 22:51:30,859 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:30,861 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,865 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,868 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,878 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := c;' is: true [2023-07-03 22:51:30,882 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,883 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume c < end;' is: true [2023-07-03 22:51:30,884 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume next <= len;' is: true [2023-07-03 22:51:30,885 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(next <= len);' is: true [2023-07-03 22:51:30,888 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'm := false;' is: true [2023-07-03 22:51:30,890 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,891 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,892 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,893 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,895 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,896 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,897 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:30,898 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;' is: true [2023-07-03 22:51:30,901 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := len;' is: true [2023-07-03 22:51:30,902 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := next;' is: true [2023-07-03 22:51:30,903 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'next := next + 10;' is: true [2023-07-03 22:51:30,905 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'c := next;' is: true [2023-07-03 22:51:30,906 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:30,907 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,909 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,911 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-07-03 22:51:30,920 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := c;' is: true [2023-07-03 22:51:30,922 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,923 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume c < end;' is: true [2023-07-03 22:51:30,924 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume next <= len;' is: true [2023-07-03 22:51:30,925 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:30,926 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'm := false;' is: true [2023-07-03 22:51:30,928 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,929 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,930 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,931 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,942 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,944 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,945 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:30,946 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;' is: true [2023-07-03 22:51:30,947 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := len;' is: true [2023-07-03 22:51:30,948 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := next;' is: true [2023-07-03 22:51:30,967 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'next := next + 10;' is: false [2023-07-03 22:51:30,972 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'c := next;' is: true [2023-07-03 22:51:30,974 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:30,975 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,976 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,977 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,988 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := c;' is: true [2023-07-03 22:51:30,989 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(c < end);' is: true [2023-07-03 22:51:30,990 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume c < end;' is: true [2023-07-03 22:51:30,991 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume next <= len;' is: true [2023-07-03 22:51:30,992 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:30,993 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'm := false;' is: true [2023-07-03 22:51:30,994 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:30,995 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:30,997 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:30,999 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,000 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,001 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,003 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,004 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;' is: true [2023-07-03 22:51:31,005 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := len;' is: true [2023-07-03 22:51:31,006 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := next;' is: true [2023-07-03 22:51:31,008 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,010 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'c := next;' is: true [2023-07-03 22:51:31,011 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,013 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,014 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,018 INFO L180 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,027 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := c;' is: true [2023-07-03 22:51:31,032 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,034 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume c < end;' is: true [2023-07-03 22:51:31,035 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,036 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,039 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'm := false;' is: true [2023-07-03 22:51:31,041 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,053 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume m == false;m := true;' is: false [2023-07-03 22:51:31,055 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,059 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,061 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,062 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,063 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,065 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;' is: true [2023-07-03 22:51:31,066 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := len;' is: true [2023-07-03 22:51:31,069 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := next;' is: true [2023-07-03 22:51:31,070 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,071 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'c := next;' is: true [2023-07-03 22:51:31,072 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,073 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,075 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,076 INFO L180 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,088 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := c;' is: true [2023-07-03 22:51:31,089 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,090 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume c < end;' is: true [2023-07-03 22:51:31,091 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume next <= len;' is: true [2023-07-03 22:51:31,093 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,094 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'm := false;' is: true [2023-07-03 22:51:31,097 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,099 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,101 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,102 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,105 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,106 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,108 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,109 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;' is: true [2023-07-03 22:51:31,110 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := len;' is: true [2023-07-03 22:51:31,116 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := next;' is: true [2023-07-03 22:51:31,119 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'next := next + 10;' is: true [2023-07-03 22:51:31,121 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'c := next;' is: true [2023-07-03 22:51:31,123 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,125 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,129 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,135 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-07-03 22:51:31,143 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := c;' is: true [2023-07-03 22:51:31,144 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,145 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume c < end;' is: true [2023-07-03 22:51:31,146 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,147 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,148 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'm := false;' is: true [2023-07-03 22:51:31,149 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,150 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,151 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,153 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,154 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,157 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,159 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,160 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;' is: true [2023-07-03 22:51:31,161 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := len;' is: true [2023-07-03 22:51:31,162 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := next;' is: true [2023-07-03 22:51:31,163 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,164 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'c := next;' is: true [2023-07-03 22:51:31,165 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,166 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,170 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,171 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,180 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := c;' is: true [2023-07-03 22:51:31,181 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,182 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < end;' is: true [2023-07-03 22:51:31,183 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,184 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,184 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'm := false;' is: true [2023-07-03 22:51:31,185 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,186 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,187 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,188 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,189 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,190 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,191 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,192 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-07-03 22:51:31,193 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := len;' is: true [2023-07-03 22:51:31,193 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := next;' is: true [2023-07-03 22:51:31,194 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,195 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := next;' is: true [2023-07-03 22:51:31,196 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,197 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,198 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,199 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,207 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := c;' is: true [2023-07-03 22:51:31,208 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,209 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume c < end;' is: true [2023-07-03 22:51:31,210 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume next <= len;' is: true [2023-07-03 22:51:31,211 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,212 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'm := false;' is: true [2023-07-03 22:51:31,247 INFO L351 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 258 treesize of output 234 [2023-07-03 22:51:31,263 INFO L180 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-07-03 22:51:31,264 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,266 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,267 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,268 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,269 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,271 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,271 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;' is: true [2023-07-03 22:51:31,272 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := len;' is: true [2023-07-03 22:51:31,273 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := next;' is: true [2023-07-03 22:51:31,276 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'next := next + 10;' is: true [2023-07-03 22:51:31,277 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'c := next;' is: true [2023-07-03 22:51:31,278 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,279 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,280 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,281 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,289 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := c;' is: true [2023-07-03 22:51:31,290 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,291 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume c < end;' is: true [2023-07-03 22:51:31,292 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,293 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,294 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'm := false;' is: true [2023-07-03 22:51:31,295 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,296 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,297 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,298 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,299 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,300 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,301 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,301 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;' is: true [2023-07-03 22:51:31,302 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := len;' is: true [2023-07-03 22:51:31,303 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := next;' is: true [2023-07-03 22:51:31,304 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,305 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'c := next;' is: true [2023-07-03 22:51:31,306 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,307 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,308 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,309 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,325 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,327 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,328 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,329 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,330 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,331 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,332 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,334 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,335 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,336 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,337 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,338 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,339 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,340 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,341 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,343 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,344 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,345 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,346 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,347 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,348 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,349 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,356 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,357 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,358 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,360 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,361 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,362 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,363 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,364 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,365 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,366 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,368 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,369 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,370 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,371 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,372 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,373 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,374 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,375 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,376 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,377 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,379 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,380 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,386 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,387 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,388 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,389 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,390 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,391 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,392 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,393 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,394 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,396 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,397 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,398 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,399 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,400 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,401 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,402 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,403 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,404 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,405 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,407 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,408 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,409 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,421 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,423 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,424 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,425 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,426 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,427 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,428 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,429 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,430 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,431 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,432 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,434 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,435 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,436 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,437 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,438 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,439 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,440 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,441 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,442 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,443 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,444 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,450 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,451 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,452 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,453 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,454 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,455 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,456 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,457 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,458 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,459 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,461 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,462 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,463 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,464 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,465 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,466 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,467 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,468 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,469 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,470 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,471 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,473 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,479 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,480 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,481 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,482 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,483 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,484 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,485 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,486 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,487 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,488 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,489 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,490 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,491 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,492 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,493 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,494 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,495 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,496 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,498 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,499 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,500 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,501 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,507 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,508 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,509 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,511 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,512 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,513 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,514 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,515 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,516 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,517 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,518 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,519 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,520 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,521 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,522 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,523 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,525 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,526 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,527 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,528 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,529 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,530 INFO L180 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,536 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := c;' is: true [2023-07-03 22:51:31,538 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,539 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume c < end;' is: true [2023-07-03 22:51:31,540 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume next <= len;' is: true [2023-07-03 22:51:31,541 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,542 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'm := false;' is: true [2023-07-03 22:51:31,543 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,544 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,545 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,546 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,547 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,548 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,558 INFO L351 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-07-03 22:51:31,571 INFO L180 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-07-03 22:51:31,572 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;' is: true [2023-07-03 22:51:31,573 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := len;' is: true [2023-07-03 22:51:31,574 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := next;' is: true [2023-07-03 22:51:31,575 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'next := next + 10;' is: true [2023-07-03 22:51:31,576 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'c := next;' is: true [2023-07-03 22:51:31,577 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,578 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,578 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,579 INFO L180 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-07-03 22:51:31,586 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := c;' is: true [2023-07-03 22:51:31,587 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(c < end);' is: true [2023-07-03 22:51:31,588 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume c < end;' is: true [2023-07-03 22:51:31,589 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume next <= len;' is: true [2023-07-03 22:51:31,590 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(next <= len);' is: true [2023-07-03 22:51:31,591 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'm := false;' is: true [2023-07-03 22:51:31,592 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 1];' is: true [2023-07-03 22:51:31,593 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume m == false;m := true;' is: true [2023-07-03 22:51:31,594 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,595 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,596 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,597 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,598 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 0];' is: true [2023-07-03 22:51:31,599 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;' is: true [2023-07-03 22:51:31,600 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := len;' is: true [2023-07-03 22:51:31,601 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := next;' is: true [2023-07-03 22:51:31,602 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'next := next + 10;' is: true [2023-07-03 22:51:31,603 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'c := next;' is: true [2023-07-03 22:51:31,605 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;c := c + 1;' is: true [2023-07-03 22:51:31,606 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,607 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,608 INFO L180 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-07-03 22:51:31,662 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.07 10:51:31 HornClauseAST [2023-07-03 22:51:31,662 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-07-03 22:51:31,663 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-07-03 22:51:31,663 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-07-03 22:51:31,663 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-07-03 22:51:31,664 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,665 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/CHC_conditional_thread-pooling.bpl_UID5664050599163786654.smt2 [2023-07-03 22:51:31,703 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-07-03 22:51:31,704 INFO L112 PluginConnector]: ------------------------ChcToBoogie---------------------------- [2023-07-03 22:51:31,704 INFO L270 PluginConnector]: Initializing ChcToBoogie... [2023-07-03 22:51:31,704 INFO L274 PluginConnector]: ChcToBoogie initialized [2023-07-03 22:51:31,705 INFO L184 PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,730 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31 Unit [2023-07-03 22:51:31,730 INFO L131 PluginConnector]: ------------------------ END ChcToBoogie---------------------------- [2023-07-03 22:51:31,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-07-03 22:51:31,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-07-03 22:51:31,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-07-03 22:51:31,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-07-03 22:51:31,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-07-03 22:51:31,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-07-03 22:51:31,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-07-03 22:51:31,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (1/1) ... [2023-07-03 22:51:31,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-07-03 22:51:31,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-07-03 22:51:31,813 INFO L229 MonitoredProcess]: Starting monitored process 2 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-07-03 22:51:31,834 INFO L124 BoogieDeclarations]: Specification and implementation of procedure gotoProc given in one single declaration [2023-07-03 22:51:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure gotoProc [2023-07-03 22:51:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure gotoProc [2023-07-03 22:51:31,834 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration [2023-07-03 22:51:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure Ultimate.START [2023-07-03 22:51:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure Ultimate.START [2023-07-03 22:51:31,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-07-03 22:51:31,862 INFO L236 CfgBuilder]: Building ICFG [2023-07-03 22:51:31,863 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-07-03 22:51:32,807 INFO L277 CfgBuilder]: Performing block encoding [2023-07-03 22:51:32,811 INFO L294 CfgBuilder]: Using library mode [2023-07-03 22:51:32,811 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-07-03 22:51:32,812 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.07 10:51:32 BoogieIcfgContainer [2023-07-03 22:51:32,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-07-03 22:51:32,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-07-03 22:51:32,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-07-03 22:51:32,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-07-03 22:51:32,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.07 10:51:29" (1/5) ... [2023-07-03 22:51:32,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b11261 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.07 10:51:32, skipping insertion in model container [2023-07-03 22:51:32,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.07 10:51:30" (2/5) ... [2023-07-03 22:51:32,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b11261 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.07 10:51:32, skipping insertion in model container [2023-07-03 22:51:32,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.07 10:51:31" (3/5) ... [2023-07-03 22:51:32,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b11261 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 03.07 10:51:32, skipping insertion in model container [2023-07-03 22:51:32,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 03.07 10:51:31" (4/5) ... [2023-07-03 22:51:32,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b11261 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.07 10:51:32, skipping insertion in model container [2023-07-03 22:51:32,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.07 10:51:32" (5/5) ... [2023-07-03 22:51:32,820 INFO L112 eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2023-07-03 22:51:32,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-07-03 22:51:32,834 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-07-03 22:51:32,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-07-03 22:51:32,941 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75054a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-07-03 22:51:32,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-07-03 22:51:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 184 states have (on average 1.483695652173913) internal successors, (273), 185 states have internal predecessors, (273), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2023-07-03 22:51:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-07-03 22:51:32,964 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:32,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:32,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:32,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash -86019365, now seen corresponding path program 1 times [2023-07-03 22:51:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382471088] [2023-07-03 22:51:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:33,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:33,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-07-03 22:51:33,077 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:33,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382471088] [2023-07-03 22:51:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1382471088] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756291694] [2023-07-03 22:51:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:33,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:33,114 INFO L87 Difference]: Start difference. First operand has 272 states, 184 states have (on average 1.483695652173913) internal successors, (273), 185 states have internal predecessors, (273), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:34,122 INFO L93 Difference]: Finished difference Result 538 states and 880 transitions. [2023-07-03 22:51:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-07-03 22:51:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:34,162 INFO L225 Difference]: With dead ends: 538 [2023-07-03 22:51:34,162 INFO L226 Difference]: Without dead ends: 536 [2023-07-03 22:51:34,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:34,172 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 795 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:34,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 634 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-07-03 22:51:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2023-07-03 22:51:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 364 states have (on average 1.4835164835164836) internal successors, (540), 364 states have internal predecessors, (540), 169 states have call successors, (169), 2 states have call predecessors, (169), 2 states have return successors, (169), 169 states have call predecessors, (169), 169 states have call successors, (169) [2023-07-03 22:51:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 878 transitions. [2023-07-03 22:51:34,322 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 878 transitions. Word has length 8 [2023-07-03 22:51:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:34,323 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 878 transitions. [2023-07-03 22:51:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 878 transitions. [2023-07-03 22:51:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-07-03 22:51:34,346 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:34,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:34,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-07-03 22:51:34,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:34,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -328221857, now seen corresponding path program 1 times [2023-07-03 22:51:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241492680] [2023-07-03 22:51:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:34,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:34,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-07-03 22:51:34,405 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241492680] [2023-07-03 22:51:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [241492680] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90030868] [2023-07-03 22:51:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:34,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:34,408 INFO L87 Difference]: Start difference. First operand 536 states and 878 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:35,451 INFO L93 Difference]: Finished difference Result 878 states and 1516 transitions. [2023-07-03 22:51:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:35,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-07-03 22:51:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:35,493 INFO L225 Difference]: With dead ends: 878 [2023-07-03 22:51:35,493 INFO L226 Difference]: Without dead ends: 878 [2023-07-03 22:51:35,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:35,498 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 89 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:35,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1282 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-07-03 22:51:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2023-07-03 22:51:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 626. [2023-07-03 22:51:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 454 states have (on average 1.669603524229075) internal successors, (758), 454 states have internal predecessors, (758), 169 states have call successors, (169), 2 states have call predecessors, (169), 2 states have return successors, (169), 169 states have call predecessors, (169), 169 states have call successors, (169) [2023-07-03 22:51:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1096 transitions. [2023-07-03 22:51:35,614 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1096 transitions. Word has length 10 [2023-07-03 22:51:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:35,615 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 1096 transitions. [2023-07-03 22:51:35,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1096 transitions. [2023-07-03 22:51:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-07-03 22:51:35,636 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:35,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-07-03 22:51:35,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:35,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:35,637 INFO L85 PathProgramCache]: Analyzing trace with hash -954963741, now seen corresponding path program 1 times [2023-07-03 22:51:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853597549] [2023-07-03 22:51:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:35,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:35,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-07-03 22:51:35,687 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853597549] [2023-07-03 22:51:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [853597549] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:35,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963889997] [2023-07-03 22:51:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:35,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:35,690 INFO L87 Difference]: Start difference. First operand 626 states and 1096 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:36,579 INFO L93 Difference]: Finished difference Result 1026 states and 1878 transitions. [2023-07-03 22:51:36,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:36,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-07-03 22:51:36,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:36,638 INFO L225 Difference]: With dead ends: 1026 [2023-07-03 22:51:36,638 INFO L226 Difference]: Without dead ends: 1026 [2023-07-03 22:51:36,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:36,639 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 117 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:36,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1352 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-07-03 22:51:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 942. [2023-07-03 22:51:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 658 states have (on average 1.7872340425531914) internal successors, (1176), 658 states have internal predecessors, (1176), 281 states have call successors, (281), 2 states have call predecessors, (281), 2 states have return successors, (281), 281 states have call predecessors, (281), 281 states have call successors, (281) [2023-07-03 22:51:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1738 transitions. [2023-07-03 22:51:36,838 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1738 transitions. Word has length 10 [2023-07-03 22:51:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:36,838 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1738 transitions. [2023-07-03 22:51:36,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1738 transitions. [2023-07-03 22:51:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-07-03 22:51:36,909 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:36,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:36,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-07-03 22:51:36,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:36,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -248918530, now seen corresponding path program 1 times [2023-07-03 22:51:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:36,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794880584] [2023-07-03 22:51:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:36,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:36,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-07-03 22:51:36,951 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794880584] [2023-07-03 22:51:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1794880584] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368767922] [2023-07-03 22:51:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:36,956 INFO L87 Difference]: Start difference. First operand 942 states and 1738 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:37,901 INFO L93 Difference]: Finished difference Result 1454 states and 2748 transitions. [2023-07-03 22:51:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-07-03 22:51:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:38,039 INFO L225 Difference]: With dead ends: 1454 [2023-07-03 22:51:38,039 INFO L226 Difference]: Without dead ends: 1454 [2023-07-03 22:51:38,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:38,042 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 91 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:38,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1280 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2023-07-03 22:51:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1034. [2023-07-03 22:51:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 750 states have (on average 1.9813333333333334) internal successors, (1486), 750 states have internal predecessors, (1486), 281 states have call successors, (281), 2 states have call predecessors, (281), 2 states have return successors, (281), 281 states have call predecessors, (281), 281 states have call successors, (281) [2023-07-03 22:51:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2048 transitions. [2023-07-03 22:51:38,283 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2048 transitions. Word has length 13 [2023-07-03 22:51:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:38,284 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 2048 transitions. [2023-07-03 22:51:38,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2048 transitions. [2023-07-03 22:51:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-07-03 22:51:38,343 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:38,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:38,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-07-03 22:51:38,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:38,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1062984332, now seen corresponding path program 1 times [2023-07-03 22:51:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475219905] [2023-07-03 22:51:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:38,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:38,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-07-03 22:51:38,401 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:38,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475219905] [2023-07-03 22:51:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [475219905] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:38,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:38,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502957913] [2023-07-03 22:51:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:38,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:38,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:38,404 INFO L87 Difference]: Start difference. First operand 1034 states and 2048 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:39,269 INFO L93 Difference]: Finished difference Result 1436 states and 2926 transitions. [2023-07-03 22:51:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:39,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-07-03 22:51:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:39,338 INFO L225 Difference]: With dead ends: 1436 [2023-07-03 22:51:39,338 INFO L226 Difference]: Without dead ends: 1436 [2023-07-03 22:51:39,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:39,339 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 119 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:39,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1350 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2023-07-03 22:51:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1352. [2023-07-03 22:51:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 956 states have (on average 2.092050209205021) internal successors, (2000), 956 states have internal predecessors, (2000), 393 states have call successors, (393), 2 states have call predecessors, (393), 2 states have return successors, (393), 393 states have call predecessors, (393), 393 states have call successors, (393) [2023-07-03 22:51:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2786 transitions. [2023-07-03 22:51:39,538 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2786 transitions. Word has length 13 [2023-07-03 22:51:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:39,539 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 2786 transitions. [2023-07-03 22:51:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2786 transitions. [2023-07-03 22:51:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-07-03 22:51:39,673 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:39,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:39,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-07-03 22:51:39,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:39,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -462759079, now seen corresponding path program 1 times [2023-07-03 22:51:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578047416] [2023-07-03 22:51:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:39,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:39,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-07-03 22:51:39,704 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578047416] [2023-07-03 22:51:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578047416] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696079816] [2023-07-03 22:51:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:39,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:39,706 INFO L87 Difference]: Start difference. First operand 1352 states and 2786 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:40,686 INFO L93 Difference]: Finished difference Result 2034 states and 4174 transitions. [2023-07-03 22:51:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-07-03 22:51:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:40,810 INFO L225 Difference]: With dead ends: 2034 [2023-07-03 22:51:40,810 INFO L226 Difference]: Without dead ends: 2034 [2023-07-03 22:51:40,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:40,811 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 93 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:40,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1278 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2023-07-03 22:51:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1446. [2023-07-03 22:51:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1050 states have (on average 2.2933333333333334) internal successors, (2408), 1050 states have internal predecessors, (2408), 393 states have call successors, (393), 2 states have call predecessors, (393), 2 states have return successors, (393), 393 states have call predecessors, (393), 393 states have call successors, (393) [2023-07-03 22:51:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 3194 transitions. [2023-07-03 22:51:41,051 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 3194 transitions. Word has length 16 [2023-07-03 22:51:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 1446 states and 3194 transitions. [2023-07-03 22:51:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 3194 transitions. [2023-07-03 22:51:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-07-03 22:51:41,236 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:41,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:41,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-07-03 22:51:41,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:41,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1706044673, now seen corresponding path program 1 times [2023-07-03 22:51:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770373040] [2023-07-03 22:51:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:41,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:41,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:41,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-07-03 22:51:41,270 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:41,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770373040] [2023-07-03 22:51:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [770373040] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:41,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:41,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318801676] [2023-07-03 22:51:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:41,272 INFO L87 Difference]: Start difference. First operand 1446 states and 3194 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:42,118 INFO L93 Difference]: Finished difference Result 1850 states and 4174 transitions. [2023-07-03 22:51:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-07-03 22:51:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:42,206 INFO L225 Difference]: With dead ends: 1850 [2023-07-03 22:51:42,206 INFO L226 Difference]: Without dead ends: 1850 [2023-07-03 22:51:42,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:42,207 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 121 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:42,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1348 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-07-03 22:51:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2023-07-03 22:51:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1766. [2023-07-03 22:51:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1258 states have (on average 2.4038155802861687) internal successors, (3024), 1258 states have internal predecessors, (3024), 505 states have call successors, (505), 2 states have call predecessors, (505), 2 states have return successors, (505), 505 states have call predecessors, (505), 505 states have call successors, (505) [2023-07-03 22:51:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4034 transitions. [2023-07-03 22:51:42,491 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4034 transitions. Word has length 16 [2023-07-03 22:51:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:42,492 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 4034 transitions. [2023-07-03 22:51:42,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4034 transitions. [2023-07-03 22:51:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-07-03 22:51:42,695 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:42,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:42,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-07-03 22:51:42,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:42,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -342683548, now seen corresponding path program 1 times [2023-07-03 22:51:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:42,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1700598248] [2023-07-03 22:51:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:42,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:42,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-07-03 22:51:42,735 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1700598248] [2023-07-03 22:51:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1700598248] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:42,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255476574] [2023-07-03 22:51:42,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:42,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:42,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:42,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:42,736 INFO L87 Difference]: Start difference. First operand 1766 states and 4034 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:43,718 INFO L93 Difference]: Finished difference Result 2618 states and 5806 transitions. [2023-07-03 22:51:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-07-03 22:51:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:43,883 INFO L225 Difference]: With dead ends: 2618 [2023-07-03 22:51:43,883 INFO L226 Difference]: Without dead ends: 2618 [2023-07-03 22:51:43,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:43,884 INFO L413 NwaCegarLoop]: 668 mSDtfsCounter, 95 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:43,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1276 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-07-03 22:51:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2023-07-03 22:51:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1862. [2023-07-03 22:51:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1354 states have (on average 2.6115214180206796) internal successors, (3536), 1354 states have internal predecessors, (3536), 505 states have call successors, (505), 2 states have call predecessors, (505), 2 states have return successors, (505), 505 states have call predecessors, (505), 505 states have call successors, (505) [2023-07-03 22:51:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 4546 transitions. [2023-07-03 22:51:44,319 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 4546 transitions. Word has length 19 [2023-07-03 22:51:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:44,320 INFO L495 AbstractCegarLoop]: Abstraction has 1862 states and 4546 transitions. [2023-07-03 22:51:44,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 4546 transitions. [2023-07-03 22:51:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-07-03 22:51:44,692 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:44,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:44,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-07-03 22:51:44,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:44,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2015826332, now seen corresponding path program 1 times [2023-07-03 22:51:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279716747] [2023-07-03 22:51:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:44,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:44,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-07-03 22:51:44,762 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279716747] [2023-07-03 22:51:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1279716747] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923526751] [2023-07-03 22:51:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:44,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:44,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:44,764 INFO L87 Difference]: Start difference. First operand 1862 states and 4546 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:45,763 INFO L93 Difference]: Finished difference Result 2268 states and 5634 transitions. [2023-07-03 22:51:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-07-03 22:51:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:45,891 INFO L225 Difference]: With dead ends: 2268 [2023-07-03 22:51:45,891 INFO L226 Difference]: Without dead ends: 2268 [2023-07-03 22:51:45,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:45,892 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 123 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:45,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1346 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2023-07-03 22:51:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2184. [2023-07-03 22:51:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1564 states have (on average 2.7237851662404093) internal successors, (4260), 1564 states have internal predecessors, (4260), 617 states have call successors, (617), 2 states have call predecessors, (617), 2 states have return successors, (617), 617 states have call predecessors, (617), 617 states have call successors, (617) [2023-07-03 22:51:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5494 transitions. [2023-07-03 22:51:46,356 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5494 transitions. Word has length 19 [2023-07-03 22:51:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:46,357 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 5494 transitions. [2023-07-03 22:51:46,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5494 transitions. [2023-07-03 22:51:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-07-03 22:51:46,928 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:46,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:46,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-07-03 22:51:46,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:46,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1409742504, now seen corresponding path program 1 times [2023-07-03 22:51:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:46,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356435310] [2023-07-03 22:51:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:46,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:46,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-07-03 22:51:46,964 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:46,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356435310] [2023-07-03 22:51:46,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1356435310] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:46,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:46,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238233636] [2023-07-03 22:51:46,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:46,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:46,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:46,966 INFO L87 Difference]: Start difference. First operand 2184 states and 5494 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:48,463 INFO L93 Difference]: Finished difference Result 3206 states and 7656 transitions. [2023-07-03 22:51:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-07-03 22:51:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:48,833 INFO L225 Difference]: With dead ends: 3206 [2023-07-03 22:51:48,834 INFO L226 Difference]: Without dead ends: 3206 [2023-07-03 22:51:48,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:48,834 INFO L413 NwaCegarLoop]: 667 mSDtfsCounter, 97 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:48,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1274 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-07-03 22:51:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2023-07-03 22:51:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2282. [2023-07-03 22:51:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 1662 states have (on average 2.937424789410349) internal successors, (4882), 1662 states have internal predecessors, (4882), 617 states have call successors, (617), 2 states have call predecessors, (617), 2 states have return successors, (617), 617 states have call predecessors, (617), 617 states have call successors, (617) [2023-07-03 22:51:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 6116 transitions. [2023-07-03 22:51:49,404 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 6116 transitions. Word has length 22 [2023-07-03 22:51:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:49,404 INFO L495 AbstractCegarLoop]: Abstraction has 2282 states and 6116 transitions. [2023-07-03 22:51:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 6116 transitions. [2023-07-03 22:51:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-07-03 22:51:50,060 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:50,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:50,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-07-03 22:51:50,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:50,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1647704165, now seen corresponding path program 1 times [2023-07-03 22:51:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583207714] [2023-07-03 22:51:50,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:50,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:50,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:50,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-07-03 22:51:50,109 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583207714] [2023-07-03 22:51:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1583207714] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:50,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:50,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923275418] [2023-07-03 22:51:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:50,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:50,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:50,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:50,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:50,111 INFO L87 Difference]: Start difference. First operand 2282 states and 6116 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:51,201 INFO L93 Difference]: Finished difference Result 2690 states and 7318 transitions. [2023-07-03 22:51:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-07-03 22:51:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:51,368 INFO L225 Difference]: With dead ends: 2690 [2023-07-03 22:51:51,368 INFO L226 Difference]: Without dead ends: 2690 [2023-07-03 22:51:51,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:51,369 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 125 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:51,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1344 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-07-03 22:51:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2023-07-03 22:51:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2606. [2023-07-03 22:51:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 1874 states have (on average 3.0522945570971185) internal successors, (5720), 1874 states have internal predecessors, (5720), 729 states have call successors, (729), 2 states have call predecessors, (729), 2 states have return successors, (729), 729 states have call predecessors, (729), 729 states have call successors, (729) [2023-07-03 22:51:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 7178 transitions. [2023-07-03 22:51:51,889 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 7178 transitions. Word has length 22 [2023-07-03 22:51:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:51,889 INFO L495 AbstractCegarLoop]: Abstraction has 2606 states and 7178 transitions. [2023-07-03 22:51:51,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:51:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 7178 transitions. [2023-07-03 22:51:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-07-03 22:51:53,060 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:53,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:53,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-07-03 22:51:53,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:53,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -474815604, now seen corresponding path program 1 times [2023-07-03 22:51:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053387275] [2023-07-03 22:51:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:53,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:53,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-07-03 22:51:53,117 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:53,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053387275] [2023-07-03 22:51:53,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2053387275] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:53,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:53,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441258973] [2023-07-03 22:51:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:53,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:53,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:53,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:53,118 INFO L87 Difference]: Start difference. First operand 2606 states and 7178 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-07-03 22:51:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:54,947 INFO L93 Difference]: Finished difference Result 3798 states and 9784 transitions. [2023-07-03 22:51:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-07-03 22:51:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:55,399 INFO L225 Difference]: With dead ends: 3798 [2023-07-03 22:51:55,399 INFO L226 Difference]: Without dead ends: 3798 [2023-07-03 22:51:55,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:55,400 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 95 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:55,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1193 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-07-03 22:51:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2023-07-03 22:51:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 2706. [2023-07-03 22:51:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 1974 states have (on average 3.2958459979736574) internal successors, (6506), 1974 states have internal predecessors, (6506), 729 states have call successors, (729), 2 states have call predecessors, (729), 2 states have return successors, (729), 729 states have call predecessors, (729), 729 states have call successors, (729) [2023-07-03 22:51:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 7964 transitions. [2023-07-03 22:51:56,134 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 7964 transitions. Word has length 27 [2023-07-03 22:51:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:56,134 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 7964 transitions. [2023-07-03 22:51:56,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-07-03 22:51:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 7964 transitions. [2023-07-03 22:51:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-07-03 22:51:57,304 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:51:57,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:51:57,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-07-03 22:51:57,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:51:57,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:51:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1033738095, now seen corresponding path program 1 times [2023-07-03 22:51:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:51:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840804926] [2023-07-03 22:51:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:51:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:51:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:51:57,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:51:57,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:51:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-07-03 22:51:57,362 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:51:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840804926] [2023-07-03 22:51:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1840804926] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:51:57,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:51:57,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:51:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713282437] [2023-07-03 22:51:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:51:57,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:51:57,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:51:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:51:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:51:57,363 INFO L87 Difference]: Start difference. First operand 2706 states and 7964 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-07-03 22:51:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:51:58,768 INFO L93 Difference]: Finished difference Result 3116 states and 9462 transitions. [2023-07-03 22:51:58,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:51:58,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-07-03 22:51:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:51:59,064 INFO L225 Difference]: With dead ends: 3116 [2023-07-03 22:51:59,064 INFO L226 Difference]: Without dead ends: 3116 [2023-07-03 22:51:59,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:51:59,065 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 145 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-07-03 22:51:59,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1127 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-07-03 22:51:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2023-07-03 22:51:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3032. [2023-07-03 22:51:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 2188 states have (on average 3.4917733089579523) internal successors, (7640), 2188 states have internal predecessors, (7640), 841 states have call successors, (841), 2 states have call predecessors, (841), 2 states have return successors, (841), 841 states have call predecessors, (841), 841 states have call successors, (841) [2023-07-03 22:51:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 9322 transitions. [2023-07-03 22:51:59,773 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 9322 transitions. Word has length 27 [2023-07-03 22:51:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:51:59,773 INFO L495 AbstractCegarLoop]: Abstraction has 3032 states and 9322 transitions. [2023-07-03 22:51:59,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-07-03 22:51:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 9322 transitions. [2023-07-03 22:52:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-07-03 22:52:01,013 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:52:01,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:52:01,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-07-03 22:52:01,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:52:01,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:52:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -27118308, now seen corresponding path program 1 times [2023-07-03 22:52:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:52:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474147284] [2023-07-03 22:52:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:52:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:52:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:52:01,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-07-03 22:52:01,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:52:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-07-03 22:52:01,075 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:52:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474147284] [2023-07-03 22:52:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [474147284] provided 0 perfect and 1 imperfect interpolant sequences [2023-07-03 22:52:01,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-07-03 22:52:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-07-03 22:52:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037263490] [2023-07-03 22:52:01,075 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-07-03 22:52:01,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-07-03 22:52:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:52:01,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-07-03 22:52:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-07-03 22:52:01,076 INFO L87 Difference]: Start difference. First operand 3032 states and 9322 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-07-03 22:52:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:52:09,469 INFO L93 Difference]: Finished difference Result 7754 states and 22289 transitions. [2023-07-03 22:52:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-07-03 22:52:09,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-07-03 22:52:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:52:12,752 INFO L225 Difference]: With dead ends: 7754 [2023-07-03 22:52:12,752 INFO L226 Difference]: Without dead ends: 7521 [2023-07-03 22:52:12,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-07-03 22:52:12,753 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 840 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 2803 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 2803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-07-03 22:52:12,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1380 Invalid, 3403 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [600 Valid, 2803 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-07-03 22:52:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7521 states. [2023-07-03 22:52:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7521 to 5835. [2023-07-03 22:52:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5835 states, 3324 states have (on average 3.5845367027677497) internal successors, (11915), 4137 states have internal predecessors, (11915), 2507 states have call successors, (2507), 2 states have call predecessors, (2507), 3 states have return successors, (4047), 1695 states have call predecessors, (4047), 2507 states have call successors, (4047) [2023-07-03 22:52:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5835 states to 5835 states and 18469 transitions. [2023-07-03 22:52:18,160 INFO L78 Accepts]: Start accepts. Automaton has 5835 states and 18469 transitions. Word has length 27 [2023-07-03 22:52:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:52:18,161 INFO L495 AbstractCegarLoop]: Abstraction has 5835 states and 18469 transitions. [2023-07-03 22:52:18,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-07-03 22:52:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 18469 transitions. [2023-07-03 22:52:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-07-03 22:52:21,089 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:52:21,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:52:21,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-07-03 22:52:21,089 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:52:21,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:52:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1729102919, now seen corresponding path program 1 times [2023-07-03 22:52:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:52:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [30998627] [2023-07-03 22:52:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:52:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:52:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:52:21,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:52:21,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:52:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-07-03 22:52:21,123 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:52:21,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [30998627] [2023-07-03 22:52:21,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [30998627] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:52:21,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:52:21,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:52:21,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097182844] [2023-07-03 22:52:21,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:52:21,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:52:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:52:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:52:21,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:52:21,125 INFO L87 Difference]: Start difference. First operand 5835 states and 18469 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:52:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:52:26,942 INFO L93 Difference]: Finished difference Result 7878 states and 24184 transitions. [2023-07-03 22:52:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-07-03 22:52:26,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-07-03 22:52:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:52:30,463 INFO L225 Difference]: With dead ends: 7878 [2023-07-03 22:52:30,463 INFO L226 Difference]: Without dead ends: 7878 [2023-07-03 22:52:30,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-07-03 22:52:30,464 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 100 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-07-03 22:52:30,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 937 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-07-03 22:52:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2023-07-03 22:52:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 5988. [2023-07-03 22:52:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5988 states, 3477 states have (on average 3.802128271498418) internal successors, (13220), 4290 states have internal predecessors, (13220), 2507 states have call successors, (2507), 2 states have call predecessors, (2507), 3 states have return successors, (4047), 1695 states have call predecessors, (4047), 2507 states have call successors, (4047) [2023-07-03 22:52:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5988 states to 5988 states and 19774 transitions. [2023-07-03 22:52:37,553 INFO L78 Accepts]: Start accepts. Automaton has 5988 states and 19774 transitions. Word has length 25 [2023-07-03 22:52:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:52:37,557 INFO L495 AbstractCegarLoop]: Abstraction has 5988 states and 19774 transitions. [2023-07-03 22:52:37,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-07-03 22:52:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5988 states and 19774 transitions. [2023-07-03 22:52:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-07-03 22:52:42,006 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:52:42,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:52:42,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-07-03 22:52:42,006 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:52:42,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:52:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 826654744, now seen corresponding path program 1 times [2023-07-03 22:52:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:52:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720281780] [2023-07-03 22:52:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:52:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:52:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:52:42,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-07-03 22:52:42,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:52:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-07-03 22:52:42,115 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:52:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720281780] [2023-07-03 22:52:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1720281780] provided 0 perfect and 1 imperfect interpolant sequences [2023-07-03 22:52:42,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-07-03 22:52:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-07-03 22:52:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620683241] [2023-07-03 22:52:42,115 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-07-03 22:52:42,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-07-03 22:52:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:52:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-07-03 22:52:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-07-03 22:52:42,116 INFO L87 Difference]: Start difference. First operand 5988 states and 19774 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-07-03 22:53:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-07-03 22:53:00,320 INFO L93 Difference]: Finished difference Result 11703 states and 45249 transitions. [2023-07-03 22:53:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-07-03 22:53:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-07-03 22:53:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-07-03 22:53:13,819 INFO L225 Difference]: With dead ends: 11703 [2023-07-03 22:53:13,819 INFO L226 Difference]: Without dead ends: 11703 [2023-07-03 22:53:13,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-07-03 22:53:13,820 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 887 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-07-03 22:53:13,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1125 Invalid, 3932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-07-03 22:53:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2023-07-03 22:53:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 10455. [2023-07-03 22:53:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10455 states, 5968 states have (on average 3.8755026809651474) internal successors, (23129), 7511 states have internal predecessors, (23129), 4481 states have call successors, (4481), 2 states have call predecessors, (4481), 5 states have return successors, (13623), 2941 states have call predecessors, (13623), 4481 states have call successors, (13623) [2023-07-03 22:53:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10455 states to 10455 states and 41233 transitions. [2023-07-03 22:53:33,343 INFO L78 Accepts]: Start accepts. Automaton has 10455 states and 41233 transitions. Word has length 27 [2023-07-03 22:53:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-07-03 22:53:33,343 INFO L495 AbstractCegarLoop]: Abstraction has 10455 states and 41233 transitions. [2023-07-03 22:53:33,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-07-03 22:53:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 10455 states and 41233 transitions. [2023-07-03 22:53:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-07-03 22:53:40,326 INFO L187 NwaCegarLoop]: Found error trace [2023-07-03 22:53:40,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-07-03 22:53:40,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-07-03 22:53:40,326 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-07-03 22:53:40,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-07-03 22:53:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2000717788, now seen corresponding path program 1 times [2023-07-03 22:53:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-07-03 22:53:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869336278] [2023-07-03 22:53:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-07-03 22:53:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-07-03 22:53:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-07-03 22:53:40,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-07-03 22:53:40,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-07-03 22:53:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-07-03 22:53:40,412 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-07-03 22:53:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869336278] [2023-07-03 22:53:40,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [869336278] provided 1 perfect and 0 imperfect interpolant sequences [2023-07-03 22:53:40,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-07-03 22:53:40,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-07-03 22:53:40,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524091310] [2023-07-03 22:53:40,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-07-03 22:53:40,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-07-03 22:53:40,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-07-03 22:53:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-07-03 22:53:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-07-03 22:53:40,414 INFO L87 Difference]: Start difference. First operand 10455 states and 41233 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)