./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 02:50:02,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 02:50:02,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 02:50:02,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 02:50:02,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 02:50:02,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 02:50:02,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 02:50:02,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 02:50:02,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 02:50:02,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 02:50:02,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 02:50:02,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 02:50:02,678 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 02:50:02,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 02:50:02,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 02:50:02,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 02:50:02,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 02:50:02,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 02:50:02,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 02:50:02,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 02:50:02,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 02:50:02,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 02:50:02,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:50:02,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 02:50:02,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 02:50:02,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 02:50:02,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 02:50:02,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 02:50:02,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 02:50:02,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 02:50:02,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 02:50:02,987 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 02:50:02,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-01-24 02:50:04,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/2f4fc1653/9561c821131842dfb66b19a7369c50e8/FLAGf0c5b8d0b [2025-01-24 02:50:04,465 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 02:50:04,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-01-24 02:50:04,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/2f4fc1653/9561c821131842dfb66b19a7369c50e8/FLAGf0c5b8d0b [2025-01-24 02:50:04,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/2f4fc1653/9561c821131842dfb66b19a7369c50e8 [2025-01-24 02:50:04,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 02:50:04,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 02:50:04,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 02:50:04,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 02:50:04,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 02:50:04,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c905ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04, skipping insertion in model container [2025-01-24 02:50:04,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 02:50:04,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-01-24 02:50:04,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:50:04,687 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 02:50:04,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-01-24 02:50:04,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:50:04,754 INFO L204 MainTranslator]: Completed translation [2025-01-24 02:50:04,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04 WrapperNode [2025-01-24 02:50:04,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 02:50:04,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 02:50:04,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 02:50:04,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 02:50:04,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,791 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 128 [2025-01-24 02:50:04,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 02:50:04,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 02:50:04,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 02:50:04,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 02:50:04,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 02:50:04,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 02:50:04,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 02:50:04,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 02:50:04,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (1/1) ... [2025-01-24 02:50:04,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:50:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:04,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-24 02:50:04,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-24 02:50:04,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 02:50:04,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-24 02:50:04,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-24 02:50:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-24 02:50:04,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-24 02:50:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 02:50:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-24 02:50:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-24 02:50:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 02:50:04,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 02:50:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-24 02:50:04,885 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 02:50:04,986 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 02:50:04,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 02:50:05,189 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 02:50:05,189 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 02:50:05,331 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 02:50:05,332 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-24 02:50:05,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:50:05 BoogieIcfgContainer [2025-01-24 02:50:05,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 02:50:05,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 02:50:05,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 02:50:05,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 02:50:05,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 02:50:04" (1/3) ... [2025-01-24 02:50:05,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510da7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:50:05, skipping insertion in model container [2025-01-24 02:50:05,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:50:04" (2/3) ... [2025-01-24 02:50:05,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510da7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:50:05, skipping insertion in model container [2025-01-24 02:50:05,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:50:05" (3/3) ... [2025-01-24 02:50:05,343 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-01-24 02:50:05,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 02:50:05,357 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-24 02:50:05,357 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 02:50:05,403 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-24 02:50:05,464 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:50:05,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 02:50:05,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:05,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-24 02:50:05,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-24 02:50:05,539 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 02:50:05,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 02:50:05,556 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@45f1d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:50:05,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-24 02:50:05,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:05,750 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:05,752 INFO L139 ounterexampleChecker]: Examining path program with hash -1336814724, occurence #1 [2025-01-24 02:50:05,752 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:50:05,752 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -551705718, now seen corresponding path program 1 times [2025-01-24 02:50:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252730016] [2025-01-24 02:50:05,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:05,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 02:50:05,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 02:50:05,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:05,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252730016] [2025-01-24 02:50:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252730016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:50:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:50:05,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 02:50:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886948699] [2025-01-24 02:50:05,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:50:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 02:50:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:05,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 02:50:05,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 02:50:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:05,945 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:05,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:05,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 02:50:06,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:06,001 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:06,001 INFO L139 ounterexampleChecker]: Examining path program with hash 103784074, occurence #1 [2025-01-24 02:50:06,001 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:50:06,001 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:06,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:06,002 INFO L85 PathProgramCache]: Analyzing trace with hash 106151200, now seen corresponding path program 1 times [2025-01-24 02:50:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:06,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686351276] [2025-01-24 02:50:06,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:06,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-24 02:50:06,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 02:50:06,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:06,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686351276] [2025-01-24 02:50:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686351276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:50:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:50:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 02:50:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074694452] [2025-01-24 02:50:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:50:06,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 02:50:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 02:50:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 02:50:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,188 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:06,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:06,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-24 02:50:06,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:06,271 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:06,271 INFO L139 ounterexampleChecker]: Examining path program with hash 932887066, occurence #1 [2025-01-24 02:50:06,272 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:50:06,272 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1323861897, now seen corresponding path program 1 times [2025-01-24 02:50:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:06,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287250602] [2025-01-24 02:50:06,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-24 02:50:06,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-24 02:50:06,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287250602] [2025-01-24 02:50:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287250602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:50:06,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:50:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 02:50:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074255440] [2025-01-24 02:50:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:50:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 02:50:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:06,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 02:50:06,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 02:50:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-24 02:50:06,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:06,524 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:06,524 INFO L139 ounterexampleChecker]: Examining path program with hash 2133469779, occurence #1 [2025-01-24 02:50:06,524 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:50:06,524 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1417637232, now seen corresponding path program 1 times [2025-01-24 02:50:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686366444] [2025-01-24 02:50:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:06,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-24 02:50:06,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-24 02:50:06,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:06,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:06,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686366444] [2025-01-24 02:50:06,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686366444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:50:06,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:50:06,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:50:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154823023] [2025-01-24 02:50:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:50:06,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:50:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:06,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:50:06,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:50:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,704 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:06,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:06,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-24 02:50:06,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:06,778 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:06,778 INFO L139 ounterexampleChecker]: Examining path program with hash 2133469779, occurence #2 [2025-01-24 02:50:06,778 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:50:06,778 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-24 02:50:06,779 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:06,779 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:50:06,779 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:06,779 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-01-24 02:50:06,804 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:06,804 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-01-24 02:50:06,804 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:06,804 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-24 02:50:06,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1730565123, now seen corresponding path program 1 times [2025-01-24 02:50:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112707538] [2025-01-24 02:50:06,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:06,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-24 02:50:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-24 02:50:06,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:06,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:06,857 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:06,858 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:06,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-01-24 02:50:06,858 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:06,858 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-01-24 02:50:06,859 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:06,859 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:50:06,859 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:06,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1440056380, now seen corresponding path program 1 times [2025-01-24 02:50:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897165130] [2025-01-24 02:50:06,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-24 02:50:06,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-24 02:50:06,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897165130] [2025-01-24 02:50:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897165130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:50:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063695487] [2025-01-24 02:50:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:07,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:50:07,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-24 02:50:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-24 02:50:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-24 02:50:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:07,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-24 02:50:07,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:50:07,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-24 02:50:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:07,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:50:08,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-01-24 02:50:08,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:50:08,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-01-24 02:50:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063695487] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:50:08,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:50:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-01-24 02:50:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971981213] [2025-01-24 02:50:08,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:50:08,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-24 02:50:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:08,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-24 02:50:08,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2025-01-24 02:50:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:08,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:08,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:08,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:08,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-24 02:50:09,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-24 02:50:09,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-24 02:50:09,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:09,636 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:09,636 INFO L139 ounterexampleChecker]: Examining path program with hash -1332394525, occurence #1 [2025-01-24 02:50:09,636 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:50:09,636 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:09,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1278629529, now seen corresponding path program 2 times [2025-01-24 02:50:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:09,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655016553] [2025-01-24 02:50:09,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:50:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:09,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-24 02:50:09,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-24 02:50:09,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:50:09,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-24 02:50:09,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:09,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655016553] [2025-01-24 02:50:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655016553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:50:09,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:50:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:50:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705512833] [2025-01-24 02:50:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:50:09,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:50:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:50:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:50:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:09,746 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:09,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:09,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:09,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:09,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:09,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:09,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-01-24 02:50:09,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-24 02:50:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-24 02:50:09,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:09,841 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:09,841 INFO L139 ounterexampleChecker]: Examining path program with hash 2133469779, occurence #3 [2025-01-24 02:50:09,841 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:50:09,841 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-24 02:50:09,841 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:09,841 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:50:09,841 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:09,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-01-24 02:50:09,842 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:09,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-01-24 02:50:09,842 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:09,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-24 02:50:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 992657328, now seen corresponding path program 1 times [2025-01-24 02:50:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396529658] [2025-01-24 02:50:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:09,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-24 02:50:09,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-24 02:50:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:09,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:09,887 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:09,887 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:09,887 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-01-24 02:50:09,887 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:09,888 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 26 is hopeless, skipping. [2025-01-24 02:50:09,888 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-01-24 02:50:09,888 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:09,888 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-01-24 02:50:09,888 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:09,888 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:50:09,888 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:09,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash 861590944, now seen corresponding path program 3 times [2025-01-24 02:50:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019308600] [2025-01-24 02:50:09,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:50:09,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:09,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-01-24 02:50:09,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-01-24 02:50:09,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-24 02:50:09,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-24 02:50:10,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019308600] [2025-01-24 02:50:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019308600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:50:10,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:50:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:50:10,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146184015] [2025-01-24 02:50:10,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:50:10,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:50:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:10,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:50:10,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:50:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:10,092 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:10,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:10,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-24 02:50:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:10,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7 [2025-01-24 02:50:10,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:10,235 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:10,235 INFO L139 ounterexampleChecker]: Examining path program with hash -1079789162, occurence #1 [2025-01-24 02:50:10,235 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:50:10,235 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:10,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1667070623, now seen corresponding path program 1 times [2025-01-24 02:50:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133825563] [2025-01-24 02:50:10,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:10,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-24 02:50:10,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-24 02:50:10,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:10,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133825563] [2025-01-24 02:50:11,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133825563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:50:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107173278] [2025-01-24 02:50:11,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:11,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:11,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:11,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:50:11,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-24 02:50:11,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-24 02:50:11,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-24 02:50:11,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:11,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:11,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-24 02:50:11,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:50:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:12,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:50:12,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:50:12,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-01-24 02:50:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107173278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:50:13,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:50:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2025-01-24 02:50:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245141249] [2025-01-24 02:50:13,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:50:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-24 02:50:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:13,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-24 02:50:13,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2025-01-24 02:50:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:13,194 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.409090909090909) internal successors, (106), 43 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:13,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:13,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:13,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:13,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:13,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-01-24 02:50:13,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:13,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:13,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-24 02:50:14,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-24 02:50:15,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:15,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:15,010 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:15,010 INFO L139 ounterexampleChecker]: Examining path program with hash -1079789162, occurence #2 [2025-01-24 02:50:15,010 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:50:15,010 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-24 02:50:15,010 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:15,011 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:50:15,011 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:15,011 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-01-24 02:50:15,011 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:15,011 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-01-24 02:50:15,011 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:15,011 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-01-24 02:50:15,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -486792813, now seen corresponding path program 1 times [2025-01-24 02:50:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965096218] [2025-01-24 02:50:15,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 02:50:15,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 02:50:15,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:15,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:15,044 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:15,045 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:15,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-01-24 02:50:15,045 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:15,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-01-24 02:50:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2087365379, now seen corresponding path program 1 times [2025-01-24 02:50:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:15,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389793829] [2025-01-24 02:50:15,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-24 02:50:15,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-24 02:50:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:15,080 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:15,080 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:15,080 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-01-24 02:50:15,080 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:15,080 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 36 is hopeless, skipping. [2025-01-24 02:50:15,080 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-01-24 02:50:15,080 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:15,080 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47 [2025-01-24 02:50:15,080 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:15,080 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:50:15,080 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:15,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash -4065379, now seen corresponding path program 2 times [2025-01-24 02:50:15,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:15,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995898422] [2025-01-24 02:50:15,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:50:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:15,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-24 02:50:15,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-24 02:50:15,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:50:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995898422] [2025-01-24 02:50:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995898422] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:50:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569971805] [2025-01-24 02:50:16,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:50:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:16,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:50:16,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-24 02:50:16,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-24 02:50:16,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-24 02:50:16,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:50:16,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:16,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-24 02:50:16,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:50:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:17,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:50:18,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:50:18,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-01-24 02:50:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569971805] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:50:18,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:50:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 63 [2025-01-24 02:50:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842001053] [2025-01-24 02:50:18,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:50:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-24 02:50:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:18,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-24 02:50:18,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=3495, Unknown=0, NotChecked=0, Total=4032 [2025-01-24 02:50:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:18,723 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:18,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2025-01-24 02:50:18,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:50:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-24 02:50:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-24 02:50:21,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-24 02:50:21,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:21,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:21,946 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:21,946 INFO L139 ounterexampleChecker]: Examining path program with hash -1079789162, occurence #3 [2025-01-24 02:50:21,946 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:50:21,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-24 02:50:21,946 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:21,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:50:21,946 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:21,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-01-24 02:50:21,946 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:21,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-24 02:50:21,946 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:21,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-01-24 02:50:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 894892623, now seen corresponding path program 1 times [2025-01-24 02:50:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029071570] [2025-01-24 02:50:21,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:21,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-24 02:50:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 02:50:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:21,971 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:21,971 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:21,971 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-01-24 02:50:21,971 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:21,971 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-01-24 02:50:21,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1329954273, now seen corresponding path program 1 times [2025-01-24 02:50:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:21,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696028047] [2025-01-24 02:50:21,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:21,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-24 02:50:22,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-24 02:50:22,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:22,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:22,007 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:22,007 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:22,007 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-01-24 02:50:22,007 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:22,007 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 37 is hopeless, skipping. [2025-01-24 02:50:22,007 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 42 [2025-01-24 02:50:22,007 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:22,008 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 46 is hopeless, skipping. [2025-01-24 02:50:22,008 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 55 [2025-01-24 02:50:22,008 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:22,008 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-01-24 02:50:22,008 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:22,008 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:50:22,008 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1718471074, now seen corresponding path program 3 times [2025-01-24 02:50:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736332749] [2025-01-24 02:50:22,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:50:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:22,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 5 equivalence classes. [2025-01-24 02:50:22,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 60 of 60 statements. [2025-01-24 02:50:22,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-24 02:50:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:23,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736332749] [2025-01-24 02:50:23,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736332749] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:50:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603218866] [2025-01-24 02:50:23,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:50:23,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:23,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:23,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:50:23,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-24 02:50:23,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 5 equivalence classes. [2025-01-24 02:50:24,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 60 of 60 statements. [2025-01-24 02:50:24,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-24 02:50:24,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:24,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-24 02:50:24,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:50:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:25,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:50:27,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:50:27,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 143 treesize of output 190 [2025-01-24 02:50:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603218866] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:50:28,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:50:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 82 [2025-01-24 02:50:28,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081261265] [2025-01-24 02:50:28,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:50:28,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-01-24 02:50:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:50:28,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-01-24 02:50:28,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=5893, Unknown=0, NotChecked=0, Total=6806 [2025-01-24 02:50:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:28,209 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:50:28,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 2.0602409638554215) internal successors, (171), 82 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:50:28,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:28,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:28,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:28,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:50:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-01-24 02:50:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-01-24 02:50:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-24 02:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-24 02:50:34,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-24 02:50:34,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2025-01-24 02:50:34,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:50:34,886 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:50:34,886 INFO L139 ounterexampleChecker]: Examining path program with hash -1079789162, occurence #4 [2025-01-24 02:50:34,886 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:50:34,886 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-24 02:50:34,886 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,886 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:50:34,886 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,886 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-01-24 02:50:34,886 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:34,886 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-01-24 02:50:34,886 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:34,887 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-01-24 02:50:34,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash 777467703, now seen corresponding path program 1 times [2025-01-24 02:50:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:34,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079302187] [2025-01-24 02:50:34,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:34,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-24 02:50:34,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-24 02:50:34,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:34,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:34,913 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:34,913 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:34,913 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-01-24 02:50:34,913 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,913 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-01-24 02:50:34,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash -107319391, now seen corresponding path program 1 times [2025-01-24 02:50:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-24 02:50:34,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129138351] [2025-01-24 02:50:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:50:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:34,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-24 02:50:34,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-24 02:50:34,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:50:34,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 02:50:34,956 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-24 02:50:34,956 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-24 02:50:34,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 34 [2025-01-24 02:50:34,956 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,956 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 38 is hopeless, skipping. [2025-01-24 02:50:34,956 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-01-24 02:50:34,956 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,957 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 47 is hopeless, skipping. [2025-01-24 02:50:34,957 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 52 [2025-01-24 02:50:34,957 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,957 INFO L162 ounterexampleChecker]: Commutativity condition check at non-minimality point 56 is hopeless, skipping. [2025-01-24 02:50:34,957 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-01-24 02:50:34,957 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:50:34,957 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 67 [2025-01-24 02:50:34,957 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:50:34,957 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:50:34,957 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:50:34,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:50:34,957 INFO L85 PathProgramCache]: Analyzing trace with hash -927959874, now seen corresponding path program 4 times [2025-01-24 02:50:34,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:50:34,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317274744] [2025-01-24 02:50:34,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 02:50:34,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:50:34,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-01-24 02:50:35,022 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-01-24 02:50:35,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-24 02:50:35,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:50:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317274744] [2025-01-24 02:50:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317274744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:50:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805535039] [2025-01-24 02:50:37,511 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 02:50:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:50:37,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:50:37,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:50:37,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-24 02:50:37,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-01-24 02:50:37,591 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-01-24 02:50:37,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-24 02:50:37,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:50:37,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-01-24 02:50:37,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:50:39,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,710 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-24 02:50:39,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,719 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-24 02:50:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-24 02:50:39,721 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-24 02:50:39,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:50:39,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 37 [2025-01-24 02:50:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:50:39,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:50:44,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:50:44,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 213 treesize of output 699 [2025-01-24 02:50:51,089 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:50:53,715 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:50:55,518 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:50:56,745 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:50:57,515 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:50:58,243 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:00,642 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:00,922 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:01,212 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:02,460 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:04,016 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:05,403 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:05,683 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:05,972 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:07,202 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:11,322 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:14,470 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:16,127 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:17,830 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:17,961 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:18,379 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-24 02:51:19,616 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:20,102 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:20,659 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:21,291 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:22,298 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:25,520 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:25,680 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:26,180 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:26,522 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:26,871 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:27,046 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:27,588 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:28,174 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-24 02:51:29,736 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-24 02:51:31,389 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:51:31,958 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:51:32,152 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:52:40,059 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:52:41,178 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:52:43,335 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-24 02:52:43,999 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:52:44,601 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:53:14,333 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:53:44,309 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:53:44,390 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:53:44,650 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:53:54,978 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:53:55,192 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:53:55,267 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:54:15,983 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-24 02:54:16,259 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:54:16,377 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:16,529 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:54:18,389 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:18,749 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:18,967 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:19,203 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:19,785 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:20,132 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:20,710 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:21,022 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:21,192 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:21,368 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:21,611 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:39,171 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:54:42,742 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:55:07,554 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:55:07,771 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:55:07,883 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:55:08,157 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:56:17,467 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:57:17,819 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:57:37,250 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:57:37,487 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-24 02:57:37,615 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-24 02:57:45,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2025-01-24 02:57:45,306 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-01-24 02:57:45,307 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-24 02:57:45,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-24 02:57:45,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2025-01-24 02:57:45,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-24 02:57:45,514 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 70 more [2025-01-24 02:57:45,519 INFO L158 Benchmark]: Toolchain (without parser) took 461027.33ms. Allocated memory was 83.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 59.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-24 02:57:45,519 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 45.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-24 02:57:45,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.27ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 45.3MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-24 02:57:45,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 83.9MB. Free memory was 45.3MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-24 02:57:45,520 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 42.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-24 02:57:45,520 INFO L158 Benchmark]: RCFGBuilder took 502.74ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 32.4MB in the end (delta: 10.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-01-24 02:57:45,521 INFO L158 Benchmark]: TraceAbstraction took 460182.88ms. Allocated memory was 83.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 31.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 973.4MB. Max. memory is 16.1GB. [2025-01-24 02:57:45,522 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 45.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.27ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 45.3MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 83.9MB. Free memory was 45.3MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 42.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 502.74ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 32.4MB in the end (delta: 10.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 460182.88ms. Allocated memory was 83.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 31.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 973.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 02:57:47,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 02:57:47,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-01-24 02:57:47,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 02:57:47,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 02:57:47,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 02:57:47,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 02:57:47,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 02:57:47,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 02:57:47,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 02:57:47,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 02:57:47,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 02:57:47,596 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 02:57:47,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 02:57:47,597 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 02:57:47,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 02:57:47,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:57:47,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 02:57:47,599 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 02:57:47,600 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 02:57:47,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 02:57:47,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 02:57:47,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 02:57:47,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 02:57:47,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 02:57:47,898 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 02:57:47,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-01-24 02:57:49,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8449bc254/79f0ceab90d242fea322c7543921a046/FLAG894a4f1da [2025-01-24 02:57:49,348 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 02:57:49,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2025-01-24 02:57:49,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8449bc254/79f0ceab90d242fea322c7543921a046/FLAG894a4f1da [2025-01-24 02:57:49,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8449bc254/79f0ceab90d242fea322c7543921a046 [2025-01-24 02:57:49,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 02:57:49,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 02:57:49,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 02:57:49,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 02:57:49,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 02:57:49,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffa0cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49, skipping insertion in model container [2025-01-24 02:57:49,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 02:57:49,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-01-24 02:57:49,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:57:49,579 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 02:57:49,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2423,2436] [2025-01-24 02:57:49,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:57:49,655 INFO L204 MainTranslator]: Completed translation [2025-01-24 02:57:49,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49 WrapperNode [2025-01-24 02:57:49,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 02:57:49,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 02:57:49,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 02:57:49,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 02:57:49,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,687 INFO L138 Inliner]: procedures = 23, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 125 [2025-01-24 02:57:49,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 02:57:49,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 02:57:49,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 02:57:49,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 02:57:49,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 02:57:49,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 02:57:49,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 02:57:49,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 02:57:49,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (1/1) ... [2025-01-24 02:57:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:57:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:49,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-24 02:57:49,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-24 02:57:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 02:57:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-24 02:57:49,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-24 02:57:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-24 02:57:49,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-24 02:57:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-01-24 02:57:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-24 02:57:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-01-24 02:57:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 02:57:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 02:57:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-01-24 02:57:49,772 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 02:57:49,856 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 02:57:49,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 02:57:50,109 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 02:57:50,109 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 02:57:50,306 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 02:57:50,306 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-24 02:57:50,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:57:50 BoogieIcfgContainer [2025-01-24 02:57:50,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 02:57:50,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 02:57:50,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 02:57:50,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 02:57:50,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 02:57:49" (1/3) ... [2025-01-24 02:57:50,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d588675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:57:50, skipping insertion in model container [2025-01-24 02:57:50,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:57:49" (2/3) ... [2025-01-24 02:57:50,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d588675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:57:50, skipping insertion in model container [2025-01-24 02:57:50,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:57:50" (3/3) ... [2025-01-24 02:57:50,317 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-01-24 02:57:50,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 02:57:50,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-24 02:57:50,329 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 02:57:50,380 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-24 02:57:50,418 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:57:50,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 02:57:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:50,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-24 02:57:50,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-24 02:57:50,489 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 02:57:50,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 02:57:50,505 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@454d6688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:57:50,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-24 02:57:50,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:50,720 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:50,721 INFO L139 ounterexampleChecker]: Examining path program with hash -931133173, occurence #1 [2025-01-24 02:57:50,722 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:57:50,722 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:50,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1047185339, now seen corresponding path program 1 times [2025-01-24 02:57:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201818141] [2025-01-24 02:57:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:57:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:50,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:50,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-24 02:57:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 02:57:50,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 02:57:50,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:57:50,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:50,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-24 02:57:50,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:50,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 02:57:50,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:50,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201818141] [2025-01-24 02:57:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201818141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:57:50,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:57:50,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 02:57:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688190268] [2025-01-24 02:57:50,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:57:50,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 02:57:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:50,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 02:57:50,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 02:57:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:50,871 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:50,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:50,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-24 02:57:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:51,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:51,114 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:51,115 INFO L139 ounterexampleChecker]: Examining path program with hash 509465625, occurence #1 [2025-01-24 02:57:51,115 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:57:51,115 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:51,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1867833591, now seen corresponding path program 1 times [2025-01-24 02:57:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857211905] [2025-01-24 02:57:51,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:57:51,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:51,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:51,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:51,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-24 02:57:51,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-24 02:57:51,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 02:57:51,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:57:51,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:51,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-24 02:57:51,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:51,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 02:57:51,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857211905] [2025-01-24 02:57:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857211905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:57:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:57:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 02:57:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149348184] [2025-01-24 02:57:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:57:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 02:57:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:51,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 02:57:51,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 02:57:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,244 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:51,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:51,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-24 02:57:51,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:51,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:51,521 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:51,521 INFO L139 ounterexampleChecker]: Examining path program with hash 1666031367, occurence #1 [2025-01-24 02:57:51,521 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:57:51,521 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1035164090, now seen corresponding path program 1 times [2025-01-24 02:57:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968116146] [2025-01-24 02:57:51,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:57:51,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:51,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:51,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:51,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-24 02:57:51,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-24 02:57:51,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-24 02:57:51,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:57:51,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:51,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-24 02:57:51,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:51,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 02:57:51,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:51,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968116146] [2025-01-24 02:57:51,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968116146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:57:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:57:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:57:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290141605] [2025-01-24 02:57:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:57:51,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:57:51,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:51,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:57:51,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:57:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,694 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:51,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:51,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:51,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:51,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-24 02:57:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:51,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:51,994 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:51,994 INFO L139 ounterexampleChecker]: Examining path program with hash 1666031367, occurence #2 [2025-01-24 02:57:51,995 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:57:51,995 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-24 02:57:51,995 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:57:51,995 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-24 02:57:51,995 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:57:51,995 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-01-24 02:57:52,010 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:57:52,010 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-01-24 02:57:52,010 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:57:52,010 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-01-24 02:57:52,010 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-24 02:57:52,010 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-01-24 02:57:52,010 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:57:52,011 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:57:52,011 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1138844130, now seen corresponding path program 1 times [2025-01-24 02:57:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572114763] [2025-01-24 02:57:52,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:57:52,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:52,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:52,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:52,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-24 02:57:52,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-24 02:57:52,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-24 02:57:52,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:57:52,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:52,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-24 02:57:52,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:52,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:57:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:52,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572114763] [2025-01-24 02:57:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572114763] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:57:52,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-24 02:57:52,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-24 02:57:52,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790942552] [2025-01-24 02:57:52,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-24 02:57:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-24 02:57:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:52,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-24 02:57:52,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-24 02:57:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:52,440 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:52,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:52,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:52,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:52,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:52,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:57:52,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-24 02:57:53,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:53,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:53,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:53,041 INFO L139 ounterexampleChecker]: Examining path program with hash 1897210964, occurence #1 [2025-01-24 02:57:53,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:57:53,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1204811329, now seen corresponding path program 1 times [2025-01-24 02:57:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131869332] [2025-01-24 02:57:53,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:57:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:53,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:53,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-24 02:57:53,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-24 02:57:53,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-24 02:57:53,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:57:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:53,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-24 02:57:53,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:53,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-24 02:57:53,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-24 02:57:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:53,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:57:54,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2025-01-24 02:57:54,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:57:54,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 98 [2025-01-24 02:57:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:56,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131869332] [2025-01-24 02:57:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131869332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:57:56,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-24 02:57:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-01-24 02:57:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884310275] [2025-01-24 02:57:56,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-24 02:57:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-24 02:57:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:56,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-24 02:57:56,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-01-24 02:57:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:56,278 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:56,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:56,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:56,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:56,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:56,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:57:56,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:57:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:57:57,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-24 02:57:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:57,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:57,730 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:57,730 INFO L139 ounterexampleChecker]: Examining path program with hash -1241190590, occurence #1 [2025-01-24 02:57:57,730 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:57:57,730 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -135566178, now seen corresponding path program 2 times [2025-01-24 02:57:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334717720] [2025-01-24 02:57:57,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:57:57,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:57,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:57,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-24 02:57:57,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-24 02:57:57,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-24 02:57:57,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:57:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:57,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-24 02:57:57,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:58,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:57:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:57:58,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334717720] [2025-01-24 02:57:58,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334717720] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:57:58,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-24 02:57:58,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-01-24 02:57:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292843688] [2025-01-24 02:57:58,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-24 02:57:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-24 02:57:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:58,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-24 02:57:58,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2025-01-24 02:57:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:58,634 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:58,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:58,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:58,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:58,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:57:58,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:57:58,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:57:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-24 02:57:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-24 02:57:59,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-24 02:57:59,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:59,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:57:59,866 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:57:59,866 INFO L139 ounterexampleChecker]: Examining path program with hash -1620116710, occurence #1 [2025-01-24 02:57:59,866 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:57:59,866 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:57:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:57:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1339433944, now seen corresponding path program 3 times [2025-01-24 02:57:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:57:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376508298] [2025-01-24 02:57:59,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:57:59,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:57:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:57:59,869 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:57:59,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-24 02:57:59,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-01-24 02:57:59,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 39 statements. [2025-01-24 02:57:59,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-24 02:57:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:57:59,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-24 02:57:59,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:57:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-24 02:57:59,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 02:57:59,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:57:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376508298] [2025-01-24 02:57:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376508298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:57:59,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:57:59,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:57:59,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702712563] [2025-01-24 02:57:59,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:57:59,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:57:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:57:59,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:57:59,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:57:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:59,962 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:57:59,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:57:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:57:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:57:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:57:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:57:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-01-24 02:57:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-01-24 02:57:59,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:58:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:58:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-24 02:58:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-24 02:58:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:00,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-24 02:58:00,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:58:00,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:58:00,440 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:58:00,441 INFO L139 ounterexampleChecker]: Examining path program with hash 228040809, occurence #1 [2025-01-24 02:58:00,441 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:58:00,441 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:58:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:58:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1264492249, now seen corresponding path program 1 times [2025-01-24 02:58:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:58:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [355009662] [2025-01-24 02:58:00,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:58:00,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:58:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:58:00,443 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:58:00,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-24 02:58:00,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-24 02:58:00,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-24 02:58:00,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:58:00,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:58:00,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-24 02:58:00,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:58:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:58:00,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:58:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-24 02:58:01,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:58:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355009662] [2025-01-24 02:58:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355009662] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-24 02:58:01,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-24 02:58:01,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2025-01-24 02:58:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510731381] [2025-01-24 02:58:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:58:01,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-24 02:58:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:58:01,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-24 02:58:01,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-01-24 02:58:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:01,124 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:58:01,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:01,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:58:01,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-24 02:58:01,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:58:01,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:58:01,640 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:58:01,640 INFO L139 ounterexampleChecker]: Examining path program with hash -1409775603, occurence #1 [2025-01-24 02:58:01,640 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:58:01,640 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:58:01,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:58:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash -326813176, now seen corresponding path program 2 times [2025-01-24 02:58:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-24 02:58:01,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330569645] [2025-01-24 02:58:01,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:58:01,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:58:01,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:58:01,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:58:01,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-24 02:58:01,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-24 02:58:01,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-24 02:58:01,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:58:01,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:58:01,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-24 02:58:01,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:58:01,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-24 02:58:02,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-24 02:58:02,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 9 [2025-01-24 02:58:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:58:02,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:58:33,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 107 [2025-01-24 02:58:33,193 INFO L349 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2025-01-24 02:58:33,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 242 [2025-01-24 02:58:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:58:35,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-24 02:58:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330569645] [2025-01-24 02:58:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330569645] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:58:35,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-24 02:58:35,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2025-01-24 02:58:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274444175] [2025-01-24 02:58:35,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-24 02:58:35,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-24 02:58:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-24 02:58:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-24 02:58:35,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1168, Unknown=9, NotChecked=0, Total=1560 [2025-01-24 02:58:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:35,578 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:58:35,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:58:35,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:35,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 02:58:35,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:35,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:58:35,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-01-24 02:58:35,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-01-24 02:58:35,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:58:35,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-24 02:58:35,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:58:37,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:58:39,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:58:41,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:58:43,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:59:20,331 WARN L286 SmtUtils]: Spent 30.34s on a formula simplification. DAG size of input: 81 DAG size of output: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:59:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:59:24,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:59:32,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:59:34,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 02:59:37,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:00:29,669 WARN L286 SmtUtils]: Spent 48.45s on a formula simplification. DAG size of input: 99 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 03:01:24,012 WARN L286 SmtUtils]: Spent 49.90s on a formula simplification. DAG size of input: 108 DAG size of output: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 03:01:26,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:28,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:29,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:37,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:39,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:41,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:43,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:45,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:47,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:49,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:51,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:53,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:55,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:57,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:01:59,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:01,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:03,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:05,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:07,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:09,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:11,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:02:45,819 WARN L286 SmtUtils]: Spent 26.19s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 03:02:47,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:20,112 WARN L286 SmtUtils]: Spent 26.18s on a formula simplification. DAG size of input: 68 DAG size of output: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 03:03:22,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:24,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:26,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:28,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:30,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:32,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:34,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:36,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:38,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:40,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:42,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:44,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:46,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:48,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:50,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:52,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:54,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:56,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:03:58,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-24 03:04:00,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15