./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --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-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 12:05:11,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 12:05:12,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 12:05:12,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 12:05:12,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 12:05:12,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 12:05:12,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 12:05:12,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 12:05:12,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 12:05:12,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 12:05:12,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 12:05:12,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 12:05:12,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 12:05:12,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 12:05:12,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 12:05:12,042 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 12:05:12,042 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 12:05:12,042 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 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 -> NONE [2025-01-23 12:05:12,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 12:05:12,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 12:05:12,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 12:05:12,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 12:05:12,302 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 12:05:12,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-23 12:05:13,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/657a5b43f/2f90a3bbc8494d909f649e8625f95e3a/FLAG9f3f198f8 [2025-01-23 12:05:13,579 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 12:05:13,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-23 12:05:13,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/657a5b43f/2f90a3bbc8494d909f649e8625f95e3a/FLAG9f3f198f8 [2025-01-23 12:05:13,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/657a5b43f/2f90a3bbc8494d909f649e8625f95e3a [2025-01-23 12:05:13,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 12:05:13,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 12:05:13,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 12:05:13,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 12:05:13,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 12:05:13,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:05:13" (1/1) ... [2025-01-23 12:05:13,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b459c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:13, skipping insertion in model container [2025-01-23 12:05:13,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:05:13" (1/1) ... [2025-01-23 12:05:13,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 12:05:14,083 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-01-23 12:05:14,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 12:05:14,100 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 12:05:14,138 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-01-23 12:05:14,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 12:05:14,150 INFO L204 MainTranslator]: Completed translation [2025-01-23 12:05:14,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14 WrapperNode [2025-01-23 12:05:14,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 12:05:14,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 12:05:14,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 12:05:14,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 12:05:14,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,175 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-01-23 12:05:14,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 12:05:14,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 12:05:14,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 12:05:14,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 12:05:14,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 12:05:14,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 12:05:14,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 12:05:14,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 12:05:14,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (1/1) ... [2025-01-23 12:05:14,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 12:05:14,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:14,227 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 12:05:14,229 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 12:05:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 12:05:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 12:05:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 12:05:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 12:05:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 12:05:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-23 12:05:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-23 12:05:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 12:05:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-23 12:05:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-23 12:05:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 12:05:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 12:05:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 12:05:14,251 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 12:05:14,337 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 12:05:14,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 12:05:14,711 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 12:05:14,711 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 12:05:14,961 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 12:05:14,962 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 12:05:14,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:05:14 BoogieIcfgContainer [2025-01-23 12:05:14,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 12:05:14,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 12:05:14,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 12:05:14,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 12:05:14,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 12:05:13" (1/3) ... [2025-01-23 12:05:14,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694dfc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:05:14, skipping insertion in model container [2025-01-23 12:05:14,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:05:14" (2/3) ... [2025-01-23 12:05:14,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694dfc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:05:14, skipping insertion in model container [2025-01-23 12:05:14,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:05:14" (3/3) ... [2025-01-23 12:05:14,970 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-01-23 12:05:14,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 12:05:14,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-23 12:05:14,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 12:05:15,022 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-23 12:05:15,052 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 12:05:15,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 12:05:15,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:15,055 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 12:05:15,056 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 12:05:15,121 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 12:05:15,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 12:05:15,136 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;@1d372989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 12:05:15,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-23 12:05:15,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -101807487, now seen corresponding path program 1 times [2025-01-23 12:05:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252406651] [2025-01-23 12:05:15,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:15,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 12:05:15,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 12:05:15,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:15,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:16,132 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 12:05:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252406651] [2025-01-23 12:05:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252406651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:05:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:05:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 12:05:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141712551] [2025-01-23 12:05:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:16,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 12:05:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:16,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 12:05:16,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 12:05:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:16,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:16,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 12:05:16,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:16,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 12:05:16,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:16,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1139583931, now seen corresponding path program 1 times [2025-01-23 12:05:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988647514] [2025-01-23 12:05:16,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:16,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-23 12:05:16,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-23 12:05:16,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:16,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:16,526 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-23 12:05:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988647514] [2025-01-23 12:05:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988647514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:05:16,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:05:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 12:05:16,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796571336] [2025-01-23 12:05:16,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:16,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 12:05:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:16,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 12:05:16,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 12:05:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:16,529 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:16,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 12:05:16,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:16,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 12:05:16,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -419710619, now seen corresponding path program 1 times [2025-01-23 12:05:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:16,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192002096] [2025-01-23 12:05:16,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 12:05:16,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 12:05:16,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:16,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192002096] [2025-01-23 12:05:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192002096] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229186091] [2025-01-23 12:05:16,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:16,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:16,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:16,787 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 12:05:16,789 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 12:05:16,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 12:05:16,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 12:05:16,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:16,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:16,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 12:05:16,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:16,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229186091] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:16,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:05:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-23 12:05:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365737507] [2025-01-23 12:05:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:16,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 12:05:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:16,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 12:05:16,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-23 12:05:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:16,981 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:16,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 12:05:16,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:16,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:16,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:17,370 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-23 12:05:17,568 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 12:05:17,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1978403039, now seen corresponding path program 1 times [2025-01-23 12:05:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:17,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256801024] [2025-01-23 12:05:17,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:17,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 12:05:17,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 12:05:17,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:17,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256801024] [2025-01-23 12:05:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256801024] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853375395] [2025-01-23 12:05:17,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:17,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:17,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:17,704 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 12:05:17,705 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 12:05:17,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 12:05:17,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 12:05:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:17,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 12:05:17,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:17,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853375395] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:05:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-23 12:05:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60053089] [2025-01-23 12:05:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:17,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 12:05:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:17,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 12:05:17,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-23 12:05:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:17,866 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:17,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 12:05:17,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:17,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:17,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:17,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:18,318 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 12:05:18,511 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 12:05:18,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1275471846, now seen corresponding path program 1 times [2025-01-23 12:05:18,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:18,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970096184] [2025-01-23 12:05:18,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:18,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-23 12:05:18,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-23 12:05:18,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:18,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970096184] [2025-01-23 12:05:18,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970096184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919910901] [2025-01-23 12:05:18,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:18,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:18,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:18,634 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 12:05:18,635 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 12:05:18,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-23 12:05:18,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-23 12:05:18,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:18,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 12:05:18,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:18,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919910901] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:18,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:05:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-23 12:05:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723228196] [2025-01-23 12:05:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:18,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 12:05:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:18,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 12:05:18,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-23 12:05:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:18,784 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:18,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 12:05:18,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:18,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:18,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:18,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:18,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:19,414 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 12:05:19,607 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 12:05:19,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -922807690, now seen corresponding path program 1 times [2025-01-23 12:05:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17892308] [2025-01-23 12:05:19,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 12:05:19,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 12:05:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:19,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:20,801 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-23 12:05:20,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17892308] [2025-01-23 12:05:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17892308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656897185] [2025-01-23 12:05:20,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:05:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:20,806 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 12:05:20,810 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 12:05:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 12:05:20,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 12:05:20,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:20,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:20,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-23 12:05:20,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:21,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 12:05:21,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2025-01-23 12:05:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:21,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:35,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 12:05:35,312 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 42 treesize of output 95 [2025-01-23 12:05:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656897185] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:05:35,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 12:05:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2025-01-23 12:05:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768201720] [2025-01-23 12:05:35,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 12:05:35,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-23 12:05:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:35,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-23 12:05:35,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=480, Unknown=6, NotChecked=0, Total=600 [2025-01-23 12:05:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:35,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 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 12:05:35,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:35,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:35,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:35,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:35,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:35,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:36,573 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-23 12:05:36,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:36,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1458381414, now seen corresponding path program 2 times [2025-01-23 12:05:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407695569] [2025-01-23 12:05:36,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 12:05:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:36,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:05:36,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:05:36,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 12:05:36,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:36,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407695569] [2025-01-23 12:05:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407695569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249333997] [2025-01-23 12:05:36,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 12:05:36,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:36,876 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-23 12:05:36,877 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-23 12:05:36,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:05:36,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:05:36,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 12:05:36,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:36,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 12:05:36,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:37,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-23 12:05:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249333997] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:37,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:05:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2025-01-23 12:05:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325887375] [2025-01-23 12:05:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 12:05:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:37,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 12:05:37,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-23 12:05:37,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:37,070 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:37,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:37,787 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-23 12:05:37,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:37,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2084796771, now seen corresponding path program 3 times [2025-01-23 12:05:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579299970] [2025-01-23 12:05:37,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 12:05:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:37,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:05:38,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:05:38,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-23 12:05:38,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:38,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579299970] [2025-01-23 12:05:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579299970] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793439062] [2025-01-23 12:05:38,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 12:05:38,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:38,117 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-23 12:05:38,118 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-23 12:05:38,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:05:38,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:05:38,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-23 12:05:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:38,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 12:05:38,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:38,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:38,292 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-23 12:05:38,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793439062] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:05:38,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 14 [2025-01-23 12:05:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91067359] [2025-01-23 12:05:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:05:38,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 12:05:38,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:38,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 12:05:38,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-23 12:05:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:38,293 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:38,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:38,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:39,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-23 12:05:39,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:39,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -100311006, now seen corresponding path program 4 times [2025-01-23 12:05:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249977522] [2025-01-23 12:05:39,199 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 12:05:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:39,208 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:05:39,218 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:05:39,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 12:05:39,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-23 12:05:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:39,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249977522] [2025-01-23 12:05:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249977522] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:39,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552193466] [2025-01-23 12:05:39,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 12:05:39,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:39,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:39,316 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-23 12:05:39,317 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-23 12:05:39,367 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:05:39,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:05:39,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 12:05:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:39,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 12:05:39,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:05:39,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-23 12:05:39,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552193466] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:05:39,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 12:05:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-01-23 12:05:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265059224] [2025-01-23 12:05:39,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 12:05:39,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-23 12:05:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:39,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-23 12:05:39,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-23 12:05:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:39,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:39,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:39,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-23 12:05:40,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-23 12:05:40,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:40,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash -633217275, now seen corresponding path program 5 times [2025-01-23 12:05:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453089204] [2025-01-23 12:05:40,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-23 12:05:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:40,550 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-23 12:05:40,558 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 12:05:40,558 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 12:05:40,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:40,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453089204] [2025-01-23 12:05:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453089204] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764980810] [2025-01-23 12:05:40,619 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-23 12:05:40,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:40,621 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-23 12:05:40,622 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-23 12:05:40,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-23 12:05:40,698 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 12:05:40,698 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 12:05:40,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:40,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 12:05:40,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:40,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:05:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764980810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:05:40,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 12:05:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-23 12:05:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745619938] [2025-01-23 12:05:40,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 12:05:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-23 12:05:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:40,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-23 12:05:40,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-23 12:05:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:40,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:40,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:40,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-23 12:05:40,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-23 12:05:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:05:40,954 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-23 12:05:41,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:41,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:41,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash 821773723, now seen corresponding path program 6 times [2025-01-23 12:05:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:41,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412103898] [2025-01-23 12:05:41,144 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-23 12:05:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:41,159 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-01-23 12:05:41,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-23 12:05:41,205 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-23 12:05:41,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 12:05:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412103898] [2025-01-23 12:05:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412103898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222257682] [2025-01-23 12:05:41,315 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-23 12:05:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:41,317 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-23 12:05:41,319 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-23 12:05:41,373 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-01-23 12:05:41,405 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-23 12:05:41,406 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-23 12:05:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:41,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 12:05:41,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 12:05:41,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:05:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 12:05:41,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222257682] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:05:41,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 12:05:41,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-01-23 12:05:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743296856] [2025-01-23 12:05:41,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 12:05:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-23 12:05:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:05:41,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-23 12:05:41,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-01-23 12:05:41,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:41,535 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:05:41,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:05:41,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:05:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-23 12:05:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:05:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:05:42,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-23 12:05:42,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:42,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:05:42,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:05:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2102547615, now seen corresponding path program 7 times [2025-01-23 12:05:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 12:05:42,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897866457] [2025-01-23 12:05:42,661 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-23 12:05:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 12:05:42,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 12:05:42,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 12:05:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 12:05:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 12:05:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897866457] [2025-01-23 12:05:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897866457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 12:05:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116008275] [2025-01-23 12:05:43,792 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-23 12:05:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:05:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:05:43,794 INFO L229 MonitoredProcess]: Starting monitored process 12 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 12:05:43,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-23 12:05:43,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 12:05:43,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 12:05:43,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:05:43,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:05:43,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-23 12:05:43,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:05:44,168 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-01-23 12:05:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-01-23 12:05:44,476 INFO L349 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2025-01-23 12:05:44,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 153 [2025-01-23 12:05:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-23 12:05:44,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:06:29,039 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~C~0.base Int)) (let ((.cse2 (select |c_#memory_int| ~B~0.base)) (.cse5 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse4 (select .cse2 (+ .cse5 ~B~0.offset))) (.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5)))) (let ((.cse7 (store |c_#memory_int| ~C~0.base (store (select |c_#memory_int| ~C~0.base) (+ .cse5 ~C~0.offset) (+ .cse4 .cse6))))) (let ((.cse3 (select .cse7 c_~A~0.base)) (.cse0 (select .cse7 ~B~0.base))) (= (let ((.cse1 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) (+ (select .cse0 (+ ~B~0.offset 4 .cse1)) c_~asum~0 c_~bsum~0 (select .cse2 (+ ~B~0.offset .cse1)) (select .cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (+ .cse4 (select .cse3 (+ c_~A~0.offset .cse5 4)) (select .cse0 (+ .cse5 ~B~0.offset 4)) c_~csum~0 .cse6))))))) is different from false [2025-01-23 12:06:29,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 12:06:29,810 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 1396 treesize of output 1014 [2025-01-23 12:07:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2025-01-23 12:07:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116008275] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:07:20,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 12:07:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 33 [2025-01-23 12:07:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905391616] [2025-01-23 12:07:20,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 12:07:20,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-23 12:07:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 12:07:20,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-23 12:07:20,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=890, Unknown=13, NotChecked=62, Total=1122 [2025-01-23 12:07:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:07:20,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:07:20,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 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 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:07:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:07:48,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:07:51,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:07:53,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:07:55,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:07:57,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:07:59,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:01,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:04,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:06,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:08,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:10,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:12,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:15,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:17,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:19,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:21,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:24,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:26,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:27,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:29,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:32,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:34,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:42,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:45,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:47,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:49,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:51,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:53,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:55,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:57,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:08:59,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:02,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:04,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:06,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:08,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:10,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:12,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:14,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:16,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:18,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:20,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:22,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:27,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:29,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:32,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:33,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:37,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:39,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:43,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:45,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:49,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:51,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:55,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:57,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:09:59,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:10:02,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:10:05,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:10:06,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:10:11,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:10:13,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-23 12:10:16,564 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-23 12:10:16,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2025-01-23 12:10:16,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-23 12:10:16,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-23 12:10:16,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-01-23 12:10:16,785 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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1939) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:601) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) 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) ... 63 more [2025-01-23 12:10:16,790 INFO L158 Benchmark]: Toolchain (without parser) took 302824.96ms. Allocated memory was 83.9MB in the beginning and 536.9MB in the end (delta: 453.0MB). Free memory was 59.3MB in the beginning and 200.1MB in the end (delta: -140.8MB). Peak memory consumption was 308.5MB. Max. memory is 16.1GB. [2025-01-23 12:10:16,790 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 12:10:16,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.36ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 45.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-23 12:10:16,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.46ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 12:10:16,790 INFO L158 Benchmark]: Boogie Preprocessor took 19.85ms. Allocated memory is still 83.9MB. Free memory was 43.2MB in the beginning and 41.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 12:10:16,790 INFO L158 Benchmark]: RCFGBuilder took 766.03ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 36.4MB in the end (delta: 5.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2025-01-23 12:10:16,790 INFO L158 Benchmark]: TraceAbstraction took 301825.35ms. Allocated memory was 83.9MB in the beginning and 536.9MB in the end (delta: 453.0MB). Free memory was 35.7MB in the beginning and 200.1MB in the end (delta: -164.3MB). Peak memory consumption was 284.6MB. Max. memory is 16.1GB. [2025-01-23 12:10:16,791 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.24ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.36ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 45.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.46ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.85ms. Allocated memory is still 83.9MB. Free memory was 43.2MB in the beginning and 41.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 766.03ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 36.4MB in the end (delta: 5.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 301825.35ms. Allocated memory was 83.9MB in the beginning and 536.9MB in the end (delta: 453.0MB). Free memory was 35.7MB in the beginning and 200.1MB in the end (delta: -164.3MB). Peak memory consumption was 284.6MB. 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-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 12:10:18,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 12:10:18,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-01-23 12:10:18,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 12:10:18,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 12:10:18,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 12:10:18,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 12:10:18,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 12:10:18,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 12:10:18,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 12:10:18,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 12:10:18,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 12:10:18,310 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 12:10:18,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 12:10:18,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 12:10:18,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 12:10:18,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 12:10:18,312 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 12:10:18,312 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 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 -> NONE [2025-01-23 12:10:18,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 12:10:18,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 12:10:18,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 12:10:18,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 12:10:18,535 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 12:10:18,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-23 12:10:19,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a0b34110e/75d45014da8546b9a387db77d2ddedcd/FLAG9012b3a33 [2025-01-23 12:10:19,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 12:10:19,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-23 12:10:19,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a0b34110e/75d45014da8546b9a387db77d2ddedcd/FLAG9012b3a33 [2025-01-23 12:10:20,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a0b34110e/75d45014da8546b9a387db77d2ddedcd [2025-01-23 12:10:20,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 12:10:20,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 12:10:20,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 12:10:20,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 12:10:20,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 12:10:20,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6bdd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20, skipping insertion in model container [2025-01-23 12:10:20,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 12:10:20,400 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-01-23 12:10:20,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 12:10:20,421 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 12:10:20,468 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-01-23 12:10:20,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 12:10:20,482 INFO L204 MainTranslator]: Completed translation [2025-01-23 12:10:20,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20 WrapperNode [2025-01-23 12:10:20,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 12:10:20,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 12:10:20,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 12:10:20,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 12:10:20,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,514 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 238 [2025-01-23 12:10:20,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 12:10:20,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 12:10:20,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 12:10:20,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 12:10:20,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 12:10:20,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 12:10:20,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 12:10:20,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 12:10:20,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (1/1) ... [2025-01-23 12:10:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 12:10:20,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:20,559 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 12:10:20,561 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 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 12:10:20,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 12:10:20,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-23 12:10:20,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 12:10:20,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 12:10:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-01-23 12:10:20,576 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 12:10:20,659 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 12:10:20,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 12:10:21,029 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 12:10:21,029 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 12:10:21,306 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 12:10:21,306 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 12:10:21,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:10:21 BoogieIcfgContainer [2025-01-23 12:10:21,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 12:10:21,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 12:10:21,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 12:10:21,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 12:10:21,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 12:10:20" (1/3) ... [2025-01-23 12:10:21,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b9060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:10:21, skipping insertion in model container [2025-01-23 12:10:21,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:10:20" (2/3) ... [2025-01-23 12:10:21,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b9060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:10:21, skipping insertion in model container [2025-01-23 12:10:21,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:10:21" (3/3) ... [2025-01-23 12:10:21,315 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-01-23 12:10:21,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 12:10:21,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-23 12:10:21,326 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 12:10:21,367 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-23 12:10:21,392 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 12:10:21,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 12:10:21,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:21,394 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 12:10:21,396 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 12:10:21,457 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 12:10:21,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 12:10:21,471 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;@7857a098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 12:10:21,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-23 12:10:24,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:24,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1414399275, now seen corresponding path program 1 times [2025-01-23 12:10:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968707796] [2025-01-23 12:10:24,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:24,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:24,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:24,215 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 12:10:24,216 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 12:10:24,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 12:10:24,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 12:10:24,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:24,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:24,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-23 12:10:24,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:24,405 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 12:10:24,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 12:10:24,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968707796] [2025-01-23 12:10:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968707796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:10:24,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:10:24,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 12:10:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611252684] [2025-01-23 12:10:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:10:24,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 12:10:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:24,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 12:10:24,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 12:10:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:24,423 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 12:10:24,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:25,708 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 12:10:25,898 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-23 12:10:25,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:25,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 897353279, now seen corresponding path program 1 times [2025-01-23 12:10:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334570951] [2025-01-23 12:10:25,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:25,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:25,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:25,902 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 12:10:25,902 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 12:10:25,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-23 12:10:25,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-23 12:10:25,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:25,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:25,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 12:10:25,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:26,055 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-23 12:10:26,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 12:10:26,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334570951] [2025-01-23 12:10:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334570951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:10:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:10:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 12:10:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961602589] [2025-01-23 12:10:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:10:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 12:10:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:26,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 12:10:26,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-23 12:10:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:26,058 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 12:10:26,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:26,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:27,870 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-23 12:10:28,064 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-23 12:10:28,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1523768636, now seen corresponding path program 1 times [2025-01-23 12:10:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257054127] [2025-01-23 12:10:28,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:28,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:28,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:28,066 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 12:10:28,068 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 12:10:28,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-23 12:10:28,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-23 12:10:28,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:28,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:28,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 12:10:28,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:28,207 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 12:10:28,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 12:10:28,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:28,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257054127] [2025-01-23 12:10:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257054127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:10:28,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:10:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 12:10:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104575871] [2025-01-23 12:10:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:10:28,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 12:10:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:28,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 12:10:28,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-23 12:10:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:28,210 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:28,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 12:10:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:28,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:31,565 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 12:10:31,759 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-23 12:10:31,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:31,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash -661339141, now seen corresponding path program 1 times [2025-01-23 12:10:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244538059] [2025-01-23 12:10:31,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:31,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:31,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:31,763 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 12:10:31,764 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 12:10:31,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-23 12:10:31,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-23 12:10:31,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:31,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:31,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 12:10:31,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:31,891 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 12:10:31,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 12:10:31,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244538059] [2025-01-23 12:10:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244538059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:10:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:10:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 12:10:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881415361] [2025-01-23 12:10:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:10:31,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 12:10:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:31,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 12:10:31,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-23 12:10:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:31,892 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:31,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 12:10:31,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:31,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:31,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:36,353 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-23 12:10:36,548 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-23 12:10:36,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:36,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -845220294, now seen corresponding path program 1 times [2025-01-23 12:10:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:36,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849664368] [2025-01-23 12:10:36,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:36,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:36,551 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-23 12:10:36,552 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-23 12:10:36,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-23 12:10:36,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-23 12:10:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:36,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 12:10:36,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:36,660 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 12:10:36,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 12:10:36,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849664368] [2025-01-23 12:10:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849664368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:10:36,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:10:36,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 12:10:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143978207] [2025-01-23 12:10:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:10:36,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 12:10:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:36,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 12:10:36,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-23 12:10:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:36,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:36,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-23 12:10:36,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:36,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:36,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:36,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:36,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,236 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-23 12:10:43,429 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-23 12:10:43,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:43,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2055212688, now seen corresponding path program 1 times [2025-01-23 12:10:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871899440] [2025-01-23 12:10:43,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:43,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:43,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:43,431 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-23 12:10:43,432 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-23 12:10:43,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 12:10:43,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 12:10:43,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:43,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:43,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 12:10:43,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:43,557 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-23 12:10:43,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 12:10:43,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871899440] [2025-01-23 12:10:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871899440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 12:10:43,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 12:10:43,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 12:10:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727748166] [2025-01-23 12:10:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 12:10:43,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 12:10:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:43,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 12:10:43,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 12:10:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:43,558 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:43,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 12:10:43,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:43,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:10:43,671 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-23 12:10:43,864 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-23 12:10:43,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 564259304, now seen corresponding path program 1 times [2025-01-23 12:10:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:43,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410005321] [2025-01-23 12:10:43,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 12:10:43,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:43,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:43,867 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-23 12:10:43,868 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-23 12:10:43,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 12:10:44,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 12:10:44,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:10:44,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-23 12:10:44,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:44,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 12:10:44,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2025-01-23 12:10:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:10:44,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:10:44,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 12:10:44,565 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 42 treesize of output 103 [2025-01-23 12:10:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:10:45,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410005321] [2025-01-23 12:10:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410005321] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:10:45,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:10:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-01-23 12:10:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267238106] [2025-01-23 12:10:45,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-23 12:10:45,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-23 12:10:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:45,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-23 12:10:45,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-23 12:10:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:45,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:45,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 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 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:10:45,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:10:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:10:50,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-23 12:10:50,553 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-23 12:10:50,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 312817954, now seen corresponding path program 2 times [2025-01-23 12:10:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625294486] [2025-01-23 12:10:50,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 12:10:50,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:50,556 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-23 12:10:50,558 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-23 12:10:50,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:10:50,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:10:50,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 12:10:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:50,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 12:10:50,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:10:50,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:10:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:10:50,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625294486] [2025-01-23 12:10:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625294486] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:10:50,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:10:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-23 12:10:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335384277] [2025-01-23 12:10:50,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-23 12:10:50,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 12:10:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:50,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 12:10:50,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-23 12:10:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:50,848 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:10:50,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:10:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-23 12:10:56,039 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-23 12:10:56,232 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-23 12:10:56,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:10:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:10:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 939233311, now seen corresponding path program 3 times [2025-01-23 12:10:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:10:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858694258] [2025-01-23 12:10:56,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 12:10:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:10:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:10:56,235 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-23 12:10:56,236 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-23 12:10:56,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:10:56,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:10:56,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-23 12:10:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:10:56,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 12:10:56,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:10:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:10:56,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:10:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:10:56,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:10:56,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858694258] [2025-01-23 12:10:56,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858694258] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:10:56,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:10:56,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-23 12:10:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772766233] [2025-01-23 12:10:56,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-23 12:10:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 12:10:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:10:56,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 12:10:56,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-23 12:10:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:10:56,501 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:10:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-23 12:10:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:05,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-23 12:11:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:05,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:11:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:11:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1245874466, now seen corresponding path program 4 times [2025-01-23 12:11:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:11:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675624272] [2025-01-23 12:11:05,313 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 12:11:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:11:05,314 INFO L229 MonitoredProcess]: Starting monitored process 12 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 12:11:05,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-23 12:11:05,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-23 12:11:05,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 12:11:05,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 12:11:05,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:11:05,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 12:11:05,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:11:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:11:05,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:11:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-23 12:11:05,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:11:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675624272] [2025-01-23 12:11:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675624272] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:11:05,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:11:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-23 12:11:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339884817] [2025-01-23 12:11:05,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-23 12:11:05,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 12:11:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:11:05,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 12:11:05,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-23 12:11:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:05,550 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:11:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:15,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-23 12:11:15,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:15,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:11:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:11:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1785946185, now seen corresponding path program 5 times [2025-01-23 12:11:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:11:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750451987] [2025-01-23 12:11:15,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-23 12:11:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:11:15,461 INFO L229 MonitoredProcess]: Starting monitored process 13 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 12:11:15,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-23 12:11:15,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-23 12:11:15,570 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 12:11:15,570 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 12:11:15,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:11:15,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-23 12:11:15,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:11:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:11:15,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:11:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 12:11:15,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:11:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750451987] [2025-01-23 12:11:15,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750451987] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:11:15,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:11:15,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-23 12:11:15,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786295202] [2025-01-23 12:11:15,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-23 12:11:15,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 12:11:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:11:15,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 12:11:15,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-23 12:11:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:15,724 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:11:15,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 12:11:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:15,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:11:18,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-23 12:11:18,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:18,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:11:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:11:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -731946273, now seen corresponding path program 6 times [2025-01-23 12:11:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:11:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897401743] [2025-01-23 12:11:18,396 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-23 12:11:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:11:18,397 INFO L229 MonitoredProcess]: Starting monitored process 14 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 12:11:18,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-23 12:11:18,448 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-01-23 12:11:18,498 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-23 12:11:18,499 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-23 12:11:18,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:11:18,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 12:11:18,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:11:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-23 12:11:18,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 12:11:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-23 12:11:18,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 12:11:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897401743] [2025-01-23 12:11:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897401743] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 12:11:18,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 12:11:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-23 12:11:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893204942] [2025-01-23 12:11:18,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-23 12:11:18,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 12:11:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 12:11:18,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 12:11:18,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-23 12:11:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:18,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 12:11:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:11:18,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 12:11:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 12:11:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 12:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-23 12:11:31,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-23 12:11:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:32,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 12:11:32,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 12:11:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1271740043, now seen corresponding path program 7 times [2025-01-23 12:11:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 12:11:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042618808] [2025-01-23 12:11:32,039 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-23 12:11:32,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 12:11:32,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 12:11:32,041 INFO L229 MonitoredProcess]: Starting monitored process 15 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 12:11:32,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-23 12:11:32,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 12:12:39,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 12:12:39,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 12:12:39,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 12:12:39,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-23 12:12:39,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 12:12:39,724 INFO L349 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-01-23 12:12:39,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 76 [2025-01-23 12:12:42,380 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2025-01-23 12:12:42,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 431 treesize of output 283 [2025-01-23 12:15:43,452 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse6 (bvmul c_~csum~0 (_ bv4294967295 32))) (.cse7 (bvmul (_ bv4294967295 32) c_~bsum~0))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse3 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse4 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse3))) (.cse5 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse2 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse0 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse1 (bvadd .cse2 c_~bsum~0))) (and (bvsle .cse0 (_ bv0 32)) (bvsle .cse1 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse2 .cse3)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0)))) (bvsge .cse4 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse4 (bvadd (bvneg ((_ sign_extend 32) .cse5)) (_ bv18446744071562067968 64))) (bvsle .cse5 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse13 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse14 (bvadd .cse7 c_~csum~0 .cse13))) (let ((.cse8 ((_ sign_extend 32) .cse14)) (.cse9 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse8 (bvadd (bvneg ((_ sign_extend 32) .cse9)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse12 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse10 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse11 (bvadd .cse12 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse10 (_ bv0 32)) (bvsle .cse11 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse12 .cse13)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse10)))) (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse11)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse14 (bvadd (_ bv2147483647 32) (bvneg .cse9)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse20 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse15 ((_ sign_extend 32) .cse20)) (.cse16 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse15 (bvadd (bvneg ((_ sign_extend 32) .cse16)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse19 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse17 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse18 ((_ sign_extend 32) .cse19))) (and (bvsge .cse17 (_ bv0 32)) (bvsge .cse18 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse17 (_ bv0 32)) (bvsle .cse19 (_ bv0 32)) (bvsge .cse15 (bvadd (_ bv18446744071562067968 64) (bvneg .cse18))))))) (bvsle .cse20 (bvadd (_ bv2147483647 32) (bvneg .cse16))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse22 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse24 (bvadd .cse7 c_~csum~0 .cse22))) (let ((.cse25 ((_ sign_extend 32) .cse24)) (.cse26 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse21 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse23 (bvadd .cse21 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse21 .cse22) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse23 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse24 (bvadd (_ bv2147483647 32) (bvneg .cse23))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse25 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse23)))))))) (bvsge .cse25 (bvadd (bvneg ((_ sign_extend 32) .cse26)) (_ bv18446744071562067968 64))) (bvsle .cse24 (bvadd (_ bv2147483647 32) (bvneg .cse26)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse33 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse30 (bvadd .cse7 c_~csum~0 .cse33))) (let ((.cse27 ((_ sign_extend 32) .cse30)) (.cse28 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse27 (bvadd (bvneg ((_ sign_extend 32) .cse28)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse32 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse31 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse29 (bvadd .cse32 c_~bsum~0))) (and (bvsle .cse29 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse30 (bvadd (_ bv2147483647 32) (bvneg .cse29))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse31 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse32 .cse33)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse31)))) (bvsge .cse27 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse29)))))))) (bvsle .cse30 (bvadd (_ bv2147483647 32) (bvneg .cse28)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse36 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse34 ((_ sign_extend 32) .cse36)) (.cse35 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse34 (bvadd (bvneg ((_ sign_extend 32) .cse35)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse37 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse36 (bvadd (_ bv2147483647 32) (bvneg .cse37))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse34 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse37)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse35 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse42 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse38 ((_ sign_extend 32) .cse42)) (.cse39 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse38 (bvadd (bvneg ((_ sign_extend 32) .cse39)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse41 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse40 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse40 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse41 (_ bv0 32)) (bvsle .cse42 (bvadd (_ bv2147483647 32) (bvneg .cse40))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse41 (_ bv0 32)) (bvsge .cse38 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse40))))))) (bvsle .cse42 (bvadd (_ bv2147483647 32) (bvneg .cse39))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse46 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse43 ((_ sign_extend 32) .cse46)) (.cse44 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse43 (bvadd (bvneg ((_ sign_extend 32) .cse44)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse45 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse45 (_ bv0 32)) (bvsge .cse43 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse45)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse46 (bvadd (_ bv2147483647 32) (bvneg .cse44))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse48 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse49 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse47 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse47 (_ bv0 32)) (bvsge .cse48 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse47)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse48 (bvadd (bvneg ((_ sign_extend 32) .cse49)) (_ bv18446744071562067968 64))) (bvsle .cse49 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse55 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse52 (bvadd .cse7 c_~csum~0 .cse55))) (let ((.cse50 ((_ sign_extend 32) .cse52)) (.cse51 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse50 (bvadd (bvneg ((_ sign_extend 32) .cse51)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse54 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse53 (bvadd .cse54 c_~bsum~0))) (and (bvsle .cse52 (bvadd (_ bv2147483647 32) (bvneg .cse53))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse54 .cse55)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse50 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse53)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse51 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse60 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse61 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse60))) (.cse62 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse59 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse56 (bvadd .cse59 c_~bsum~0))) (let ((.cse58 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse57 ((_ sign_extend 32) .cse56))) (and (bvsle .cse56 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse57 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse58 (_ bv0 32)) (bvsle .cse56 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse59 .cse60)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse58)))) (bvsge .cse61 (bvadd (_ bv18446744071562067968 64) (bvneg .cse57)))))))) (bvsge .cse61 (bvadd (bvneg ((_ sign_extend 32) .cse62)) (_ bv18446744071562067968 64))) (bvsle .cse62 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse69 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse66 (bvadd .cse7 c_~csum~0 .cse69))) (let ((.cse67 ((_ sign_extend 32) .cse66)) (.cse70 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse68 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse63 (bvadd c_~csum~0 .cse68 .cse69)) (.cse64 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse65 (bvadd .cse68 c_~bsum~0))) (and (bvsle .cse63 (bvadd (bvneg .cse64) (_ bv2147483647 32))) (bvsle .cse65 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse66 (bvadd (_ bv2147483647 32) (bvneg .cse65))) (bvsge ((_ sign_extend 32) .cse63) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse64)))) (bvsge .cse67 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse65)))))))) (bvsge .cse67 (bvadd (bvneg ((_ sign_extend 32) .cse70)) (_ bv18446744071562067968 64))) (bvsle .cse66 (bvadd (_ bv2147483647 32) (bvneg .cse70)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse78 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse76 (bvadd .cse7 c_~csum~0 .cse78))) (let ((.cse71 ((_ sign_extend 32) .cse76)) (.cse72 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse71 (bvadd (bvneg ((_ sign_extend 32) .cse72)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse77 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse73 (bvadd c_~csum~0 .cse77 .cse78)) (.cse74 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse75 (bvadd .cse77 c_~bsum~0))) (and (bvsle .cse73 (bvadd (bvneg .cse74) (_ bv2147483647 32))) (bvsle .cse75 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse76 (bvadd (_ bv2147483647 32) (bvneg .cse75))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse73) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse74)))) (bvsge .cse71 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse75)))))))) (bvsle .cse76 (bvadd (_ bv2147483647 32) (bvneg .cse72)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse86 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse87 (bvadd .cse7 c_~csum~0 .cse86))) (let ((.cse79 ((_ sign_extend 32) .cse87)) (.cse80 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse79 (bvadd (bvneg ((_ sign_extend 32) .cse80)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse85 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse83 (bvadd .cse85 c_~bsum~0))) (let ((.cse81 (bvadd c_~csum~0 .cse85 .cse86)) (.cse82 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse84 ((_ sign_extend 32) .cse83))) (and (bvsle .cse81 (bvadd (bvneg .cse82) (_ bv2147483647 32))) (bvsle .cse83 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse84 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse83 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse81) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse82)))) (bvsge .cse79 (bvadd (_ bv18446744071562067968 64) (bvneg .cse84)))))))) (bvsle .cse87 (bvadd (_ bv2147483647 32) (bvneg .cse80)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse89 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse91 (bvadd .cse7 c_~csum~0 .cse89))) (let ((.cse93 ((_ sign_extend 32) .cse91)) (.cse94 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse88 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse90 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse92 (bvadd .cse88 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse88 .cse89) (bvadd (bvneg .cse90) (_ bv2147483647 32))) (bvsge .cse90 (_ bv0 32)) (bvsle .cse91 (bvadd (_ bv2147483647 32) (bvneg .cse92))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse93 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse92)))))))) (bvsge .cse93 (bvadd (bvneg ((_ sign_extend 32) .cse94)) (_ bv18446744071562067968 64))) (bvsle .cse91 (bvadd (_ bv2147483647 32) (bvneg .cse94)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse96 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse97 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse95 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse95 (_ bv0 32)) (bvsge .cse96 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse95))))))) (bvsge .cse96 (bvadd (bvneg ((_ sign_extend 32) .cse97)) (_ bv18446744071562067968 64))) (bvsle .cse97 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse99 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse104 (bvadd .cse7 c_~csum~0 .cse99))) (let ((.cse102 ((_ sign_extend 32) .cse104)) (.cse103 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse98 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse100 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse101 (bvadd .cse98 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse98 .cse99) (bvadd (bvneg .cse100) (_ bv2147483647 32))) (bvsge .cse100 (_ bv0 32)) (bvsle .cse101 (_ bv0 32)) (bvsge .cse102 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse101)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse102 (bvadd (bvneg ((_ sign_extend 32) .cse103)) (_ bv18446744071562067968 64))) (bvsle .cse104 (bvadd (_ bv2147483647 32) (bvneg .cse103)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse112 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse110 (bvadd .cse7 c_~csum~0 .cse112))) (let ((.cse105 ((_ sign_extend 32) .cse110)) (.cse106 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse105 (bvadd (bvneg ((_ sign_extend 32) .cse106)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse111 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse107 (bvadd c_~csum~0 .cse111 .cse112)) (.cse108 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse109 (bvadd .cse111 c_~bsum~0))) (and (bvsle .cse107 (bvadd (bvneg .cse108) (_ bv2147483647 32))) (bvsle .cse109 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse110 (bvadd (_ bv2147483647 32) (bvneg .cse109))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse107) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse108)))) (bvsge .cse105 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse109)))))))) (bvsle .cse106 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse113 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse114 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse113 (bvadd (bvneg ((_ sign_extend 32) .cse114)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse115 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse116 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse115 (_ bv0 32)) (bvsle .cse115 (_ bv0 32)) (bvsle .cse116 (_ bv0 32)) (bvsge .cse113 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse116)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse114 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse123 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse119 (bvadd .cse7 c_~csum~0 .cse123))) (let ((.cse118 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse117 ((_ sign_extend 32) .cse119))) (and (bvsge .cse117 (bvadd (bvneg ((_ sign_extend 32) .cse118)) (_ bv18446744071562067968 64))) (bvsle .cse119 (bvadd (_ bv2147483647 32) (bvneg .cse118))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse122 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse120 (bvadd .cse122 c_~bsum~0))) (let ((.cse121 ((_ sign_extend 32) .cse120))) (and (bvsle .cse120 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse121 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse120 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse122 .cse123)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse117 (bvadd (_ bv18446744071562067968 64) (bvneg .cse121))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse128 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse129 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse128))) (.cse130 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse127 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse126 (bvadd .cse127 c_~bsum~0))) (let ((.cse125 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse124 ((_ sign_extend 32) .cse126))) (and (bvsge .cse124 .cse125) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse125) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse126 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse127 .cse128)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse129 (bvadd (_ bv18446744071562067968 64) (bvneg .cse124)))))))) (bvsge .cse129 (bvadd (bvneg ((_ sign_extend 32) .cse130)) (_ bv18446744071562067968 64))) (bvsle .cse130 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse136 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse133 (bvadd .cse7 c_~csum~0 .cse136))) (let ((.cse132 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse131 ((_ sign_extend 32) .cse133))) (and (bvsge .cse131 (bvadd (bvneg ((_ sign_extend 32) .cse132)) (_ bv18446744071562067968 64))) (bvsle .cse133 (bvadd (_ bv2147483647 32) (bvneg .cse132))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse135 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse134 (bvadd .cse135 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse134 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse135 .cse136)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse131 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse134)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse138 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse140 ((_ sign_extend 32) .cse138)) (.cse141 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse137 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse139 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse137 (_ bv0 32)) (bvsle .cse138 (bvadd (_ bv2147483647 32) (bvneg .cse139))) (bvsle .cse137 (_ bv0 32)) (bvsge .cse140 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse139))))))) (bvsge .cse140 (bvadd (bvneg ((_ sign_extend 32) .cse141)) (_ bv18446744071562067968 64))) (bvsle .cse138 (bvadd (_ bv2147483647 32) (bvneg .cse141))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse144 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse143 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse142 ((_ sign_extend 32) .cse144))) (and (bvsge .cse142 (bvadd (bvneg ((_ sign_extend 32) .cse143)) (_ bv18446744071562067968 64))) (bvsle .cse144 (bvadd (_ bv2147483647 32) (bvneg .cse143))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse145 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse146 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse147 ((_ sign_extend 32) .cse145))) (and (bvsle .cse145 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse146 (_ bv0 32)) (bvsge .cse147 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse146 (_ bv0 32)) (bvsle .cse145 (_ bv0 32)) (bvsge .cse142 (bvadd (_ bv18446744071562067968 64) (bvneg .cse147))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse150 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse149 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse148 ((_ sign_extend 32) .cse150))) (and (bvsge .cse148 (bvadd (bvneg ((_ sign_extend 32) .cse149)) (_ bv18446744071562067968 64))) (bvsle .cse150 (bvadd (_ bv2147483647 32) (bvneg .cse149))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse151 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse152 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse151 (_ bv0 32)) (bvsle .cse151 (_ bv0 32)) (bvsle .cse152 (_ bv0 32)) (bvsge .cse148 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse152)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse155 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse156 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse153 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse154 ((_ sign_extend 32) .cse153))) (and (bvsle .cse153 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse154 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse153 (_ bv0 32)) (bvsge .cse155 (bvadd (_ bv18446744071562067968 64) (bvneg .cse154))))))) (bvsge .cse155 (bvadd (bvneg ((_ sign_extend 32) .cse156)) (_ bv18446744071562067968 64))) (bvsle .cse156 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse163 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse159 (bvadd .cse7 c_~csum~0 .cse163))) (let ((.cse161 ((_ sign_extend 32) .cse159)) (.cse164 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse162 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse157 (bvadd c_~csum~0 .cse162 .cse163)) (.cse158 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse160 (bvadd .cse162 c_~bsum~0))) (and (bvsle .cse157 (bvadd (bvneg .cse158) (_ bv2147483647 32))) (bvsle .cse159 (bvadd (_ bv2147483647 32) (bvneg .cse160))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse157) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse158)))) (bvsge .cse161 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse160)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse161 (bvadd (bvneg ((_ sign_extend 32) .cse164)) (_ bv18446744071562067968 64))) (bvsle .cse164 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse173 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse165 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse173))) (.cse166 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse165 (bvadd (bvneg ((_ sign_extend 32) .cse166)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse172 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse171 (bvadd .cse172 c_~bsum~0))) (let ((.cse170 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse167 (bvadd c_~csum~0 .cse172 .cse173)) (.cse168 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse169 ((_ sign_extend 32) .cse171))) (and (bvsle .cse167 (bvadd (bvneg .cse168) (_ bv2147483647 32))) (bvsge .cse169 .cse170) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse170) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse171 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse167) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse168)))) (bvsge .cse165 (bvadd (_ bv18446744071562067968 64) (bvneg .cse169)))))))) (bvsle .cse166 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse178 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse176 ((_ sign_extend 32) .cse178)) (.cse177 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse174 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse175 ((_ sign_extend 32) .cse174))) (and (bvsle .cse174 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse175 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse174 (_ bv0 32)) (bvsge .cse176 (bvadd (_ bv18446744071562067968 64) (bvneg .cse175))))))) (bvsge .cse176 (bvadd (bvneg ((_ sign_extend 32) .cse177)) (_ bv18446744071562067968 64))) (bvsle .cse178 (bvadd (_ bv2147483647 32) (bvneg .cse177))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse184 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse179 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse184))) (.cse180 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse179 (bvadd (bvneg ((_ sign_extend 32) .cse180)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse183 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse181 (bvadd .cse183 c_~bsum~0))) (let ((.cse182 ((_ sign_extend 32) .cse181))) (and (bvsle .cse181 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse182 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse181 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse183 .cse184)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse179 (bvadd (_ bv18446744071562067968 64) (bvneg .cse182)))))))) (bvsle .cse180 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse191 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse187 (bvadd .cse7 c_~csum~0 .cse191))) (let ((.cse189 ((_ sign_extend 32) .cse187)) (.cse192 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse190 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse185 (bvadd c_~csum~0 .cse190 .cse191)) (.cse186 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse188 (bvadd .cse190 c_~bsum~0))) (and (bvsle .cse185 (bvadd (bvneg .cse186) (_ bv2147483647 32))) (bvsle .cse187 (bvadd (_ bv2147483647 32) (bvneg .cse188))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse185) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse186)))) (bvsge .cse189 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse188)))))))) (bvsge .cse189 (bvadd (bvneg ((_ sign_extend 32) .cse192)) (_ bv18446744071562067968 64))) (bvsle .cse192 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse197 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse200 (bvadd .cse7 c_~csum~0 .cse197))) (let ((.cse198 ((_ sign_extend 32) .cse200)) (.cse199 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse196 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse193 (bvadd .cse196 c_~bsum~0))) (let ((.cse195 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse194 ((_ sign_extend 32) .cse193))) (and (bvsle .cse193 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse194 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse195 (_ bv0 32)) (bvsle .cse193 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse196 .cse197)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse195)))) (bvsge .cse198 (bvadd (_ bv18446744071562067968 64) (bvneg .cse194)))))))) (bvsge .cse198 (bvadd (bvneg ((_ sign_extend 32) .cse199)) (_ bv18446744071562067968 64))) (bvsle .cse200 (bvadd (_ bv2147483647 32) (bvneg .cse199)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse205 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse201 ((_ sign_extend 32) .cse205)) (.cse202 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse201 (bvadd (bvneg ((_ sign_extend 32) .cse202)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse204 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse203 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse203 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse204 (_ bv0 32)) (bvsle .cse205 (bvadd (_ bv2147483647 32) (bvneg .cse203))) (bvsle .cse204 (_ bv0 32)) (bvsge .cse201 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse203))))))) (bvsle .cse202 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse213 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse206 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse213))) (.cse207 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse206 (bvadd (bvneg ((_ sign_extend 32) .cse207)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse212 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse210 (bvadd .cse212 c_~bsum~0))) (let ((.cse208 (bvadd c_~csum~0 .cse212 .cse213)) (.cse209 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse211 ((_ sign_extend 32) .cse210))) (and (bvsle .cse208 (bvadd (bvneg .cse209) (_ bv2147483647 32))) (bvsle .cse210 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse211 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse210 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse208) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse209)))) (bvsge .cse206 (bvadd (_ bv18446744071562067968 64) (bvneg .cse211)))))))) (bvsle .cse207 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse218 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse214 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse218))) (.cse215 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse214 (bvadd (bvneg ((_ sign_extend 32) .cse215)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse217 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse216 (bvadd .cse217 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse216 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse217 .cse218)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse214 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse216)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse215 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse226 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse221 (bvadd .cse7 c_~csum~0 .cse226))) (let ((.cse220 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse219 ((_ sign_extend 32) .cse221))) (and (bvsge .cse219 (bvadd (bvneg ((_ sign_extend 32) .cse220)) (_ bv18446744071562067968 64))) (bvsle .cse221 (bvadd (_ bv2147483647 32) (bvneg .cse220))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse225 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse222 (bvadd c_~csum~0 .cse225 .cse226)) (.cse223 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse224 (bvadd .cse225 c_~bsum~0))) (and (bvsle .cse222 (bvadd (bvneg .cse223) (_ bv2147483647 32))) (bvsle .cse224 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse222) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse223)))) (bvsge .cse219 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse224)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse229 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse228 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse227 ((_ sign_extend 32) .cse229))) (and (bvsge .cse227 (bvadd (bvneg ((_ sign_extend 32) .cse228)) (_ bv18446744071562067968 64))) (bvsle .cse229 (bvadd (_ bv2147483647 32) (bvneg .cse228))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse230 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse231 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse230 (_ bv0 32)) (bvsle .cse229 (bvadd (_ bv2147483647 32) (bvneg .cse231))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse230 (_ bv0 32)) (bvsge .cse227 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse231)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse234 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse233 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse232 ((_ sign_extend 32) .cse234))) (and (bvsge .cse232 (bvadd (bvneg ((_ sign_extend 32) .cse233)) (_ bv18446744071562067968 64))) (bvsle .cse233 (_ bv0 32)) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse235 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse234 (bvadd (_ bv2147483647 32) (bvneg .cse235))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse232 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse235))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse237 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse238 ((_ sign_extend 32) .cse237)) (.cse239 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse236 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse236 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse237 (bvadd (_ bv2147483647 32) (bvneg .cse236))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse238 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse236))))))) (bvsge .cse238 (bvadd (bvneg ((_ sign_extend 32) .cse239)) (_ bv18446744071562067968 64))) (bvsle .cse239 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse241 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse244 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse241))) (.cse245 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse240 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse242 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse243 (bvadd .cse240 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse240 .cse241) (bvadd (bvneg .cse242) (_ bv2147483647 32))) (bvsge .cse242 (_ bv0 32)) (bvsle .cse243 (_ bv0 32)) (bvsge .cse244 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse243)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse244 (bvadd (bvneg ((_ sign_extend 32) .cse245)) (_ bv18446744071562067968 64))) (bvsle .cse245 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse247 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse248 (bvadd .cse7 c_~csum~0 .cse247))) (let ((.cse250 ((_ sign_extend 32) .cse248)) (.cse251 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse246 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse249 (bvadd .cse246 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse246 .cse247) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse248 (bvadd (_ bv2147483647 32) (bvneg .cse249))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse250 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse249)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse250 (bvadd (bvneg ((_ sign_extend 32) .cse251)) (_ bv18446744071562067968 64))) (bvsle .cse251 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse257 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse254 (bvadd .cse7 c_~csum~0 .cse257))) (let ((.cse252 ((_ sign_extend 32) .cse254)) (.cse253 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse252 (bvadd (bvneg ((_ sign_extend 32) .cse253)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse256 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse255 (bvadd .cse256 c_~bsum~0))) (and (bvsle .cse254 (bvadd (_ bv2147483647 32) (bvneg .cse255))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse256 .cse257)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse252 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse255)))))))) (bvsle .cse253 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse260 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse258 ((_ sign_extend 32) .cse260)) (.cse259 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse258 (bvadd (bvneg ((_ sign_extend 32) .cse259)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse261 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse260 (bvadd (_ bv2147483647 32) (bvneg .cse261))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse258 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse261)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse259 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse268 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse262 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse268))) (.cse263 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse262 (bvadd (bvneg ((_ sign_extend 32) .cse263)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse267 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse264 (bvadd c_~csum~0 .cse267 .cse268)) (.cse265 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse266 (bvadd .cse267 c_~bsum~0))) (and (bvsle .cse264 (bvadd (bvneg .cse265) (_ bv2147483647 32))) (bvsle .cse266 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse264) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse265)))) (bvsge .cse262 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse266)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse263 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse271 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse270 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse269 ((_ sign_extend 32) .cse271))) (and (bvsge .cse269 (bvadd (bvneg ((_ sign_extend 32) .cse270)) (_ bv18446744071562067968 64))) (bvsle .cse271 (bvadd (_ bv2147483647 32) (bvneg .cse270))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse273 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse272 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse272 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse273 (_ bv0 32)) (bvsle .cse271 (bvadd (_ bv2147483647 32) (bvneg .cse272))) (bvsle .cse273 (_ bv0 32)) (bvsge .cse269 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse272))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse278 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse281 (bvadd .cse7 c_~csum~0 .cse278))) (let ((.cse279 ((_ sign_extend 32) .cse281)) (.cse280 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse277 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse276 (bvadd .cse277 c_~bsum~0))) (let ((.cse275 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse274 ((_ sign_extend 32) .cse276))) (and (bvsge .cse274 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse275 (_ bv0 32)) (bvsle .cse276 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse277 .cse278)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse275)))) (bvsge .cse279 (bvadd (_ bv18446744071562067968 64) (bvneg .cse274)))))))) (bvsge .cse279 (bvadd (bvneg ((_ sign_extend 32) .cse280)) (_ bv18446744071562067968 64))) (bvsle .cse281 (bvadd (_ bv2147483647 32) (bvneg .cse280)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse283 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse287 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse283))) (.cse288 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse282 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse285 (bvadd .cse282 c_~bsum~0))) (let ((.cse284 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse286 ((_ sign_extend 32) .cse285))) (and (bvsle (bvadd c_~csum~0 .cse282 .cse283) (bvadd (bvneg .cse284) (_ bv2147483647 32))) (bvsle .cse285 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse284 (_ bv0 32)) (bvsge .cse286 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse285 (_ bv0 32)) (bvsge .cse287 (bvadd (_ bv18446744071562067968 64) (bvneg .cse286)))))))) (bvsge .cse287 (bvadd (bvneg ((_ sign_extend 32) .cse288)) (_ bv18446744071562067968 64))) (bvsle .cse288 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse293 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse291 (bvadd .cse7 c_~csum~0 .cse293))) (let ((.cse290 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse289 ((_ sign_extend 32) .cse291))) (and (bvsge .cse289 (bvadd (bvneg ((_ sign_extend 32) .cse290)) (_ bv18446744071562067968 64))) (bvsle .cse291 (bvadd (_ bv2147483647 32) (bvneg .cse290))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse292 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse294 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse295 (bvadd .cse292 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse292 .cse293) (bvadd (bvneg .cse294) (_ bv2147483647 32))) (bvsle .cse295 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse294 (_ bv0 32)) (bvsle .cse291 (bvadd (_ bv2147483647 32) (bvneg .cse295))) (bvsge .cse289 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse295))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse298 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse296 ((_ sign_extend 32) .cse298)) (.cse297 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse296 (bvadd (bvneg ((_ sign_extend 32) .cse297)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse299 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse298 (bvadd (_ bv2147483647 32) (bvneg .cse299))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse296 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse299)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse298 (bvadd (_ bv2147483647 32) (bvneg .cse297))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse301 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse302 (bvadd .cse7 c_~csum~0 .cse301))) (let ((.cse304 ((_ sign_extend 32) .cse302)) (.cse305 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse300 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse303 (bvadd .cse300 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse300 .cse301) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse302 (bvadd (_ bv2147483647 32) (bvneg .cse303))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse304 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse303)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse304 (bvadd (bvneg ((_ sign_extend 32) .cse305)) (_ bv18446744071562067968 64))) (bvsle .cse302 (bvadd (_ bv2147483647 32) (bvneg .cse305)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse311 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse312 (bvadd .cse7 c_~csum~0 .cse311))) (let ((.cse306 ((_ sign_extend 32) .cse312)) (.cse307 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse306 (bvadd (bvneg ((_ sign_extend 32) .cse307)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse310 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse308 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse309 (bvadd .cse310 c_~bsum~0))) (and (bvsle .cse308 (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse309 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse310 .cse311)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse308)))) (bvsge .cse306 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse309)))))))) (bvsle .cse312 (bvadd (_ bv2147483647 32) (bvneg .cse307)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse319 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse313 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse319))) (.cse314 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse313 (bvadd (bvneg ((_ sign_extend 32) .cse314)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse318 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse315 (bvadd c_~csum~0 .cse318 .cse319)) (.cse316 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse317 (bvadd .cse318 c_~bsum~0))) (and (bvsle .cse315 (bvadd (bvneg .cse316) (_ bv2147483647 32))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse317 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse315) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse316)))) (bvsge .cse313 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse317)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse314 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse326 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse324 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse326))) (.cse327 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse325 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse322 (bvadd .cse325 c_~bsum~0))) (let ((.cse320 (bvadd c_~csum~0 .cse325 .cse326)) (.cse321 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse323 ((_ sign_extend 32) .cse322))) (and (bvsle .cse320 (bvadd (bvneg .cse321) (_ bv2147483647 32))) (bvsle .cse322 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse323 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse322 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse320) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse321)))) (bvsge .cse324 (bvadd (_ bv18446744071562067968 64) (bvneg .cse323)))))))) (bvsge .cse324 (bvadd (bvneg ((_ sign_extend 32) .cse327)) (_ bv18446744071562067968 64))) (bvsle .cse327 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse331 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse328 ((_ sign_extend 32) .cse331)) (.cse329 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse328 (bvadd (bvneg ((_ sign_extend 32) .cse329)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse330 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse330 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse331 (bvadd (_ bv2147483647 32) (bvneg .cse330))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse328 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse330))))))) (bvsle .cse329 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse338 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse335 (bvadd .cse7 c_~csum~0 .cse338))) (let ((.cse336 ((_ sign_extend 32) .cse335)) (.cse339 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse337 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse332 (bvadd c_~csum~0 .cse337 .cse338)) (.cse333 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse334 (bvadd .cse337 c_~bsum~0))) (and (bvsle .cse332 (bvadd (bvneg .cse333) (_ bv2147483647 32))) (bvsle .cse334 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse335 (bvadd (_ bv2147483647 32) (bvneg .cse334))) (bvsge ((_ sign_extend 32) .cse332) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse333)))) (bvsge .cse336 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse334)))))))) (bvsge .cse336 (bvadd (bvneg ((_ sign_extend 32) .cse339)) (_ bv18446744071562067968 64))) (bvsle .cse339 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse340 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse341 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse340 (bvadd (bvneg ((_ sign_extend 32) .cse341)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse342 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse343 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse344 ((_ sign_extend 32) .cse342))) (and (bvsle .cse342 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse343 (_ bv0 32)) (bvsge .cse344 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse343 (_ bv0 32)) (bvsle .cse342 (_ bv0 32)) (bvsge .cse340 (bvadd (_ bv18446744071562067968 64) (bvneg .cse344))))))) (bvsle .cse341 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse352 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse349 (bvadd .cse7 c_~csum~0 .cse352))) (let ((.cse345 ((_ sign_extend 32) .cse349)) (.cse346 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse345 (bvadd (bvneg ((_ sign_extend 32) .cse346)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse351 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse348 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse350 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse347 (bvadd .cse351 c_~bsum~0))) (and (bvsle .cse347 .cse348) (bvsle .cse349 (bvadd (_ bv2147483647 32) (bvneg .cse347))) (bvsle .cse350 (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse348) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse351 .cse352)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse350)))) (bvsge .cse345 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse347)))))))) (bvsle .cse346 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse358 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse353 ((_ sign_extend 32) .cse358)) (.cse354 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse353 (bvadd (bvneg ((_ sign_extend 32) .cse354)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse357 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse356 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse355 ((_ sign_extend 32) .cse357))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse355 .cse356) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse356) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse357 (_ bv0 32)) (bvsge .cse353 (bvadd (_ bv18446744071562067968 64) (bvneg .cse355))))))) (bvsle .cse358 (bvadd (_ bv2147483647 32) (bvneg .cse354))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse360 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse366 (bvadd .cse7 c_~csum~0 .cse360))) (let ((.cse364 ((_ sign_extend 32) .cse366)) (.cse365 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse359 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse362 (bvadd .cse359 c_~bsum~0))) (let ((.cse361 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse363 ((_ sign_extend 32) .cse362))) (and (bvsle (bvadd c_~csum~0 .cse359 .cse360) (bvadd (bvneg .cse361) (_ bv2147483647 32))) (bvsle .cse362 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse361 (_ bv0 32)) (bvsge .cse363 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse362 (_ bv0 32)) (bvsge .cse364 (bvadd (_ bv18446744071562067968 64) (bvneg .cse363)))))))) (bvsge .cse364 (bvadd (bvneg ((_ sign_extend 32) .cse365)) (_ bv18446744071562067968 64))) (bvsle .cse366 (bvadd (_ bv2147483647 32) (bvneg .cse365)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse368 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse370 (bvadd .cse7 c_~csum~0 .cse368))) (let ((.cse371 ((_ sign_extend 32) .cse370)) (.cse372 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse367 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse369 (bvadd .cse367 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse367 .cse368) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse369 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse370 (bvadd (_ bv2147483647 32) (bvneg .cse369))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse371 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse369)))))))) (bvsge .cse371 (bvadd (bvneg ((_ sign_extend 32) .cse372)) (_ bv18446744071562067968 64))) (bvsle .cse372 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse380 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse381 (bvadd .cse7 c_~csum~0 .cse380))) (let ((.cse373 ((_ sign_extend 32) .cse381)) (.cse374 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse373 (bvadd (bvneg ((_ sign_extend 32) .cse374)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse379 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse378 (bvadd .cse379 c_~bsum~0))) (let ((.cse375 (bvadd c_~csum~0 .cse379 .cse380)) (.cse376 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse377 ((_ sign_extend 32) .cse378))) (and (bvsle .cse375 (bvadd (bvneg .cse376) (_ bv2147483647 32))) (bvsge .cse377 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse378 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse375) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse376)))) (bvsge .cse373 (bvadd (_ bv18446744071562067968 64) (bvneg .cse377)))))))) (bvsle .cse381 (bvadd (_ bv2147483647 32) (bvneg .cse374)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse389 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse384 (bvadd .cse7 c_~csum~0 .cse389))) (let ((.cse383 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse382 ((_ sign_extend 32) .cse384))) (and (bvsge .cse382 (bvadd (bvneg ((_ sign_extend 32) .cse383)) (_ bv18446744071562067968 64))) (bvsle .cse384 (bvadd (_ bv2147483647 32) (bvneg .cse383))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse388 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse386 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse387 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse385 (bvadd .cse388 c_~bsum~0))) (and (bvsle .cse385 .cse386) (bvsle .cse384 (bvadd (_ bv2147483647 32) (bvneg .cse385))) (bvsle .cse387 (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse386) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse388 .cse389)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse387)))) (bvsge .cse382 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse385))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse393 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse396 (bvadd .cse7 c_~csum~0 .cse393))) (let ((.cse390 ((_ sign_extend 32) .cse396)) (.cse391 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse390 (bvadd (bvneg ((_ sign_extend 32) .cse391)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse392 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse394 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse395 (bvadd .cse392 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse392 .cse393) (bvadd (bvneg .cse394) (_ bv2147483647 32))) (bvsle .cse395 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse394 (_ bv0 32)) (bvsle .cse396 (bvadd (_ bv2147483647 32) (bvneg .cse395))) (bvsge .cse390 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse395)))))))) (bvsle .cse391 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse403 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse399 (bvadd .cse7 c_~csum~0 .cse403))) (let ((.cse397 ((_ sign_extend 32) .cse399)) (.cse398 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse397 (bvadd (bvneg ((_ sign_extend 32) .cse398)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse402 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse401 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse400 (bvadd .cse402 c_~bsum~0))) (and (bvsle .cse399 (bvadd (_ bv2147483647 32) (bvneg .cse400))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse401 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse402 .cse403)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse401)))) (bvsge .cse397 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse400)))))))) (bvsle .cse399 (bvadd (_ bv2147483647 32) (bvneg .cse398)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse410 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse406 (bvadd .cse7 c_~csum~0 .cse410))) (let ((.cse408 ((_ sign_extend 32) .cse406)) (.cse411 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse409 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse404 (bvadd c_~csum~0 .cse409 .cse410)) (.cse405 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse407 (bvadd .cse409 c_~bsum~0))) (and (bvsle .cse404 (bvadd (bvneg .cse405) (_ bv2147483647 32))) (bvsle .cse406 (bvadd (_ bv2147483647 32) (bvneg .cse407))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse404) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse405)))) (bvsge .cse408 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse407)))))))) (bvsge .cse408 (bvadd (bvneg ((_ sign_extend 32) .cse411)) (_ bv18446744071562067968 64))) (bvsle .cse406 (bvadd (_ bv2147483647 32) (bvneg .cse411)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse414 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse413 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse412 ((_ sign_extend 32) .cse414))) (and (bvsge .cse412 (bvadd (bvneg ((_ sign_extend 32) .cse413)) (_ bv18446744071562067968 64))) (bvsle .cse414 (bvadd (_ bv2147483647 32) (bvneg .cse413))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse415 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse416 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse417 ((_ sign_extend 32) .cse415))) (and (bvsle .cse415 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse416 (_ bv0 32)) (bvsge .cse417 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse416 (_ bv0 32)) (bvsle .cse415 (_ bv0 32)) (bvsge .cse412 (bvadd (_ bv18446744071562067968 64) (bvneg .cse417))))))))))))) (= c_~csum~0 (bvadd c_~asum~0 c_~bsum~0))) is different from false Killed by 15