./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis 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/parallel-misc-2.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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 18:56:29,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 18:56:29,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 18:56:29,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 18:56:29,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 18:56:29,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 18:56:29,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 18:56:29,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 18:56:29,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 18:56:29,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 18:56:29,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 18:56:29,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 18:56:29,212 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 18:56:29,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 18:56:29,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 18:56:29,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 18:56:29,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 18:56:29,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 18:56:29,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 18:56:29,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 18:56:29,215 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 18:56:29,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 18:56:29,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 18:56:29,216 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 18:56:29,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 18:56:29,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 18:56:29,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 18:56:29,216 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 18:56:29,216 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 18:56:29,216 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf 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 -> SUFFICIENT [2025-01-23 18:56:29,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 18:56:29,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 18:56:29,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 18:56:29,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 18:56:29,549 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 18:56:29,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-01-23 18:56:30,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/6ee9fe2a3/c63c19ea428c4c62b600b990e58daf4c/FLAGd6d1c12dc [2025-01-23 18:56:31,128 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 18:56:31,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-01-23 18:56:31,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/6ee9fe2a3/c63c19ea428c4c62b600b990e58daf4c/FLAGd6d1c12dc [2025-01-23 18:56:31,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/6ee9fe2a3/c63c19ea428c4c62b600b990e58daf4c [2025-01-23 18:56:31,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 18:56:31,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 18:56:31,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 18:56:31,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 18:56:31,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 18:56:31,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b02076a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31, skipping insertion in model container [2025-01-23 18:56:31,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 18:56:31,335 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/parallel-misc-2.wvr.c[2249,2262] [2025-01-23 18:56:31,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 18:56:31,346 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 18:56:31,406 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/parallel-misc-2.wvr.c[2249,2262] [2025-01-23 18:56:31,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 18:56:31,424 INFO L204 MainTranslator]: Completed translation [2025-01-23 18:56:31,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31 WrapperNode [2025-01-23 18:56:31,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 18:56:31,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 18:56:31,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 18:56:31,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 18:56:31,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,455 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-01-23 18:56:31,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 18:56:31,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 18:56:31,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 18:56:31,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 18:56:31,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,467 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 18:56:31,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 18:56:31,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 18:56:31,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 18:56:31,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (1/1) ... [2025-01-23 18:56:31,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 18:56:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 18:56:31,514 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-23 18:56:31,521 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-23 18:56:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 18:56:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 18:56:31,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 18:56:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 18:56:31,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 18:56:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 18:56:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 18:56:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 18:56:31,544 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 18:56:31,617 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 18:56:31,619 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 18:56:31,766 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 18:56:31,766 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 18:56:31,917 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 18:56:31,918 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 18:56:31,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 06:56:31 BoogieIcfgContainer [2025-01-23 18:56:31,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 18:56:31,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 18:56:31,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 18:56:31,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 18:56:31,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 06:56:31" (1/3) ... [2025-01-23 18:56:31,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfa0e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 06:56:31, skipping insertion in model container [2025-01-23 18:56:31,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 06:56:31" (2/3) ... [2025-01-23 18:56:31,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfa0e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 06:56:31, skipping insertion in model container [2025-01-23 18:56:31,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 06:56:31" (3/3) ... [2025-01-23 18:56:31,928 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-01-23 18:56:31,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 18:56:31,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-23 18:56:31,943 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 18:56:31,996 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-23 18:56:32,029 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 18:56:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 18:56:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 18:56:32,033 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-23 18:56:32,034 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-23 18:56:32,090 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 18:56:32,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 18:56:32,110 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;@6ef3e7a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 18:56:32,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-23 18:56:32,407 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-23 18:56:32,408 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 18:56:32,408 INFO L139 ounterexampleChecker]: Examining path program with hash -1112909302, occurence #1 [2025-01-23 18:56:32,408 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 18:56:32,408 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 18:56:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 18:56:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1464225346, now seen corresponding path program 1 times [2025-01-23 18:56:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 18:56:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580146997] [2025-01-23 18:56:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 18:56:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 18:56:32,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-23 18:56:32,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-23 18:56:32,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 18:56:32,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:32,813 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-23 18:56:32,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 18:56:32,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580146997] [2025-01-23 18:56:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580146997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 18:56:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 18:56:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 18:56:32,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582766095] [2025-01-23 18:56:32,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 18:56:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 18:56:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 18:56:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 18:56:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 18:56:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:32,839 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 18:56:32,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-23 18:56:32,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 18:56:32,952 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-23 18:56:32,953 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 18:56:32,954 INFO L139 ounterexampleChecker]: Examining path program with hash -687417324, occurence #1 [2025-01-23 18:56:32,954 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 18:56:32,954 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 18:56:32,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 18:56:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -910422195, now seen corresponding path program 1 times [2025-01-23 18:56:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 18:56:32,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574045254] [2025-01-23 18:56:32,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 18:56:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 18:56:32,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-23 18:56:33,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 18:56:33,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 18:56:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 18:56:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 18:56:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574045254] [2025-01-23 18:56:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574045254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 18:56:33,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 18:56:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 18:56:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891109001] [2025-01-23 18:56:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 18:56:33,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 18:56:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 18:56:33,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 18:56:33,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 18:56:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:33,267 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 18:56:33,268 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-23 18:56:33,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:33,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:33,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 18:56:33,363 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-23 18:56:33,363 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 18:56:33,363 INFO L139 ounterexampleChecker]: Examining path program with hash -1719521395, occurence #1 [2025-01-23 18:56:33,363 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 18:56:33,364 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 18:56:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 18:56:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 817022079, now seen corresponding path program 1 times [2025-01-23 18:56:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 18:56:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266236066] [2025-01-23 18:56:33,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 18:56:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 18:56:33,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 18:56:33,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 18:56:33,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 18:56:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-23 18:56:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 18:56:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266236066] [2025-01-23 18:56:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266236066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 18:56:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352355069] [2025-01-23 18:56:33,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 18:56:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:56:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 18:56:33,986 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-23 18:56:33,988 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-23 18:56:34,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 18:56:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 18:56:34,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 18:56:34,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:34,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-23 18:56:34,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 18:56:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-23 18:56:34,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 18:56:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352355069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 18:56:34,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-23 18:56:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-23 18:56:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515606412] [2025-01-23 18:56:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 18:56:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 18:56:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 18:56:34,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 18:56:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-23 18:56:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:34,155 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 18:56:34,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-23 18:56:34,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:34,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:34,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:34,254 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-23 18:56:34,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:56:34,447 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-23 18:56:34,447 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 18:56:34,447 INFO L139 ounterexampleChecker]: Examining path program with hash 1282604392, occurence #1 [2025-01-23 18:56:34,447 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 18:56:34,447 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 18:56:34,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 18:56:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1024522145, now seen corresponding path program 1 times [2025-01-23 18:56:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 18:56:34,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901824214] [2025-01-23 18:56:34,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 18:56:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 18:56:34,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 18:56:34,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 18:56:34,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 18:56:34,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-23 18:56:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 18:56:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901824214] [2025-01-23 18:56:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901824214] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 18:56:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249943728] [2025-01-23 18:56:34,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 18:56:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:56:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 18:56:34,941 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-23 18:56:34,943 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-23 18:56:34,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 18:56:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 18:56:35,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 18:56:35,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:35,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-23 18:56:35,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 18:56:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 18:56:35,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 18:56:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 18:56:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249943728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 18:56:35,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 18:56:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-01-23 18:56:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420665277] [2025-01-23 18:56:35,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 18:56:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 18:56:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 18:56:35,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 18:56:35,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-23 18:56:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:35,308 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 18:56:35,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 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-23 18:56:35,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:35,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:35,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:35,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-23 18:56:36,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-23 18:56:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:56:36,625 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-23 18:56:36,625 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 18:56:36,625 INFO L139 ounterexampleChecker]: Examining path program with hash 327941973, occurence #1 [2025-01-23 18:56:36,625 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 18:56:36,625 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 18:56:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 18:56:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2126736295, now seen corresponding path program 2 times [2025-01-23 18:56:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 18:56:36,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110162357] [2025-01-23 18:56:36,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 18:56:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 18:56:36,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-23 18:56:36,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-23 18:56:36,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 18:56:36,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-23 18:56:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 18:56:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110162357] [2025-01-23 18:56:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110162357] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 18:56:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68197110] [2025-01-23 18:56:37,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 18:56:37,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:56:37,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 18:56:37,301 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-23 18:56:37,303 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-23 18:56:37,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-23 18:56:37,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-23 18:56:37,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 18:56:37,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:56:37,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-23 18:56:37,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 18:56:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-23 18:56:38,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 18:56:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-23 18:56:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68197110] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 18:56:39,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 18:56:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2025-01-23 18:56:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762176345] [2025-01-23 18:56:39,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 18:56:39,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-23 18:56:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 18:56:39,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-23 18:56:39,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-01-23 18:56:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:39,283 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 18:56:39,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 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-23 18:56:39,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:56:39,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:39,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:56:39,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-01-23 18:56:39,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:56:49,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:57:24,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:57:27,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:57:28,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:57:31,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:58:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:58:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:58:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:58:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-23 18:58:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-23 18:58:08,561 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-23 18:58:08,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:58:08,755 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-23 18:58:08,755 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 18:58:08,755 INFO L139 ounterexampleChecker]: Examining path program with hash 2123748053, occurence #1 [2025-01-23 18:58:08,755 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 18:58:08,755 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 18:58:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 18:58:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 270988792, now seen corresponding path program 3 times [2025-01-23 18:58:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 18:58:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805367251] [2025-01-23 18:58:08,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 18:58:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 18:58:08,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-01-23 18:58:09,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-01-23 18:58:09,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-23 18:58:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:58:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 27 proven. 1087 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 18:58:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 18:58:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805367251] [2025-01-23 18:58:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805367251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 18:58:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397126746] [2025-01-23 18:58:30,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 18:58:30,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 18:58:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 18:58:30,221 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-23 18:58:30,222 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-23 18:58:30,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-01-23 18:58:32,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-01-23 18:58:32,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-23 18:58:32,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 18:58:32,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-23 18:58:32,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 18:58:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 18:58:40,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 18:59:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 18:59:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397126746] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 18:59:09,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 18:59:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49, 48] total 143 [2025-01-23 18:59:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544511337] [2025-01-23 18:59:09,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 18:59:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-01-23 18:59:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 18:59:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-01-23 18:59:09,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2391, Invalid=17913, Unknown=2, NotChecked=0, Total=20306 [2025-01-23 18:59:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:59:09,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 18:59:09,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 4.335664335664336) internal successors, (620), 143 states have internal predecessors, (620), 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-23 18:59:09,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 18:59:09,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:59:09,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 18:59:09,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-23 18:59:09,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2025-01-23 18:59:09,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 18:59:31,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:59:39,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:59:46,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:59:48,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:59:50,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:59:52,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 18:59:54,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:00:04,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:00:10,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:00:23,208 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 57 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:00:32,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:00:41,285 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 70 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:00:49,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:00:51,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:01:08,369 WARN L286 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 80 DAG size of output: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:01:30,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:01:55,487 WARN L286 SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 87 DAG size of output: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:02:06,618 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 83 DAG size of output: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:02:08,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:27,322 WARN L286 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 80 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:02:30,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:32,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:34,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:37,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:43,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:44,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:46,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:48,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:02:59,573 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 79 DAG size of output: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:03:15,507 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 96 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:03:17,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:03:37,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:03:39,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:03:41,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:03:43,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:03:45,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:04:01,888 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 59 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:04:03,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:04:19,467 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 64 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:04:21,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 19:04:50,375 WARN L286 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 72 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:05:02,403 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 69 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 19:05:09,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse53 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse53 2)) (.cse49 (mod (+ c_~i2~0 12) 4294967296)) (.cse50 (mod (+ 5 c_~i2~0) 4294967296)) (.cse5 (mod c_~i1~0 2)) (.cse9 (* c_~N~0 2)) (.cse10 (* 4294967295 c_~i2~0))) (let ((.cse15 (mod (+ c_~i1~0 20) 4294967296)) (.cse21 (mod (+ 23 c_~i2~0) 4294967296)) (.cse31 (mod (+ c_~i2~0 17) 4294967296)) (.cse14 (mod (+ c_~i2~0 11) 4294967296)) (.cse38 (mod (+ .cse9 3 .cse10) 4294967296)) (.cse2 (+ .cse9 .cse5)) (.cse23 (mod (+ c_~i1~0 18) 4294967296)) (.cse8 (mod (+ c_~i2~0 20) 4294967296)) (.cse19 (mod c_~i1~0 4294967296)) (.cse24 (mod (+ 21 c_~i2~0) 4294967296)) (.cse36 (mod (+ c_~i1~0 14) 4294967296)) (.cse34 (mod (+ c_~i1~0 4) 4294967296)) (.cse18 (+ .cse50 .cse5 1)) (.cse30 (mod (+ c_~i1~0 15) 4294967296)) (.cse41 (mod (+ 7 c_~i2~0) 4294967296)) (.cse37 (mod (+ c_~i1~0 4294967288) 4294967296)) (.cse32 (mod (+ c_~i1~0 12) 4294967296)) (.cse27 (mod (+ 14 c_~i2~0) 4294967296)) (.cse44 (mod (+ c_~i2~0 18) 4294967296)) (.cse45 (mod (+ c_~i1~0 16) 4294967296)) (.cse17 (mod (+ c_~i1~0 2) 4294967296)) (.cse13 (mod (+ c_~i1~0 7) 4294967296)) (.cse4 (mod (+ c_~i2~0 10) 4294967296)) (.cse28 (mod (+ c_~i1~0 10) 4294967296)) (.cse0 (mod (+ .cse9 .cse10 1) 4294967296)) (.cse25 (mod (+ c_~i1~0 4294967290) 4294967296)) (.cse26 (mod (+ c_~i1~0 11) 4294967296)) (.cse48 (mod (+ c_~i2~0 13) 4294967296)) (.cse6 (mod (+ c_~i1~0 17) 4294967296)) (.cse46 (mod (+ 19 c_~i2~0) 4294967296)) (.cse42 (mod (+ c_~i1~0 19) 4294967296)) (.cse16 (mod (+ 22 c_~i2~0) 4294967296)) (.cse20 (mod (+ 3 c_~i2~0) 4294967296)) (.cse39 (mod (+ c_~i1~0 8) 4294967296)) (.cse29 (+ .cse49 .cse5 1)) (.cse1 (* (div c_~N~0 2147483648) 4294967296)) (.cse22 (mod (+ .cse9 5 .cse10) 4294967296)) (.cse11 (mod (+ c_~i1~0 4294967286) 4294967296)) (.cse12 (+ .cse7 .cse9)) (.cse40 (mod (+ c_~i1~0 5) 4294967296)) (.cse35 (mod (+ 6 c_~i2~0) 4294967296)) (.cse51 (mod .cse53 4294967296)) (.cse47 (mod (+ c_~i2~0 4) 4294967296)) (.cse3 (mod (+ c_~i1~0 6) 4294967296)) (.cse33 (mod (+ 15 c_~i2~0) 4294967296)) (.cse52 (mod (+ c_~i1~0 13) 4294967296)) (.cse43 (mod (+ 16 c_~i2~0) 4294967296))) (and (<= (+ .cse0 .cse1 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse2) (< .cse3 (+ .cse4 .cse5 1)) (< .cse6 (+ .cse7 .cse8 1)) (<= (+ (mod (+ .cse9 4 .cse10) 4294967296) .cse1 6 .cse11) .cse12) (< .cse13 (+ .cse7 .cse14 1)) (< .cse15 (+ .cse16 .cse5 1)) (< .cse17 .cse18) (< .cse19 (+ .cse20 .cse5 1)) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse7 .cse21 1)) (<= (+ .cse1 .cse22 (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse2) (< .cse23 (+ .cse24 .cse5 1)) (<= (+ .cse1 (mod (+ .cse9 .cse10) 4294967296) 6 .cse25) .cse12) (< .cse26 (+ .cse7 .cse27 1)) (< .cse15 (+ .cse5 .cse21 1)) (< .cse28 .cse29) (< .cse30 (+ .cse7 .cse31 1)) (< .cse3 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse5 1)) (< .cse32 (+ .cse33 .cse5 1)) (< .cse34 (+ .cse35 .cse5 1)) (< .cse36 (+ .cse31 .cse5 1)) (<= (+ .cse1 .cse37 6 .cse38) .cse12) (< .cse39 (+ .cse14 .cse5 1)) (< .cse40 (+ .cse7 .cse41 1)) (<= (+ .cse1 (mod (+ c_~i1~0 4294967287) 4294967296) 6 .cse38) .cse2) (< .cse23 (+ .cse8 .cse5 1)) (< .cse19 (+ .cse5 (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse42 (+ .cse7 .cse24 1)) (< .cse36 (+ .cse43 .cse5 1)) (< .cse34 .cse18) (< .cse30 (+ .cse44 .cse7 1)) (< .cse3 (+ .cse5 .cse41 1)) (<= (+ (mod (+ .cse9 2 .cse10) 4294967296) .cse1 .cse37 6) .cse12) (< .cse32 (+ .cse27 .cse5 1)) (<= (+ .cse1 (mod (+ .cse9 6 .cse10) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse12) (< .cse45 (+ .cse44 .cse5 1)) (< .cse45 (+ .cse46 .cse5 1)) (< .cse17 (+ .cse5 .cse47 1)) (< .cse13 (+ .cse7 .cse4 1)) (< .cse28 (+ .cse48 .cse5 1)) (<= (+ .cse0 .cse1 6 .cse25) .cse12) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 .cse49 1)) (< .cse26 (+ .cse7 .cse48 1)) (< .cse6 (+ .cse7 .cse46 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 .cse50 1)) (< .cse42 (+ .cse7 .cse16 1)) (< .cse51 (+ .cse7 .cse20 1)) (< .cse39 .cse29) (<= (+ .cse1 .cse22 6 .cse11) .cse12) (< .cse40 (+ .cse7 .cse35 1)) (< .cse51 (+ .cse7 .cse47 1)) (< .cse3 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse5 1)) (< .cse52 (+ .cse7 .cse33 1)) (< .cse52 (+ .cse7 .cse43 1)))))) is different from false [2025-01-23 19:05:11,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse9 2)) (.cse0 (* c_~N~0 2)) (.cse6 (mod c_~i1~0 2))) (let ((.cse4 (mod c_~i2~0 4294967296)) (.cse3 (+ .cse0 .cse6)) (.cse1 (* 4294967295 c_~i2~0)) (.cse2 (* (div c_~N~0 2147483648) 4294967296)) (.cse8 (+ .cse7 .cse0)) (.cse5 (mod (+ c_~i1~0 6) 4294967296))) (and (<= (+ (mod (+ .cse0 .cse1 1) 4294967296) .cse2 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse3) (<= (+ .cse2 .cse4 1) .cse0) (< .cse5 (+ (mod (+ c_~i2~0 10) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse7 (mod (+ c_~i2~0 20) 4294967296) 1)) (<= (+ (mod (+ .cse0 4 .cse1) 4294967296) .cse2 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse8) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse7 (mod (+ c_~i2~0 11) 4294967296) 1)) (< (mod c_~i1~0 4294967296) (+ (mod (+ 3 c_~i2~0) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ .cse0 5 .cse1) 4294967296) (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse3) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ 21 c_~i2~0) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ .cse0 .cse1) 4294967296) 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse8) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse7 (mod (+ 14 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 20) 4294967296) (+ .cse6 (mod (+ 23 c_~i2~0) 4294967296) 1)) (<= (+ 5 (mod (+ c_~i1~0 4294967291) 4294967296)) (+ .cse4 .cse6)) (< .cse5 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 15 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 4) 4294967296) (+ (mod (+ 6 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ c_~i2~0 17) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ c_~i1~0 4294967287) 4294967296) 6 (mod (+ .cse0 3 .cse1) 4294967296)) .cse3) (< (mod (+ c_~i1~0 15) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse7 1)) (< .cse5 (+ .cse6 (mod (+ 7 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse0 2 .cse1) 4294967296) .cse2 (mod (+ c_~i1~0 4294967288) 4294967296) 6) .cse8) (<= (+ .cse2 (mod (+ .cse0 6 .cse1) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse8) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ 19 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 10) 4294967296) (+ (mod (+ c_~i2~0 13) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 (mod (+ c_~i2~0 12) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 (mod (+ 5 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse0 4294967295 .cse1) 4294967296) .cse2 5 (mod (+ c_~i1~0 4294967292) 4294967296)) .cse8) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse7 (mod (+ 22 c_~i2~0) 4294967296) 1)) (< (mod .cse9 4294967296) (+ .cse7 (mod (+ c_~i2~0 4) 4294967296) 1)) (< .cse5 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse7 (mod (+ 16 c_~i2~0) 4294967296) 1)))))) is different from false [2025-01-23 19:05:13,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~i1~0 1))) (let ((.cse2 (mod .cse10 2)) (.cse5 (* c_~N~0 2)) (.cse8 (mod (+ c_~i2~0 12) 4294967296)) (.cse9 (mod (+ 5 c_~i2~0) 4294967296)) (.cse0 (mod c_~i1~0 2))) (let ((.cse1 (+ .cse9 .cse0 1)) (.cse3 (+ .cse8 .cse0 1)) (.cse4 (* (div c_~N~0 2147483648) 4294967296)) (.cse6 (* 4294967295 c_~i2~0)) (.cse7 (+ .cse2 .cse5))) (and (< (mod (+ c_~i1~0 20) 4294967296) (+ (mod (+ 22 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 2) 4294967296) .cse1) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse2 (mod (+ 23 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 10) 4294967296) .cse3) (< (mod (+ c_~i1~0 15) 4294967296) (+ .cse2 (mod (+ c_~i2~0 17) 4294967296) 1)) (<= (+ .cse4 (mod (+ c_~i1~0 4294967288) 4294967296) 6 (mod (+ .cse5 3 .cse6) 4294967296)) .cse7) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ c_~i2~0 20) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse2 (mod (+ 21 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ 16 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 4) 4294967296) .cse1) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 14 c_~i2~0) 4294967296) .cse0 1)) (<= (+ .cse4 (mod (+ .cse5 6 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse7) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse2 (mod (+ c_~i2~0 10) 4294967296) 1)) (<= (+ (mod (+ .cse5 .cse6 1) 4294967296) .cse4 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse7) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse2 .cse8 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse2 (mod (+ c_~i2~0 13) 4294967296) 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse2 (mod (+ 19 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse2 .cse9 1)) (< (mod .cse10 4294967296) (+ .cse2 (mod (+ 3 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 8) 4294967296) .cse3) (<= (+ .cse4 (mod (+ .cse5 5 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse7) (< (mod (+ c_~i1~0 5) 4294967296) (+ .cse2 (mod (+ 6 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 6) 4294967296) (+ (mod (+ 9 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse2 (mod (+ 15 c_~i2~0) 4294967296) 1)))))) is different from false [2025-01-23 19:09:16,249 WARN L286 SmtUtils]: Spent 49.82s on a formula simplification. DAG size of input: 123 DAG size of output: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15