/usr/bin/java -Xmx15000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/threadmodular/regression/equalsum-fork/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularUniHorn.xml -i ../../../trunk/examples/threadmodular/regression/equalsum-fork/equalsum-fork.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-3a8dd60-m [2023-06-12 17:59:01,675 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 17:59:01,718 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-fork/ThreadModularVerifier.Settings.epf [2023-06-12 17:59:01,723 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 17:59:01,724 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 17:59:01,724 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 17:59:01,724 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 17:59:01,725 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 17:59:01,725 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 17:59:01,725 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 17:59:01,726 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 17:59:01,726 INFO L137 SettingsManager]: * Assume program has a precondition=false [2023-06-12 17:59:01,726 INFO L137 SettingsManager]: * Concurrency mode=SINGLE_MAIN_THREAD [2023-06-12 17:59:01,726 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 17:59:01,727 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 17:59:01,727 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 17:59:01,727 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 17:59:01,728 INFO L137 SettingsManager]: * File name=CHC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-06-12 17:59:01,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 17:59:01,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 17:59:01,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 17:59:01,892 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 17:59:01,895 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 17:59:01,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-fork/equalsum-fork.bpl [2023-06-12 17:59:01,896 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-fork/equalsum-fork.bpl' [2023-06-12 17:59:01,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 17:59:01,916 INFO L133 ToolchainWalker]: Walking toolchain with 8 elements. [2023-06-12 17:59:01,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 17:59:01,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 17:59:01,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 17:59:01,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 17:59:01,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 17:59:01,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 17:59:01,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 17:59:01,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/1) ... [2023-06-12 17:59:01,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 17:59:01,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 17:59:01,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-06-12 17:59:01,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-06-12 17:59:01,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 17:59:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 17:59:01,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 17:59:01,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2023-06-12 17:59:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-06-12 17:59:01,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-06-12 17:59:02,035 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 17:59:02,037 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 17:59:02,112 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 17:59:02,117 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 17:59:02,117 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 17:59:02,118 INFO L201 PluginConnector]: Adding new model equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:02 BoogieIcfgContainer [2023-06-12 17:59:02,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 17:59:02,119 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 17:59:02,119 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 17:59:02,119 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 17:59:02,122 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,298 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 17:59:02,300 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 17:59:02,302 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'sum := 0;' is: true [2023-06-12 17:59:02,304 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'sum := 0;' is: true [2023-06-12 17:59:02,307 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'sum := 0;' is: true [2023-06-12 17:59:02,309 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'sum := 0;' is: true [2023-06-12 17:59:02,311 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'sum := 0;' is: true [2023-06-12 17:59:02,312 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'sum := 0;' is: true [2023-06-12 17:59:02,315 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'sum := 0;' is: true [2023-06-12 17:59:02,317 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'sum := 0;' is: true [2023-06-12 17:59:02,319 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'sum := 0;' is: true [2023-06-12 17:59:02,321 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'sum := 0;' is: true [2023-06-12 17:59:02,333 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'sum := 0;' is: true [2023-06-12 17:59:02,336 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'sum := 0;' is: true [2023-06-12 17:59:02,337 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 17:59:02,339 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'sum := 0;' is: true [2023-06-12 17:59:02,341 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'sum := 0;' is: true [2023-06-12 17:59:02,343 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'sum := 0;' is: true [2023-06-12 17:59:02,345 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'sum := 0;' is: true [2023-06-12 17:59:02,346 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'sum := 0;' is: true [2023-06-12 17:59:02,348 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 17:59:02,350 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 17:59:02,352 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 17:59:02,354 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 17:59:02,355 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 17:59:02,357 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 17:59:02,384 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 17:59:02,386 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 17:59:02,387 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'idx := 0;' is: true [2023-06-12 17:59:02,388 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'idx := 0;' is: true [2023-06-12 17:59:02,393 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'idx := 0;' is: true [2023-06-12 17:59:02,395 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'idx := 0;' is: true [2023-06-12 17:59:02,396 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'idx := 0;' is: true [2023-06-12 17:59:02,397 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'idx := 0;' is: true [2023-06-12 17:59:02,398 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'idx := 0;' is: true [2023-06-12 17:59:02,400 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'idx := 0;' is: true [2023-06-12 17:59:02,401 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'idx := 0;' is: true [2023-06-12 17:59:02,402 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'idx := 0;' is: true [2023-06-12 17:59:02,404 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'idx := 0;' is: true [2023-06-12 17:59:02,406 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'idx := 0;' is: true [2023-06-12 17:59:02,407 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 17:59:02,408 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'idx := 0;' is: true [2023-06-12 17:59:02,410 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'idx := 0;' is: true [2023-06-12 17:59:02,411 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'idx := 0;' is: true [2023-06-12 17:59:02,412 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'idx := 0;' is: true [2023-06-12 17:59:02,414 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'idx := 0;' is: true [2023-06-12 17:59:02,415 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 17:59:02,416 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 17:59:02,418 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 17:59:02,419 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 17:59:02,420 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 17:59:02,422 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 17:59:02,433 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,434 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,435 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,436 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,437 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,438 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,440 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,441 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,442 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,443 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,444 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,446 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,447 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,448 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,449 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,450 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,451 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,452 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,454 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,455 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,456 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,457 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,458 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,460 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,461 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,462 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:02,471 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,472 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,473 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,474 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,476 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume idx < n;' is: true [2023-06-12 17:59:02,477 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,478 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume idx < n;' is: true [2023-06-12 17:59:02,480 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,481 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,482 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume idx < n;' is: true [2023-06-12 17:59:02,483 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,484 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,485 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,486 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,487 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,488 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,489 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume idx < n;' is: true [2023-06-12 17:59:02,490 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,491 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume idx < n;' is: true [2023-06-12 17:59:02,492 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,494 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,495 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 17:59:02,496 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 17:59:02,497 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,498 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 17:59:02,505 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume id == i;' is: true [2023-06-12 17:59:02,506 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume id == i;' is: true [2023-06-12 17:59:02,507 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume id == i;' is: true [2023-06-12 17:59:02,508 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume id == i;' is: true [2023-06-12 17:59:02,509 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume id == i;' is: true [2023-06-12 17:59:02,510 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume id == i;' is: true [2023-06-12 17:59:02,511 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume id == i;' is: true [2023-06-12 17:59:02,512 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume id == i;' is: true [2023-06-12 17:59:02,513 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume id == i;' is: true [2023-06-12 17:59:02,514 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume id == i;' is: true [2023-06-12 17:59:02,515 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume id == i;' is: true [2023-06-12 17:59:02,516 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume id == i;' is: true [2023-06-12 17:59:02,517 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume id == i;' is: true [2023-06-12 17:59:02,518 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume id == i;' is: true [2023-06-12 17:59:02,519 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume id == i;' is: true [2023-06-12 17:59:02,519 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume id == i;' is: true [2023-06-12 17:59:02,520 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume id == i;' is: true [2023-06-12 17:59:02,521 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume id == i;' is: true [2023-06-12 17:59:02,522 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume id == i;' is: true [2023-06-12 17:59:02,523 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume id == i;' is: true [2023-06-12 17:59:02,524 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume id == i;' is: true [2023-06-12 17:59:02,525 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume id == i;' is: true [2023-06-12 17:59:02,526 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume id == i;' is: true [2023-06-12 17:59:02,527 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume id == i;' is: true [2023-06-12 17:59:02,528 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume id == i;' is: true [2023-06-12 17:59:02,529 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume id == i;' is: true [2023-06-12 17:59:02,536 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,537 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,538 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,539 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,540 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,541 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,542 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,542 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,543 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,544 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,545 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,546 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,547 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,548 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,549 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,550 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,551 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,551 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,552 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,553 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,554 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,555 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,556 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,558 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,559 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,560 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(id == i);' is: true [2023-06-12 17:59:02,566 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,567 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,568 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,571 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,572 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,574 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,575 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,576 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,579 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,582 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,585 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,586 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,588 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,589 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,590 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,592 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,593 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,597 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,598 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,600 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,602 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,604 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,607 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,609 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,610 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,614 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:02,624 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := sum;' is: true [2023-06-12 17:59:02,625 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := sum;' is: true [2023-06-12 17:59:02,626 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'x := sum;' is: true [2023-06-12 17:59:02,627 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'x := sum;' is: true [2023-06-12 17:59:02,628 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'x := sum;' is: true [2023-06-12 17:59:02,629 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'x := sum;' is: true [2023-06-12 17:59:02,630 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'x := sum;' is: true [2023-06-12 17:59:02,631 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'x := sum;' is: true [2023-06-12 17:59:02,632 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'x := sum;' is: true [2023-06-12 17:59:02,643 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'x := sum;' is: true [2023-06-12 17:59:02,645 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'x := sum;' is: true [2023-06-12 17:59:02,649 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'x := sum;' is: true [2023-06-12 17:59:02,650 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'x := sum;' is: true [2023-06-12 17:59:02,651 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'x := sum;' is: true [2023-06-12 17:59:02,651 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := sum;' is: true [2023-06-12 17:59:02,655 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'x := sum;' is: false [2023-06-12 17:59:02,656 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'x := sum;' is: true [2023-06-12 17:59:02,657 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'x := sum;' is: true [2023-06-12 17:59:02,658 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'x := sum;' is: true [2023-06-12 17:59:02,659 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'x := sum;' is: true [2023-06-12 17:59:02,660 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'x := sum;' is: true [2023-06-12 17:59:02,662 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'x := sum;' is: true [2023-06-12 17:59:02,663 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'x := sum;' is: true [2023-06-12 17:59:02,664 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'x := sum;' is: true [2023-06-12 17:59:02,664 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'x := sum;' is: true [2023-06-12 17:59:02,665 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'x := sum;' is: true [2023-06-12 17:59:02,690 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume id == j;' is: true [2023-06-12 17:59:02,691 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume id == j;' is: true [2023-06-12 17:59:02,692 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume id == j;' is: true [2023-06-12 17:59:02,693 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume id == j;' is: true [2023-06-12 17:59:02,694 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume id == j;' is: true [2023-06-12 17:59:02,694 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume id == j;' is: true [2023-06-12 17:59:02,695 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume id == j;' is: true [2023-06-12 17:59:02,696 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume id == j;' is: true [2023-06-12 17:59:02,697 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume id == j;' is: true [2023-06-12 17:59:02,699 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume id == j;' is: true [2023-06-12 17:59:02,700 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume id == j;' is: true [2023-06-12 17:59:02,700 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume id == j;' is: true [2023-06-12 17:59:02,701 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume id == j;' is: true [2023-06-12 17:59:02,702 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume id == j;' is: true [2023-06-12 17:59:02,703 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume id == j;' is: true [2023-06-12 17:59:02,704 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume id == j;' is: true [2023-06-12 17:59:02,704 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume id == j;' is: true [2023-06-12 17:59:02,705 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume id == j;' is: true [2023-06-12 17:59:02,706 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume id == j;' is: true [2023-06-12 17:59:02,707 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume id == j;' is: true [2023-06-12 17:59:02,709 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume id == j;' is: true [2023-06-12 17:59:02,711 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume id == j;' is: true [2023-06-12 17:59:02,712 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume id == j;' is: true [2023-06-12 17:59:02,713 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume id == j;' is: true [2023-06-12 17:59:02,714 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume id == j;' is: true [2023-06-12 17:59:02,715 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume id == j;' is: true [2023-06-12 17:59:02,721 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,721 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,722 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,723 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,725 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,726 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,726 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,727 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,728 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,729 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,730 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,731 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,732 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,733 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,733 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,734 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,735 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,736 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,736 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,737 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,738 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,747 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,749 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,750 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,751 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,752 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(id == j);' is: true [2023-06-12 17:59:02,758 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,759 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,759 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,761 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,762 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,765 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,765 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,766 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,767 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,768 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,769 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,769 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,772 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,773 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,774 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,775 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,775 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,776 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,777 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,778 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,779 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,780 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,781 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,783 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,783 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,784 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:02,792 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'y := sum;' is: true [2023-06-12 17:59:02,792 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'y := sum;' is: true [2023-06-12 17:59:02,793 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'y := sum;' is: true [2023-06-12 17:59:02,794 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'y := sum;' is: true [2023-06-12 17:59:02,795 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'y := sum;' is: true [2023-06-12 17:59:02,796 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'y := sum;' is: true [2023-06-12 17:59:02,797 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'y := sum;' is: true [2023-06-12 17:59:02,797 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'y := sum;' is: true [2023-06-12 17:59:02,798 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'y := sum;' is: true [2023-06-12 17:59:02,799 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'y := sum;' is: true [2023-06-12 17:59:02,800 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'y := sum;' is: true [2023-06-12 17:59:02,800 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'y := sum;' is: true [2023-06-12 17:59:02,801 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'y := sum;' is: true [2023-06-12 17:59:02,802 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'y := sum;' is: false [2023-06-12 17:59:02,803 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'y := sum;' is: true [2023-06-12 17:59:02,803 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'y := sum;' is: true [2023-06-12 17:59:02,804 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'y := sum;' is: true [2023-06-12 17:59:02,805 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'y := sum;' is: true [2023-06-12 17:59:02,806 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'y := sum;' is: true [2023-06-12 17:59:02,807 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'y := sum;' is: true [2023-06-12 17:59:02,807 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'y := sum;' is: true [2023-06-12 17:59:02,808 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'y := sum;' is: true [2023-06-12 17:59:02,809 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'y := sum;' is: true [2023-06-12 17:59:02,810 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'y := sum;' is: true [2023-06-12 17:59:02,811 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'y := sum;' is: true [2023-06-12 17:59:02,812 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'y := sum;' is: true [2023-06-12 17:59:02,817 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:02,818 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:02,818 INFO L111 IndependenceChecker]: instantiated independence condition for 'join c;' and 'assume true;' is: true [2023-06-12 17:59:02,819 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume true;' is: true [2023-06-12 17:59:02,820 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,821 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume true;' is: true [2023-06-12 17:59:02,821 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume true;' is: true [2023-06-12 17:59:02,822 INFO L111 IndependenceChecker]: instantiated independence condition for 'fork c thread(c);' and 'assume true;' is: true [2023-06-12 17:59:02,825 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := c + 1;' and 'assume true;' is: true [2023-06-12 17:59:02,827 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,828 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < m);' and 'assume true;' is: true [2023-06-12 17:59:02,829 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < m;' and 'assume true;' is: true [2023-06-12 17:59:02,829 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume 0 <= i && i < j && j < m;' and 'assume true;' is: true [2023-06-12 17:59:02,830 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume true;' is: true [2023-06-12 17:59:02,830 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:02,831 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume true;' is: true [2023-06-12 17:59:02,832 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume true;' is: true [2023-06-12 17:59:02,832 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume true;' is: true [2023-06-12 17:59:02,833 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume true;' is: true [2023-06-12 17:59:02,833 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume true;' is: true [2023-06-12 17:59:02,834 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,835 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 17:59:02,835 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 17:59:02,836 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 17:59:02,837 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 17:59:02,837 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,848 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,849 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,850 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,850 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,851 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,853 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,853 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,854 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,855 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,856 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,857 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,857 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,858 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume 0 <= i && i < j && j < m;' is: true [2023-06-12 17:59:02,860 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'c := 0;' is: true [2023-06-12 17:59:02,860 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := 0;' is: true [2023-06-12 17:59:02,861 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'c := 0;' is: true [2023-06-12 17:59:02,862 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'c := 0;' is: true [2023-06-12 17:59:02,863 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'c := 0;' is: true [2023-06-12 17:59:02,864 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'c := 0;' is: true [2023-06-12 17:59:02,864 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'c := 0;' is: true [2023-06-12 17:59:02,865 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'c := 0;' is: true [2023-06-12 17:59:02,866 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'c := 0;' is: true [2023-06-12 17:59:02,866 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'c := 0;' is: true [2023-06-12 17:59:02,867 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'c := 0;' is: true [2023-06-12 17:59:02,868 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'c := 0;' is: true [2023-06-12 17:59:02,868 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'c := 0;' is: true [2023-06-12 17:59:02,869 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,870 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,871 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,871 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,872 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,873 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,873 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,874 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,875 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,875 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,876 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,877 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,877 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,880 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume c < m;' is: true [2023-06-12 17:59:02,881 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < m;' is: true [2023-06-12 17:59:02,881 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume c < m;' is: true [2023-06-12 17:59:02,882 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume c < m;' is: true [2023-06-12 17:59:02,883 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume c < m;' is: true [2023-06-12 17:59:02,886 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume c < m;' is: true [2023-06-12 17:59:02,887 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume c < m;' is: true [2023-06-12 17:59:02,887 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume c < m;' is: true [2023-06-12 17:59:02,888 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume c < m;' is: true [2023-06-12 17:59:02,889 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume c < m;' is: true [2023-06-12 17:59:02,890 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume c < m;' is: true [2023-06-12 17:59:02,890 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume c < m;' is: true [2023-06-12 17:59:02,891 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume c < m;' is: true [2023-06-12 17:59:02,892 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'c := 0;' is: true [2023-06-12 17:59:02,893 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := 0;' is: true [2023-06-12 17:59:02,893 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'c := 0;' is: true [2023-06-12 17:59:02,894 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'c := 0;' is: true [2023-06-12 17:59:02,894 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'c := 0;' is: true [2023-06-12 17:59:02,895 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'c := 0;' is: true [2023-06-12 17:59:02,896 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'c := 0;' is: true [2023-06-12 17:59:02,896 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'c := 0;' is: true [2023-06-12 17:59:02,897 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'c := 0;' is: true [2023-06-12 17:59:02,898 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'c := 0;' is: true [2023-06-12 17:59:02,898 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'c := 0;' is: true [2023-06-12 17:59:02,899 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'c := 0;' is: true [2023-06-12 17:59:02,900 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'c := 0;' is: true [2023-06-12 17:59:02,900 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,901 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,901 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,902 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,902 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,903 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,903 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,904 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,905 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,905 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,906 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,906 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,907 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'fork c thread(c);' is: true [2023-06-12 17:59:02,911 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,911 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,913 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,913 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,914 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,915 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,915 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,916 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,917 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,917 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,918 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,919 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,919 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(c < m);' is: true [2023-06-12 17:59:02,921 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume c < m;' is: true [2023-06-12 17:59:02,921 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < m;' is: true [2023-06-12 17:59:02,922 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume c < m;' is: true [2023-06-12 17:59:02,922 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume c < m;' is: true [2023-06-12 17:59:02,923 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume c < m;' is: true [2023-06-12 17:59:02,924 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume c < m;' is: true [2023-06-12 17:59:02,924 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume c < m;' is: true [2023-06-12 17:59:02,925 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume c < m;' is: true [2023-06-12 17:59:02,926 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume c < m;' is: true [2023-06-12 17:59:02,926 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume c < m;' is: true [2023-06-12 17:59:02,927 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume c < m;' is: true [2023-06-12 17:59:02,928 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume c < m;' is: true [2023-06-12 17:59:02,928 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume c < m;' is: true [2023-06-12 17:59:02,930 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,930 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,931 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,932 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,932 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'c := c + 1;' is: true [2023-06-12 17:59:02,935 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,936 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'c := c + 1;' is: true [2023-06-12 17:59:02,937 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,938 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,939 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'c := c + 1;' is: true [2023-06-12 17:59:02,939 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'c := c + 1;' is: true [2023-06-12 17:59:02,940 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,941 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,942 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume true;' is: true [2023-06-12 17:59:02,943 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:02,943 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume true;' is: true [2023-06-12 17:59:02,944 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume true;' is: true [2023-06-12 17:59:02,944 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume true;' is: true [2023-06-12 17:59:02,945 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume true;' is: true [2023-06-12 17:59:02,945 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume true;' is: true [2023-06-12 17:59:02,946 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,946 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 17:59:02,947 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 17:59:02,948 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 17:59:02,948 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 17:59:02,949 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,950 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'join c;' is: true [2023-06-12 17:59:02,950 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'join c;' is: true [2023-06-12 17:59:02,951 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'join c;' is: true [2023-06-12 17:59:02,952 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'join c;' is: true [2023-06-12 17:59:02,952 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'join c;' is: true [2023-06-12 17:59:02,953 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'join c;' is: true [2023-06-12 17:59:02,953 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'join c;' is: true [2023-06-12 17:59:02,954 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'join c;' is: true [2023-06-12 17:59:02,954 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'join c;' is: true [2023-06-12 17:59:02,955 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'join c;' is: true [2023-06-12 17:59:02,955 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'join c;' is: true [2023-06-12 17:59:02,956 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'join c;' is: true [2023-06-12 17:59:02,957 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'join c;' is: true [2023-06-12 17:59:02,957 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'assume true;' is: true [2023-06-12 17:59:02,958 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:02,958 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'assume true;' is: true [2023-06-12 17:59:02,959 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'assume true;' is: true [2023-06-12 17:59:02,959 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'assume true;' is: true [2023-06-12 17:59:02,960 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'assume true;' is: true [2023-06-12 17:59:02,960 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'assume true;' is: true [2023-06-12 17:59:02,961 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,962 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 17:59:02,962 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 17:59:02,963 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 17:59:02,963 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 17:59:02,964 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 17:59:02,966 INFO L111 IndependenceChecker]: instantiated independence condition for 'y := sum;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,966 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,968 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := sum;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,969 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == i;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,970 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == i);' and 'c := c + 1;' is: true [2023-06-12 17:59:02,971 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume id == j;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,971 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(id == j);' and 'c := c + 1;' is: true [2023-06-12 17:59:02,972 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,973 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,974 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'c := c + 1;' is: true [2023-06-12 17:59:02,975 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'c := c + 1;' is: true [2023-06-12 17:59:02,975 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'c := c + 1;' is: true [2023-06-12 17:59:02,976 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'c := c + 1;' is: true [2023-06-12 17:59:03,037 INFO L201 PluginConnector]: Adding new model equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03 HornClauseAST [2023-06-12 17:59:03,037 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 17:59:03,037 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 17:59:03,038 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 17:59:03,038 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 17:59:03,038 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,040 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-fork/CHC_equalsum-fork.bpl_UID1788413834927888832.smt2 [2023-06-12 17:59:03,106 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 17:59:03,106 INFO L112 PluginConnector]: ------------------------ChcToBoogie---------------------------- [2023-06-12 17:59:03,106 INFO L270 PluginConnector]: Initializing ChcToBoogie... [2023-06-12 17:59:03,107 INFO L274 PluginConnector]: ChcToBoogie initialized [2023-06-12 17:59:03,107 INFO L184 PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,144 INFO L201 PluginConnector]: Adding new model equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03 Unit [2023-06-12 17:59:03,144 INFO L131 PluginConnector]: ------------------------ END ChcToBoogie---------------------------- [2023-06-12 17:59:03,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 17:59:03,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 17:59:03,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 17:59:03,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 17:59:03,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 17:59:03,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 17:59:03,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 17:59:03,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 17:59:03,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 17:59:03,216 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-06-12 17:59:03,217 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-06-12 17:59:03,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure gotoProc given in one single declaration [2023-06-12 17:59:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure gotoProc [2023-06-12 17:59:03,218 INFO L138 BoogieDeclarations]: Found implementation of procedure gotoProc [2023-06-12 17:59:03,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration [2023-06-12 17:59:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure Ultimate.START [2023-06-12 17:59:03,218 INFO L138 BoogieDeclarations]: Found implementation of procedure Ultimate.START [2023-06-12 17:59:03,236 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 17:59:03,236 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 17:59:04,112 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 17:59:04,118 INFO L294 CfgBuilder]: Using library mode [2023-06-12 17:59:04,118 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 17:59:04,119 INFO L201 PluginConnector]: Adding new model equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:04 BoogieIcfgContainer [2023-06-12 17:59:04,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 17:59:04,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-06-12 17:59:04,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-06-12 17:59:04,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-06-12 17:59:04,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:01" (1/5) ... [2023-06-12 17:59:04,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cea3fe9 and model type equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:02" (2/5) ... [2023-06-12 17:59:04,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cea3fe9 and model type equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03" (3/5) ... [2023-06-12 17:59:04,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cea3fe9 and model type equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (4/5) ... [2023-06-12 17:59:04,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cea3fe9 and model type equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-fork.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:04" (5/5) ... [2023-06-12 17:59:04,128 INFO L112 eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2023-06-12 17:59:04,139 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-06-12 17:59:04,139 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-06-12 17:59:04,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-06-12 17:59:04,187 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;@1d342507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-06-12 17:59:04,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-06-12 17:59:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 162 states have (on average 1.4814814814814814) internal successors, (240), 163 states have internal predecessors, (240), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-06-12 17:59:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-06-12 17:59:04,215 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:04,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:04,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:04,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1763680411, now seen corresponding path program 1 times [2023-06-12 17:59:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210501650] [2023-06-12 17:59:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:04,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:04,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:04,411 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210501650] [2023-06-12 17:59:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [210501650] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271150798] [2023-06-12 17:59:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:04,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:04,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:04,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:04,435 INFO L87 Difference]: Start difference. First operand has 238 states, 162 states have (on average 1.4814814814814814) internal successors, (240), 163 states have internal predecessors, (240), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) 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-06-12 17:59:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:05,144 INFO L93 Difference]: Finished difference Result 470 states and 766 transitions. [2023-06-12 17:59:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:05,146 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-06-12 17:59:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:05,162 INFO L225 Difference]: With dead ends: 470 [2023-06-12 17:59:05,162 INFO L226 Difference]: Without dead ends: 468 [2023-06-12 17:59:05,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-06-12 17:59:05,165 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 699 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:05,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 553 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 17:59:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-06-12 17:59:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2023-06-12 17:59:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 320 states have (on average 1.48125) internal successors, (474), 320 states have internal predecessors, (474), 145 states have call successors, (145), 2 states have call predecessors, (145), 2 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2023-06-12 17:59:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 764 transitions. [2023-06-12 17:59:05,236 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 764 transitions. Word has length 8 [2023-06-12 17:59:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:05,237 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 764 transitions. [2023-06-12 17:59:05,237 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-06-12 17:59:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 764 transitions. [2023-06-12 17:59:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-06-12 17:59:05,245 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:05,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:05,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-06-12 17:59:05,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:05,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash 697507751, now seen corresponding path program 1 times [2023-06-12 17:59:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846496739] [2023-06-12 17:59:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:05,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:05,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:05,271 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1846496739] [2023-06-12 17:59:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1846496739] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164132698] [2023-06-12 17:59:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:05,273 INFO L87 Difference]: Start difference. First operand 468 states and 764 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-06-12 17:59:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:06,150 INFO L93 Difference]: Finished difference Result 862 states and 1434 transitions. [2023-06-12 17:59:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:06,151 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-06-12 17:59:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:06,180 INFO L225 Difference]: With dead ends: 862 [2023-06-12 17:59:06,180 INFO L226 Difference]: Without dead ends: 862 [2023-06-12 17:59:06,181 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-06-12 17:59:06,182 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 133 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:06,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1086 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 17:59:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2023-06-12 17:59:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2023-06-12 17:59:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 570 states have (on average 1.5017543859649123) internal successors, (856), 570 states have internal predecessors, (856), 289 states have call successors, (289), 2 states have call predecessors, (289), 2 states have return successors, (289), 289 states have call predecessors, (289), 289 states have call successors, (289) [2023-06-12 17:59:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1434 transitions. [2023-06-12 17:59:06,315 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1434 transitions. Word has length 10 [2023-06-12 17:59:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:06,315 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1434 transitions. [2023-06-12 17:59:06,315 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-06-12 17:59:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1434 transitions. [2023-06-12 17:59:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-06-12 17:59:06,350 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:06,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:06,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-06-12 17:59:06,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:06,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -661287942, now seen corresponding path program 1 times [2023-06-12 17:59:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:06,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1659897688] [2023-06-12 17:59:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:06,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:06,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:06,381 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:06,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1659897688] [2023-06-12 17:59:06,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1659897688] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:06,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:06,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:06,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891786961] [2023-06-12 17:59:06,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:06,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:06,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:06,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:06,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:06,382 INFO L87 Difference]: Start difference. First operand 862 states and 1434 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-06-12 17:59:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:07,655 INFO L93 Difference]: Finished difference Result 1453 states and 2433 transitions. [2023-06-12 17:59:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:07,655 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-06-12 17:59:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:07,719 INFO L225 Difference]: With dead ends: 1453 [2023-06-12 17:59:07,719 INFO L226 Difference]: Without dead ends: 1453 [2023-06-12 17:59:07,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-06-12 17:59:07,720 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 148 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:07,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 711 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-06-12 17:59:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2023-06-12 17:59:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2023-06-12 17:59:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 945 states have (on average 1.5058201058201057) internal successors, (1423), 945 states have internal predecessors, (1423), 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-06-12 17:59:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2433 transitions. [2023-06-12 17:59:07,893 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2433 transitions. Word has length 13 [2023-06-12 17:59:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:07,893 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2433 transitions. [2023-06-12 17:59:07,893 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-06-12 17:59:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2433 transitions. [2023-06-12 17:59:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-06-12 17:59:07,962 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:07,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-06-12 17:59:07,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:07,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1966087223, now seen corresponding path program 1 times [2023-06-12 17:59:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545631867] [2023-06-12 17:59:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:07,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:07,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:07,990 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545631867] [2023-06-12 17:59:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [545631867] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:07,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464600123] [2023-06-12 17:59:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:07,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:07,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:07,992 INFO L87 Difference]: Start difference. First operand 1453 states and 2433 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-06-12 17:59:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:08,791 INFO L93 Difference]: Finished difference Result 1847 states and 3103 transitions. [2023-06-12 17:59:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:08,792 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-06-12 17:59:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:09,000 INFO L225 Difference]: With dead ends: 1847 [2023-06-12 17:59:09,000 INFO L226 Difference]: Without dead ends: 1847 [2023-06-12 17:59:09,000 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-06-12 17:59:09,001 INFO L413 NwaCegarLoop]: 582 mSDtfsCounter, 139 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:09,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1080 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 17:59:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2023-06-12 17:59:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2023-06-12 17:59:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1195 states have (on average 1.5104602510460252) internal successors, (1805), 1195 states have internal predecessors, (1805), 649 states have call successors, (649), 2 states have call predecessors, (649), 2 states have return successors, (649), 649 states have call predecessors, (649), 649 states have call successors, (649) [2023-06-12 17:59:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 3103 transitions. [2023-06-12 17:59:09,348 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 3103 transitions. Word has length 13 [2023-06-12 17:59:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:09,349 INFO L495 AbstractCegarLoop]: Abstraction has 1847 states and 3103 transitions. [2023-06-12 17:59:09,349 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-06-12 17:59:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3103 transitions. [2023-06-12 17:59:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-06-12 17:59:09,704 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:09,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:09,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-06-12 17:59:09,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:09,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1418987143, now seen corresponding path program 1 times [2023-06-12 17:59:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1135761657] [2023-06-12 17:59:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:09,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:09,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:09,736 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1135761657] [2023-06-12 17:59:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1135761657] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:09,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:09,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779241649] [2023-06-12 17:59:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:09,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:09,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:09,738 INFO L87 Difference]: Start difference. First operand 1847 states and 3103 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-06-12 17:59:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:11,131 INFO L93 Difference]: Finished difference Result 2241 states and 3761 transitions. [2023-06-12 17:59:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:11,131 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-06-12 17:59:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:11,356 INFO L225 Difference]: With dead ends: 2241 [2023-06-12 17:59:11,357 INFO L226 Difference]: Without dead ends: 2241 [2023-06-12 17:59:11,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-06-12 17:59:11,357 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 142 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:11,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 717 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-06-12 17:59:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2023-06-12 17:59:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2023-06-12 17:59:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1445 states have (on average 1.505190311418685) internal successors, (2175), 1445 states have internal predecessors, (2175), 793 states have call successors, (793), 2 states have call predecessors, (793), 2 states have return successors, (793), 793 states have call predecessors, (793), 793 states have call successors, (793) [2023-06-12 17:59:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3761 transitions. [2023-06-12 17:59:11,755 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3761 transitions. Word has length 16 [2023-06-12 17:59:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:11,756 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3761 transitions. [2023-06-12 17:59:11,756 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-06-12 17:59:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3761 transitions. [2023-06-12 17:59:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-06-12 17:59:11,923 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:11,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:11,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-06-12 17:59:11,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:11,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash -285002853, now seen corresponding path program 1 times [2023-06-12 17:59:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704114904] [2023-06-12 17:59:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:12,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:12,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-06-12 17:59:12,036 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:12,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704114904] [2023-06-12 17:59:12,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [704114904] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:12,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:12,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549429776] [2023-06-12 17:59:12,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:12,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:12,038 INFO L87 Difference]: Start difference. First operand 2241 states and 3761 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-06-12 17:59:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:13,129 INFO L93 Difference]: Finished difference Result 2635 states and 4429 transitions. [2023-06-12 17:59:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:13,129 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-06-12 17:59:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:13,305 INFO L225 Difference]: With dead ends: 2635 [2023-06-12 17:59:13,305 INFO L226 Difference]: Without dead ends: 2635 [2023-06-12 17:59:13,306 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-06-12 17:59:13,307 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 145 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:13,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1074 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 17:59:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2023-06-12 17:59:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2023-06-12 17:59:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 1695 states have (on average 1.5073746312684366) internal successors, (2555), 1695 states have internal predecessors, (2555), 937 states have call successors, (937), 2 states have call predecessors, (937), 2 states have return successors, (937), 937 states have call predecessors, (937), 937 states have call successors, (937) [2023-06-12 17:59:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4429 transitions. [2023-06-12 17:59:13,842 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4429 transitions. Word has length 16 [2023-06-12 17:59:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:13,842 INFO L495 AbstractCegarLoop]: Abstraction has 2635 states and 4429 transitions. [2023-06-12 17:59:13,842 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-06-12 17:59:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4429 transitions. [2023-06-12 17:59:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-06-12 17:59:14,170 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:14,170 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-06-12 17:59:14,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-06-12 17:59:14,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:14,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1608066043, now seen corresponding path program 1 times [2023-06-12 17:59:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565078244] [2023-06-12 17:59:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:14,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:14,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-06-12 17:59:14,257 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565078244] [2023-06-12 17:59:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1565078244] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263891739] [2023-06-12 17:59:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:14,258 INFO L87 Difference]: Start difference. First operand 2635 states and 4429 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-06-12 17:59:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:15,718 INFO L93 Difference]: Finished difference Result 3029 states and 5085 transitions. [2023-06-12 17:59:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:15,718 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-06-12 17:59:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:15,942 INFO L225 Difference]: With dead ends: 3029 [2023-06-12 17:59:15,942 INFO L226 Difference]: Without dead ends: 3029 [2023-06-12 17:59:15,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-06-12 17:59:15,942 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 134 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:15,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 725 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-06-12 17:59:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2023-06-12 17:59:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2023-06-12 17:59:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 1945 states have (on average 1.502827763496144) internal successors, (2923), 1945 states have internal predecessors, (2923), 1081 states have call successors, (1081), 2 states have call predecessors, (1081), 2 states have return successors, (1081), 1081 states have call predecessors, (1081), 1081 states have call successors, (1081) [2023-06-12 17:59:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 5085 transitions. [2023-06-12 17:59:16,473 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 5085 transitions. Word has length 19 [2023-06-12 17:59:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:16,474 INFO L495 AbstractCegarLoop]: Abstraction has 3029 states and 5085 transitions. [2023-06-12 17:59:16,474 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-06-12 17:59:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 5085 transitions. [2023-06-12 17:59:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-06-12 17:59:17,032 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:17,032 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-06-12 17:59:17,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-06-12 17:59:17,032 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:17,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash 842985321, now seen corresponding path program 1 times [2023-06-12 17:59:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:17,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [737696218] [2023-06-12 17:59:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:17,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:17,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-06-12 17:59:17,063 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [737696218] [2023-06-12 17:59:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [737696218] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970538503] [2023-06-12 17:59:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:17,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:17,064 INFO L87 Difference]: Start difference. First operand 3029 states and 5085 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-06-12 17:59:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:18,168 INFO L93 Difference]: Finished difference Result 3423 states and 5751 transitions. [2023-06-12 17:59:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:18,168 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-06-12 17:59:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:18,495 INFO L225 Difference]: With dead ends: 3423 [2023-06-12 17:59:18,495 INFO L226 Difference]: Without dead ends: 3423 [2023-06-12 17:59:18,495 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-06-12 17:59:18,496 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 149 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:18,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1070 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 17:59:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2023-06-12 17:59:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3423. [2023-06-12 17:59:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 2195 states have (on average 1.5038724373576309) internal successors, (3301), 2195 states have internal predecessors, (3301), 1225 states have call successors, (1225), 2 states have call predecessors, (1225), 2 states have return successors, (1225), 1225 states have call predecessors, (1225), 1225 states have call successors, (1225) [2023-06-12 17:59:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 5751 transitions. [2023-06-12 17:59:19,371 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 5751 transitions. Word has length 19 [2023-06-12 17:59:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:19,371 INFO L495 AbstractCegarLoop]: Abstraction has 3423 states and 5751 transitions. [2023-06-12 17:59:19,372 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-06-12 17:59:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 5751 transitions. [2023-06-12 17:59:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-06-12 17:59:20,772 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:20,772 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-06-12 17:59:20,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-06-12 17:59:20,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:20,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1407962701, now seen corresponding path program 1 times [2023-06-12 17:59:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:20,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835834843] [2023-06-12 17:59:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:20,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:20,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:20,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-06-12 17:59:20,799 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835834843] [2023-06-12 17:59:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1835834843] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:20,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984941834] [2023-06-12 17:59:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:20,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:20,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:20,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:20,800 INFO L87 Difference]: Start difference. First operand 3423 states and 5751 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-06-12 17:59:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:22,378 INFO L93 Difference]: Finished difference Result 3817 states and 6419 transitions. [2023-06-12 17:59:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:22,378 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-06-12 17:59:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:22,772 INFO L225 Difference]: With dead ends: 3817 [2023-06-12 17:59:22,772 INFO L226 Difference]: Without dead ends: 3817 [2023-06-12 17:59:22,772 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-06-12 17:59:22,773 INFO L413 NwaCegarLoop]: 576 mSDtfsCounter, 151 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:22,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1068 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-06-12 17:59:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2023-06-12 17:59:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3817. [2023-06-12 17:59:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3817 states, 2445 states have (on average 1.505521472392638) internal successors, (3681), 2445 states have internal predecessors, (3681), 1369 states have call successors, (1369), 2 states have call predecessors, (1369), 2 states have return successors, (1369), 1369 states have call predecessors, (1369), 1369 states have call successors, (1369) [2023-06-12 17:59:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 6419 transitions. [2023-06-12 17:59:23,713 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 6419 transitions. Word has length 22 [2023-06-12 17:59:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:23,713 INFO L495 AbstractCegarLoop]: Abstraction has 3817 states and 6419 transitions. [2023-06-12 17:59:23,713 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-06-12 17:59:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 6419 transitions. [2023-06-12 17:59:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-06-12 17:59:25,761 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:25,761 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-06-12 17:59:25,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-06-12 17:59:25,761 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:25,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash 338647989, now seen corresponding path program 1 times [2023-06-12 17:59:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099393838] [2023-06-12 17:59:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:25,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 10 conjunts are in the unsatisfiable core [2023-06-12 17:59:25,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-06-12 17:59:25,814 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099393838] [2023-06-12 17:59:25,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1099393838] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 17:59:25,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 17:59:25,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2023-06-12 17:59:25,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508157146] [2023-06-12 17:59:25,814 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 17:59:25,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:25,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:25,815 INFO L87 Difference]: Start difference. First operand 3817 states and 6419 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-06-12 17:59:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:29,767 INFO L93 Difference]: Finished difference Result 8605 states and 14467 transitions. [2023-06-12 17:59:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:29,768 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-06-12 17:59:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:30,625 INFO L225 Difference]: With dead ends: 8605 [2023-06-12 17:59:30,625 INFO L226 Difference]: Without dead ends: 4609 [2023-06-12 17:59:30,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-06-12 17:59:30,626 INFO L413 NwaCegarLoop]: 1074 mSDtfsCounter, 341 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:30,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1790 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-06-12 17:59:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2023-06-12 17:59:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4605. [2023-06-12 17:59:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 2945 states have (on average 1.5045840407470288) internal successors, (4431), 2945 states have internal predecessors, (4431), 1657 states have call successors, (1657), 2 states have call predecessors, (1657), 2 states have return successors, (1657), 1657 states have call predecessors, (1657), 1657 states have call successors, (1657) [2023-06-12 17:59:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 7745 transitions. [2023-06-12 17:59:32,299 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 7745 transitions. Word has length 25 [2023-06-12 17:59:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:32,299 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 7745 transitions. [2023-06-12 17:59:32,299 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-06-12 17:59:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 7745 transitions. [2023-06-12 17:59:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-06-12 17:59:35,660 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:35,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:35,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-06-12 17:59:35,661 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:35,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1088462042, now seen corresponding path program 1 times [2023-06-12 17:59:35,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:35,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106179089] [2023-06-12 17:59:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:35,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:35,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-06-12 17:59:35,695 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:35,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106179089] [2023-06-12 17:59:35,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [106179089] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:35,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:35,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181511854] [2023-06-12 17:59:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:35,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:35,696 INFO L87 Difference]: Start difference. First operand 4605 states and 7745 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06-12 17:59:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:37,388 INFO L93 Difference]: Finished difference Result 4999 states and 8409 transitions. [2023-06-12 17:59:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:37,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 40 [2023-06-12 17:59:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:38,185 INFO L225 Difference]: With dead ends: 4999 [2023-06-12 17:59:38,185 INFO L226 Difference]: Without dead ends: 4999 [2023-06-12 17:59:38,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-06-12 17:59:38,186 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 125 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:38,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1094 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 17:59:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2023-06-12 17:59:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4999. [2023-06-12 17:59:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4999 states, 3195 states have (on average 1.5045383411580595) internal successors, (4807), 3195 states have internal predecessors, (4807), 1801 states have call successors, (1801), 2 states have call predecessors, (1801), 2 states have return successors, (1801), 1801 states have call predecessors, (1801), 1801 states have call successors, (1801) [2023-06-12 17:59:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 8409 transitions. [2023-06-12 17:59:39,921 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 8409 transitions. Word has length 40 [2023-06-12 17:59:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:39,921 INFO L495 AbstractCegarLoop]: Abstraction has 4999 states and 8409 transitions. [2023-06-12 17:59:39,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06-12 17:59:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 8409 transitions. [2023-06-12 17:59:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-06-12 17:59:44,050 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:44,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:44,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-06-12 17:59:44,050 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:44,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1123915889, now seen corresponding path program 1 times [2023-06-12 17:59:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:44,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517320919] [2023-06-12 17:59:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:44,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 20 conjunts are in the unsatisfiable core [2023-06-12 17:59:44,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-06-12 17:59:44,190 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:44,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517320919] [2023-06-12 17:59:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [517320919] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 17:59:44,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 17:59:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 17:59:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135726867] [2023-06-12 17:59:44,190 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 17:59:44,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 17:59:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 17:59:44,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-06-12 17:59:44,191 INFO L87 Difference]: Start difference. First operand 4999 states and 8409 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-06-12 17:59:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:54,413 INFO L93 Difference]: Finished difference Result 14981 states and 25187 transitions. [2023-06-12 17:59:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-06-12 17:59:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 43 [2023-06-12 17:59:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:56,900 INFO L225 Difference]: With dead ends: 14981 [2023-06-12 17:59:56,900 INFO L226 Difference]: Without dead ends: 7797 [2023-06-12 17:59:56,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-06-12 17:59:56,900 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 445 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 3950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:56,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 3120 Invalid, 3950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-06-12 17:59:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7797 states. [2023-06-12 17:59:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7797 to 7395. [2023-06-12 17:59:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7395 states, 4727 states have (on average 1.5030674846625767) internal successors, (7105), 4727 states have internal predecessors, (7105), 2665 states have call successors, (2665), 2 states have call predecessors, (2665), 2 states have return successors, (2665), 2665 states have call predecessors, (2665), 2665 states have call successors, (2665) [2023-06-12 18:00:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7395 states to 7395 states and 12435 transitions. [2023-06-12 18:00:00,674 INFO L78 Accepts]: Start accepts. Automaton has 7395 states and 12435 transitions. Word has length 43 [2023-06-12 18:00:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:00:00,674 INFO L495 AbstractCegarLoop]: Abstraction has 7395 states and 12435 transitions. [2023-06-12 18:00:00,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-06-12 18:00:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 7395 states and 12435 transitions. [2023-06-12 18:00:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-06-12 18:00:10,346 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:00:10,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-06-12 18:00:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-06-12 18:00:10,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:00:10,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:00:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash 510014069, now seen corresponding path program 2 times [2023-06-12 18:00:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:00:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821737012] [2023-06-12 18:00:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:00:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:00:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:00:10,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 5 conjunts are in the unsatisfiable core [2023-06-12 18:00:10,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:00:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-06-12 18:00:10,512 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:00:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821737012] [2023-06-12 18:00:10,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [821737012] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:00:10,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:00:10,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:00:10,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865832662] [2023-06-12 18:00:10,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:00:10,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:00:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:00:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:00:10,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:00:10,514 INFO L87 Difference]: Start difference. First operand 7395 states and 12435 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-06-12 18:00:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:00:18,538 INFO L93 Difference]: Finished difference Result 13199 states and 22659 transitions. [2023-06-12 18:00:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:00:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 61 [2023-06-12 18:00:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:00:24,201 INFO L225 Difference]: With dead ends: 13199 [2023-06-12 18:00:24,201 INFO L226 Difference]: Without dead ends: 13199 [2023-06-12 18:00:24,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-06-12 18:00:24,202 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 110 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-06-12 18:00:24,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1010 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-06-12 18:00:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13199 states. [2023-06-12 18:00:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13199 to 11903. [2023-06-12 18:00:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11903 states, 7507 states have (on average 1.5602770747302517) internal successors, (11713), 7507 states have internal predecessors, (11713), 4393 states have call successors, (4393), 2 states have call predecessors, (4393), 2 states have return successors, (4393), 4393 states have call predecessors, (4393), 4393 states have call successors, (4393) [2023-06-12 18:00:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11903 states to 11903 states and 20499 transitions. [2023-06-12 18:00:34,377 INFO L78 Accepts]: Start accepts. Automaton has 11903 states and 20499 transitions. Word has length 61 [2023-06-12 18:00:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:00:34,377 INFO L495 AbstractCegarLoop]: Abstraction has 11903 states and 20499 transitions. [2023-06-12 18:00:34,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-06-12 18:00:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 11903 states and 20499 transitions. [2023-06-12 18:01:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-06-12 18:01:05,970 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:01:05,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-06-12 18:01:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-06-12 18:01:05,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:01:05,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:01:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1604194386, now seen corresponding path program 1 times [2023-06-12 18:01:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:01:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [116052793] [2023-06-12 18:01:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:01:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:01:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-06-12 18:01:06,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-06-12 18:01:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-06-12 18:01:06,346 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2023-06-12 18:01:06,346 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-06-12 18:01:06,347 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining) [2023-06-12 18:01:06,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-06-12 18:01:06,351 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:01:06,367 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-06-12 18:01:06,368 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Unknown sort Int at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.TypeSortTranslator.getType(TypeSortTranslator.java:144) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:396) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProgramState(DefaultTranslator.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateProgramExecution(RCFGBacktranslator.java:280) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:219) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:208) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:582) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-06-12 18:01:06,370 INFO L158 Benchmark]: Toolchain (without parser) took 124454.27ms. Allocated memory was 339.7MB in the beginning and 15.0GB in the end (delta: 14.6GB). Free memory was 290.4MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 10.2GB. Max. memory is 15.0GB. [2023-06-12 18:01:06,370 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 339.7MB. Free memory is still 291.5MB. There was no memory consumed. Max. memory is 15.0GB. [2023-06-12 18:01:06,370 INFO L158 Benchmark]: Boogie Preprocessor took 68.14ms. Allocated memory is still 564.1MB. Free memory was 520.2MB in the beginning and 518.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 18:01:06,370 INFO L158 Benchmark]: RCFGBuilder took 906.48ms. Allocated memory is still 564.1MB. Free memory was 518.1MB in the beginning and 441.3MB in the end (delta: 76.8MB). Peak memory consumption was 169.9MB. Max. memory is 15.0GB. [2023-06-12 18:01:06,371 INFO L158 Benchmark]: IcfgToChc took 918.06ms. Allocated memory was 339.7MB in the beginning and 564.1MB in the end (delta: 224.4MB). Free memory was 279.2MB in the beginning and 432.6MB in the end (delta: -153.4MB). Peak memory consumption was 77.5MB. Max. memory is 15.0GB. [2023-06-12 18:01:06,371 INFO L158 Benchmark]: ChcSmtPrinter took 68.42ms. Allocated memory is still 564.1MB. Free memory was 432.6MB in the beginning and 523.3MB in the end (delta: -90.7MB). Peak memory consumption was 8.9MB. Max. memory is 15.0GB. [2023-06-12 18:01:06,372 INFO L158 Benchmark]: ChcToBoogie took 37.85ms. Allocated memory is still 564.1MB. Free memory was 523.3MB in the beginning and 520.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. [2023-06-12 18:01:06,372 INFO L158 Benchmark]: TraceAbstraction took 122248.44ms. Allocated memory was 564.1MB in the beginning and 15.0GB in the end (delta: 14.4GB). Free memory was 441.3MB in the beginning and 4.7GB in the end (delta: -4.3GB). Peak memory consumption was 10.2GB. Max. memory is 15.0GB. [2023-06-12 18:01:06,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 339.7MB. Free memory is still 291.5MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 68.14ms. Allocated memory is still 564.1MB. Free memory was 520.2MB in the beginning and 518.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 906.48ms. Allocated memory is still 564.1MB. Free memory was 518.1MB in the beginning and 441.3MB in the end (delta: 76.8MB). Peak memory consumption was 169.9MB. Max. memory is 15.0GB. * IcfgToChc took 918.06ms. Allocated memory was 339.7MB in the beginning and 564.1MB in the end (delta: 224.4MB). Free memory was 279.2MB in the beginning and 432.6MB in the end (delta: -153.4MB). Peak memory consumption was 77.5MB. Max. memory is 15.0GB. * ChcSmtPrinter took 68.42ms. Allocated memory is still 564.1MB. Free memory was 432.6MB in the beginning and 523.3MB in the end (delta: -90.7MB). Peak memory consumption was 8.9MB. Max. memory is 15.0GB. * ChcToBoogie took 37.85ms. Allocated memory is still 564.1MB. Free memory was 523.3MB in the beginning and 520.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 15.0GB. * TraceAbstraction took 122248.44ms. Allocated memory was 564.1MB in the beginning and 15.0GB in the end (delta: 14.4GB). Free memory was 441.3MB in the beginning and 4.7GB in the end (delta: -4.3GB). Peak memory consumption was 10.2GB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: IllegalArgumentException: Unknown sort Int de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Unknown sort Int: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.TypeSortTranslator.getType(TypeSortTranslator.java:144) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-06-12 18:01:06,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-06-12 18:01:06,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...