./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 17:18:41,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 17:18:41,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 17:18:41,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 17:18:41,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 17:18:41,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 17:18:41,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 17:18:41,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 17:18:41,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 17:18:41,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 17:18:41,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 17:18:41,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 17:18:41,727 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 17:18:41,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 17:18:41,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 17:18:41,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:18:41,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 17:18:41,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:18:41,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 17:18:41,730 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 17:18:41,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 17:18:41,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 17:18:41,731 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 17:18:41,731 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 17:18:41,731 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/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 [2025-04-24 17:18:42,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 17:18:42,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 17:18:42,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 17:18:42,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 17:18:42,018 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 17:18:42,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 17:18:43,318 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aad81cfcf/e525a6b4c3ce4f008ef909816ac2b6c5/FLAGf92a118a6 [2025-04-24 17:18:43,482 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 17:18:43,483 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 17:18:43,488 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aad81cfcf/e525a6b4c3ce4f008ef909816ac2b6c5/FLAGf92a118a6 [2025-04-24 17:18:44,368 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aad81cfcf/e525a6b4c3ce4f008ef909816ac2b6c5 [2025-04-24 17:18:44,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 17:18:44,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 17:18:44,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 17:18:44,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 17:18:44,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 17:18:44,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3682c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44, skipping insertion in model container [2025-04-24 17:18:44,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 17:18:44,517 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 17:18:44,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:18:44,537 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 17:18:44,557 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 17:18:44,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:18:44,574 INFO L204 MainTranslator]: Completed translation [2025-04-24 17:18:44,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44 WrapperNode [2025-04-24 17:18:44,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 17:18:44,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 17:18:44,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 17:18:44,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 17:18:44,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,608 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-04-24 17:18:44,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 17:18:44,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 17:18:44,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 17:18:44,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 17:18:44,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 17:18:44,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 17:18:44,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 17:18:44,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 17:18:44,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (1/1) ... [2025-04-24 17:18:44,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:18:44,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:18:44,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 17:18:44,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 17:18:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 17:18:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 17:18:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 17:18:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 17:18:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 17:18:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 17:18:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 17:18:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 17:18:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 17:18:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 17:18:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 17:18:44,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 17:18:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 17:18:44,708 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 17:18:44,788 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 17:18:44,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 17:18:45,211 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 17:18:45,213 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 17:18:45,526 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 17:18:45,527 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 17:18:45,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:18:45 BoogieIcfgContainer [2025-04-24 17:18:45,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 17:18:45,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 17:18:45,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 17:18:45,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 17:18:45,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 05:18:44" (1/3) ... [2025-04-24 17:18:45,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e043489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:18:45, skipping insertion in model container [2025-04-24 17:18:45,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:18:44" (2/3) ... [2025-04-24 17:18:45,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e043489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:18:45, skipping insertion in model container [2025-04-24 17:18:45,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:18:45" (3/3) ... [2025-04-24 17:18:45,537 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 17:18:45,547 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 17:18:45,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-24 17:18:45,550 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 17:18:45,630 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 17:18:45,660 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:18:45,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 17:18:45,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:18:45,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 17:18:45,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 17:18:45,739 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 17:18:45,751 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 17:18:45,757 INFO L340 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;@570544a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:18:45,757 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 17:18:45,847 INFO L403 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-04-24 17:18:45,847 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:18:45,848 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #1 [2025-04-24 17:18:45,848 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:18:45,848 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:18:45,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:18:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash -101807487, now seen corresponding path program 1 times [2025-04-24 17:18:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:18:45,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062536989] [2025-04-24 17:18:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:18:45,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 17:18:45,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 17:18:45,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:18:46,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:18:46,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062536989] [2025-04-24 17:18:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062536989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:18:46,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:18:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 17:18:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012431965] [2025-04-24 17:18:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:18:46,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 17:18:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:18:46,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 17:18:46,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 17:18:46,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:46,305 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:18:46,306 INFO L486 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-04-24 17:18:46,306 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:46,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:46,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 17:18:46,388 INFO L403 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-04-24 17:18:46,388 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:18:46,388 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #2 [2025-04-24 17:18:46,388 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:18:46,388 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:18:46,388 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,389 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 17:18:46,389 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,389 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 17:18:46,392 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,392 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:18:46,393 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,393 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:18:46,393 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,393 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-24 17:18:46,393 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,393 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 17:18:46,394 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,394 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 17:18:46,394 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,394 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:18:46,394 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:18:46,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:18:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1139583931, now seen corresponding path program 1 times [2025-04-24 17:18:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:18:46,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221148398] [2025-04-24 17:18:46,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:18:46,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 17:18:46,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 17:18:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:18:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:18:46,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221148398] [2025-04-24 17:18:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221148398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:18:46,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:18:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 17:18:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424722135] [2025-04-24 17:18:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:18:46,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:18:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:18:46,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:18:46,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:18:46,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:46,599 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:18:46,599 INFO L486 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-04-24 17:18:46,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:46,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:46,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:46,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:46,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 17:18:46,695 INFO L403 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-04-24 17:18:46,695 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:18:46,695 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #3 [2025-04-24 17:18:46,695 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:18:46,695 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:18:46,695 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,695 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 17:18:46,695 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,695 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:18:46,695 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,695 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:18:46,695 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,695 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:18:46,695 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,696 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 17:18:46,696 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,696 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 17:18:46,696 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:18:46,696 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 17:18:46,696 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:18:46,696 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:18:46,696 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:18:46,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:18:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash -419710619, now seen corresponding path program 1 times [2025-04-24 17:18:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:18:46,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323724282] [2025-04-24 17:18:46,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:18:46,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 17:18:46,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 17:18:46,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:18:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:18:46,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323724282] [2025-04-24 17:18:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323724282] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:46,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499226784] [2025-04-24 17:18:46,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:18:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:18:46,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:18:46,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 17:18:46,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 17:18:46,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 17:18:46,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:46,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:46,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 17:18:46,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:18:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:18:47,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:18:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:18:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499226784] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:18:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-24 17:18:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184762379] [2025-04-24 17:18:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:18:47,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:18:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:18:47,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:18:47,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-24 17:18:47,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:47,117 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:18:47,117 INFO L486 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-04-24 17:18:47,118 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:47,118 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,118 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:47,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:47,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-24 17:18:47,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-24 17:18:47,422 INFO L403 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-04-24 17:18:47,422 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:18:47,422 INFO L139 ounterexampleChecker]: Examining path program with hash -933235391, occurence #1 [2025-04-24 17:18:47,422 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:18:47,422 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:18:47,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:18:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1978403039, now seen corresponding path program 1 times [2025-04-24 17:18:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:18:47,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890616239] [2025-04-24 17:18:47,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:18:47,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 17:18:47,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 17:18:47,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:47,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:18:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:18:47,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890616239] [2025-04-24 17:18:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890616239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:47,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854757629] [2025-04-24 17:18:47,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:47,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:18:47,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:18:47,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:18:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 17:18:47,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 17:18:47,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 17:18:47,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:47,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:47,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 17:18:47,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:18:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:18:47,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:18:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:18:47,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854757629] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:47,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:18:47,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-24 17:18:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644727729] [2025-04-24 17:18:47,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:18:47,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:18:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:18:47,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:18:47,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-24 17:18:47,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:47,732 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:18:47,732 INFO L486 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-04-24 17:18:47,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:47,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:47,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:47,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:47,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 17:18:48,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:18:48,034 INFO L403 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-04-24 17:18:48,034 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:18:48,034 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #1 [2025-04-24 17:18:48,034 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:18:48,034 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:18:48,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:18:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1275471846, now seen corresponding path program 1 times [2025-04-24 17:18:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:18:48,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909410850] [2025-04-24 17:18:48,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:18:48,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 17:18:48,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 17:18:48,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:48,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:18:48,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:18:48,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909410850] [2025-04-24 17:18:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909410850] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:48,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32832939] [2025-04-24 17:18:48,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:48,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:18:48,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:18:48,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:18:48,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 17:18:48,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 17:18:48,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 17:18:48,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:48,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:48,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 17:18:48,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:18:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:18:48,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:18:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:18:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32832939] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:48,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:18:48,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-24 17:18:48,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594811309] [2025-04-24 17:18:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:18:48,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:18:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:18:48,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:18:48,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-24 17:18:48,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:48,332 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:18:48,332 INFO L486 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-04-24 17:18:48,332 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:48,332 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,332 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,332 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,332 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:18:48,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:18:48,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:18:48,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-24 17:18:48,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:18:48,659 INFO L403 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-04-24 17:18:48,659 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:18:48,659 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #1 [2025-04-24 17:18:48,659 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:18:48,659 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:18:48,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:18:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash -922807690, now seen corresponding path program 1 times [2025-04-24 17:18:48,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:18:48,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728452717] [2025-04-24 17:18:48,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:18:48,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 17:18:48,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 17:18:48,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:48,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:18:49,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:18:49,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728452717] [2025-04-24 17:18:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728452717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:18:49,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988550969] [2025-04-24 17:18:49,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:18:49,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:18:49,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:18:49,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:18:49,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 17:18:50,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 17:18:50,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 17:18:50,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:18:50,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:18:50,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-24 17:18:50,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:18:50,279 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:18:50,280 INFO L354 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-04-24 17:18:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:18:50,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:19:18,450 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:19:18,450 INFO L354 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-04-24 17:19:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:19:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988550969] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:19:18,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:19:18,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2025-04-24 17:19:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331497105] [2025-04-24 17:19:18,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:19:18,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-24 17:19:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:19:18,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-24 17:19:18,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=480, Unknown=6, NotChecked=0, Total=600 [2025-04-24 17:19:18,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:18,798 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:19:18,798 INFO L486 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-04-24 17:19:18,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:18,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:18,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:18,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:18,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:18,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:19,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-24 17:19:19,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-24 17:19:19,527 INFO L403 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-04-24 17:19:19,527 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:19:19,527 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #2 [2025-04-24 17:19:19,527 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:19:19,528 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 17:19:19,528 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:19:19,528 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:19:19,528 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:19:19,528 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 17:19:19,528 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:19:19,528 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:19,528 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 17:19:19,528 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:19,528 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:19:19,528 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:19:19,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:19:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1458381414, now seen corresponding path program 2 times [2025-04-24 17:19:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:19:19,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76504754] [2025-04-24 17:19:19,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:19:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:19:19,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:19:19,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:19:19,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:19:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:19:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:19:19,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76504754] [2025-04-24 17:19:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76504754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:19,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302231674] [2025-04-24 17:19:19,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:19:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:19:19,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:19:19,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 17:19:19,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:19:19,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:19:19,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:19:19,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:19,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 17:19:19,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:19:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:19:19,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:19:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 17:19:19,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302231674] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:19,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:19:19,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2025-04-24 17:19:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231921365] [2025-04-24 17:19:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:19:19,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:19:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:19:19,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:19:19,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-24 17:19:19,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:19,843 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:19:19,843 INFO L486 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-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:19,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:20,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:20,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:20,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:20,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-24 17:19:20,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:20,208 INFO L403 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-04-24 17:19:20,208 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:19:20,208 INFO L139 ounterexampleChecker]: Examining path program with hash 817181991, occurence #1 [2025-04-24 17:19:20,208 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:19:20,208 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:19:20,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:19:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2084796771, now seen corresponding path program 3 times [2025-04-24 17:19:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:19:20,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949896517] [2025-04-24 17:19:20,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:19:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:19:20,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:19:20,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:19:20,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 17:19:20,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:19:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:19:20,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949896517] [2025-04-24 17:19:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949896517] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:20,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958227649] [2025-04-24 17:19:20,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:19:20,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:19:20,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:19:20,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 17:19:20,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:19:20,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:19:20,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 17:19:20,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:20,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 17:19:20,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:19:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:19:20,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:19:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 17:19:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958227649] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:20,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:19:20,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 14 [2025-04-24 17:19:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157345877] [2025-04-24 17:19:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:19:20,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:19:20,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:19:20,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:19:20,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-24 17:19:20,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:20,527 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:19:20,527 INFO L486 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-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:20,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:20,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:20,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:20,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-24 17:19:20,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-24 17:19:20,879 INFO L403 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-04-24 17:19:20,879 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:19:20,880 INFO L139 ounterexampleChecker]: Examining path program with hash 1575774055, occurence #1 [2025-04-24 17:19:20,880 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:19:20,880 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:19:20,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:19:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash -100311006, now seen corresponding path program 4 times [2025-04-24 17:19:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:19:20,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398984365] [2025-04-24 17:19:20,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 17:19:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:19:20,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:19:20,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:19:20,920 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 17:19:20,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 17:19:20,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:19:20,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398984365] [2025-04-24 17:19:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398984365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:20,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876049671] [2025-04-24 17:19:20,975 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 17:19:20,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:19:20,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:19:20,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-24 17:19:21,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:19:21,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:19:21,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 17:19:21,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:21,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 17:19:21,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:19:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:19:21,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:19:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-24 17:19:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876049671] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:19:21,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:19:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-04-24 17:19:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022487337] [2025-04-24 17:19:21,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:19:21,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-24 17:19:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:19:21,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-24 17:19:21,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-24 17:19:21,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:21,148 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:19:21,148 INFO L486 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-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:21,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:21,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:21,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:21,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:21,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:21,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:19:21,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-24 17:19:21,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:21,565 INFO L403 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-04-24 17:19:21,565 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:19:21,565 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #2 [2025-04-24 17:19:21,566 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:19:21,566 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 17:19:21,566 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:19:21,566 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:19:21,566 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:19:21,566 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:19:21,566 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:21,566 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-24 17:19:21,566 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:21,566 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:19:21,566 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:19:21,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:19:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash -633217275, now seen corresponding path program 5 times [2025-04-24 17:19:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:19:21,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582696948] [2025-04-24 17:19:21,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 17:19:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:19:21,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 17:19:21,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 17:19:21,587 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:19:21,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:19:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:19:21,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582696948] [2025-04-24 17:19:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582696948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:21,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999096863] [2025-04-24 17:19:21,655 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 17:19:21,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:21,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:19:21,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:19:21,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-24 17:19:21,726 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 17:19:21,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 17:19:21,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:19:21,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:21,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:19:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:19:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:19:21,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:19:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:19:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999096863] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:19:21,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:19:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-24 17:19:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338878608] [2025-04-24 17:19:21,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:19:21,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-24 17:19:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:19:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-24 17:19:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-24 17:19:21,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:21,901 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:19:21,901 INFO L486 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-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:19:21,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:22,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:22,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:19:22,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:19:22,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-24 17:19:22,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-24 17:19:22,251 INFO L403 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-04-24 17:19:22,251 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:19:22,251 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #3 [2025-04-24 17:19:22,251 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:19:22,251 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 17:19:22,251 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:19:22,251 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:19:22,251 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 17:19:22,251 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-24 17:19:22,251 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:22,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 17:19:22,251 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:22,251 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:19:22,251 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:19:22,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:19:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash 821773723, now seen corresponding path program 6 times [2025-04-24 17:19:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:19:22,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4597746] [2025-04-24 17:19:22,253 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 17:19:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:19:22,263 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-24 17:19:22,274 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 17:19:22,275 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-24 17:19:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:19:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:19:22,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4597746] [2025-04-24 17:19:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4597746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:22,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678187024] [2025-04-24 17:19:22,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 17:19:22,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:22,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:19:22,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:19:22,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-24 17:19:22,447 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-24 17:19:22,480 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 17:19:22,480 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-24 17:19:22,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:22,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:19:22,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:19:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:19:22,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:19:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:19:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678187024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:19:22,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:19:22,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-24 17:19:22,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079374063] [2025-04-24 17:19:22,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:19:22,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-24 17:19:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:19:22,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-24 17:19:22,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-24 17:19:22,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:22,624 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:19:22,624 INFO L486 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-04-24 17:19:22,624 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:22,624 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,624 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:19:22,625 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:19:22,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:19:22,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:19:22,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:19:22,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-24 17:19:23,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-24 17:19:23,036 INFO L403 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-04-24 17:19:23,036 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:19:23,036 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #3 [2025-04-24 17:19:23,036 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:19:23,036 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 17:19:23,036 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:19:23,036 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:19:23,036 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 17:19:23,036 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 17:19:23,036 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:19:23,036 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-24 17:19:23,036 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:19:23,036 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:19:23,036 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:19:23,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:19:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2102547615, now seen corresponding path program 7 times [2025-04-24 17:19:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:19:23,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836044514] [2025-04-24 17:19:23,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 17:19:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:19:23,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 17:19:23,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 17:19:23,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:19:23,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:19:24,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:19:24,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836044514] [2025-04-24 17:19:24,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836044514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:19:24,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564730682] [2025-04-24 17:19:24,253 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 17:19:24,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:19:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:19:24,255 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:19:24,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-24 17:19:24,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 17:19:24,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 17:19:24,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:19:24,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:19:24,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-24 17:19:24,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:19:24,615 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-24 17:19:24,616 INFO L354 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-04-24 17:19:24,950 INFO L325 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2025-04-24 17:19:24,950 INFO L354 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-04-24 17:19:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-24 17:19:25,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:20:32,520 WARN L849 $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-04-24 17:20:33,362 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:20:33,362 INFO L354 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-04-24 17:21:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2025-04-24 17:21:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564730682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:26,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:21:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 33 [2025-04-24 17:21:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370890700] [2025-04-24 17:21:26,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:26,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-24 17:21:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:21:26,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-24 17:21:26,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=896, Unknown=7, NotChecked=62, Total=1122 [2025-04-24 17:21:26,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:26,421 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:26,421 INFO L486 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-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:26,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:34,555 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-24 17:21:34,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-24 17:21:34,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-24 17:21:34,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:34,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-24 17:21:34,764 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/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:910) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:784) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:372) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) 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:232) 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:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:190) 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:67) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:60) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) 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:338) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:389) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:300) 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:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) 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) ... 58 more [2025-04-24 17:21:34,769 INFO L158 Benchmark]: Toolchain (without parser) took 170397.46ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 92.9MB in the beginning and 196.9MB in the end (delta: -104.1MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2025-04-24 17:21:34,769 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:21:34,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.56ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 78.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 17:21:34,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 75.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:21:34,770 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 17:21:34,770 INFO L158 Benchmark]: RCFGBuilder took 876.68ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 43.2MB in the end (delta: 30.8MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2025-04-24 17:21:34,771 INFO L158 Benchmark]: TraceAbstraction took 169239.09ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 42.5MB in the beginning and 196.9MB in the end (delta: -154.4MB). Peak memory consumption was 158.3MB. Max. memory is 16.1GB. [2025-04-24 17:21:34,772 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.26ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.56ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 78.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 75.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 876.68ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 43.2MB in the end (delta: 30.8MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 169239.09ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 42.5MB in the beginning and 196.9MB in the end (delta: -154.4MB). Peak memory consumption was 158.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 17:21:36,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 17:21:36,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-04-24 17:21:36,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 17:21:36,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 17:21:36,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 17:21:36,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 17:21:36,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 17:21:36,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 17:21:36,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 17:21:36,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 17:21:36,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 17:21:36,485 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 17:21:36,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 17:21:36,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 17:21:36,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:21:36,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:21:36,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:21:36,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:21:36,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 17:21:36,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:21:36,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:21:36,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:21:36,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 17:21:36,489 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 17:21:36,489 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/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 [2025-04-24 17:21:36,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 17:21:36,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 17:21:36,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 17:21:36,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 17:21:36,739 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 17:21:36,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 17:21:38,119 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8749592f5/2b686054910e450dba27cff3b93f0790/FLAG1e7c02343 [2025-04-24 17:21:38,299 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 17:21:38,300 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 17:21:38,307 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8749592f5/2b686054910e450dba27cff3b93f0790/FLAG1e7c02343 [2025-04-24 17:21:39,120 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8749592f5/2b686054910e450dba27cff3b93f0790 [2025-04-24 17:21:39,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 17:21:39,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 17:21:39,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 17:21:39,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 17:21:39,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 17:21:39,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de188fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39, skipping insertion in model container [2025-04-24 17:21:39,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 17:21:39,338 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 17:21:39,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:21:39,370 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 17:21:39,404 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-24 17:21:39,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:21:39,428 INFO L204 MainTranslator]: Completed translation [2025-04-24 17:21:39,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39 WrapperNode [2025-04-24 17:21:39,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 17:21:39,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 17:21:39,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 17:21:39,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 17:21:39,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,481 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 238 [2025-04-24 17:21:39,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 17:21:39,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 17:21:39,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 17:21:39,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 17:21:39,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 17:21:39,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 17:21:39,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 17:21:39,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 17:21:39,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (1/1) ... [2025-04-24 17:21:39,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:21:39,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:39,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 17:21:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 17:21:39,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 17:21:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 17:21:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 17:21:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 17:21:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 17:21:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-04-24 17:21:39,591 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 17:21:39,680 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 17:21:39,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 17:21:40,088 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 17:21:40,088 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 17:21:40,385 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 17:21:40,387 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 17:21:40,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:21:40 BoogieIcfgContainer [2025-04-24 17:21:40,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 17:21:40,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 17:21:40,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 17:21:40,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 17:21:40,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 05:21:39" (1/3) ... [2025-04-24 17:21:40,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f69d946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:21:40, skipping insertion in model container [2025-04-24 17:21:40,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:21:39" (2/3) ... [2025-04-24 17:21:40,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f69d946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:21:40, skipping insertion in model container [2025-04-24 17:21:40,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:21:40" (3/3) ... [2025-04-24 17:21:40,395 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-24 17:21:40,405 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 17:21:40,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-24 17:21:40,407 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 17:21:40,455 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 17:21:40,484 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:21:40,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 17:21:40,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:40,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 17:21:40,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 17:21:40,562 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 17:21:40,573 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 17:21:40,578 INFO L340 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;@245b8137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:21:40,578 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 17:21:40,884 INFO L403 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-04-24 17:21:40,884 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:40,885 INFO L139 ounterexampleChecker]: Examining path program with hash -2005642007, occurence #1 [2025-04-24 17:21:40,885 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:40,885 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:40,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1414399275, now seen corresponding path program 1 times [2025-04-24 17:21:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:40,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613984284] [2025-04-24 17:21:40,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:40,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:40,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:40,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:40,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 17:21:40,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 17:21:41,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 17:21:41,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:41,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:41,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-24 17:21:41,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:21:41,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 17:21:41,231 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:41,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613984284] [2025-04-24 17:21:41,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613984284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:21:41,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:21:41,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 17:21:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137514593] [2025-04-24 17:21:41,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:21:41,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 17:21:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:41,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 17:21:41,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 17:21:41,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:41,252 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:41,253 INFO L486 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-04-24 17:21:41,253 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:41,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:41,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 17:21:41,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:41,621 INFO L403 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-04-24 17:21:41,621 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:41,621 INFO L139 ounterexampleChecker]: Examining path program with hash -2005642007, occurence #2 [2025-04-24 17:21:41,621 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:21:41,622 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:21:41,622 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:41,622 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 17:21:41,622 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:41,622 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 17:21:41,625 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:41,625 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:21:41,625 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:41,625 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:21:41,625 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:41,625 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-24 17:21:41,625 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:41,626 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 17:21:41,626 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:41,626 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-24 17:21:41,626 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:41,626 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:21:41,626 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:41,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash 897353279, now seen corresponding path program 1 times [2025-04-24 17:21:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:41,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678927848] [2025-04-24 17:21:41,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:41,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:41,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:41,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:41,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 17:21:41,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 17:21:41,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 17:21:41,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:41,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:41,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:21:41,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:21:41,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 17:21:41,824 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:41,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678927848] [2025-04-24 17:21:41,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678927848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:21:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:21:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:21:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908548570] [2025-04-24 17:21:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:21:41,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:21:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:41,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:21:41,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 17:21:41,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:41,826 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:41,827 INFO L486 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-04-24 17:21:41,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:41,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:42,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:42,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:42,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-24 17:21:42,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:42,388 INFO L403 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-04-24 17:21:42,388 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:42,388 INFO L139 ounterexampleChecker]: Examining path program with hash 344834135, occurence #1 [2025-04-24 17:21:42,388 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:42,388 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:42,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1523768636, now seen corresponding path program 1 times [2025-04-24 17:21:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:42,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408681437] [2025-04-24 17:21:42,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:42,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:42,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:42,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 17:21:42,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 17:21:42,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 17:21:42,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:42,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:42,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:21:42,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:21:42,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 17:21:42,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:42,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408681437] [2025-04-24 17:21:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408681437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:21:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:21:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:21:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869695945] [2025-04-24 17:21:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:21:42,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:21:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:42,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:21:42,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 17:21:42,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:42,561 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:42,562 INFO L486 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-04-24 17:21:42,562 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:42,562 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:42,562 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:43,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:43,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-24 17:21:43,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:43,208 INFO L403 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-04-24 17:21:43,208 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:43,208 INFO L139 ounterexampleChecker]: Examining path program with hash -1204864242, occurence #1 [2025-04-24 17:21:43,209 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:43,209 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:43,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -661339141, now seen corresponding path program 1 times [2025-04-24 17:21:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:43,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070720554] [2025-04-24 17:21:43,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:43,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 17:21:43,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 17:21:43,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 17:21:43,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:43,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:21:43,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:21:43,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 17:21:43,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:43,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070720554] [2025-04-24 17:21:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070720554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:21:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:21:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:21:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225665725] [2025-04-24 17:21:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:21:43,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:21:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:43,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:21:43,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 17:21:43,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:43,368 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:43,368 INFO L486 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-04-24 17:21:43,368 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:43,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:43,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:43,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:43,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-24 17:21:44,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:44,086 INFO L403 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-04-24 17:21:44,086 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:44,086 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #1 [2025-04-24 17:21:44,086 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:44,086 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:44,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash -845220294, now seen corresponding path program 1 times [2025-04-24 17:21:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:44,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488702486] [2025-04-24 17:21:44,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:44,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:44,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:44,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 17:21:44,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 17:21:44,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 17:21:44,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:44,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:44,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:21:44,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:21:44,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 17:21:44,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:44,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488702486] [2025-04-24 17:21:44,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488702486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:21:44,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:21:44,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 17:21:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952135923] [2025-04-24 17:21:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:21:44,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 17:21:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:44,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 17:21:44,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 17:21:44,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:44,230 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:44,230 INFO L486 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-04-24 17:21:44,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:44,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:44,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:44,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:44,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-24 17:21:45,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:45,091 INFO L403 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-04-24 17:21:45,092 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:45,092 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #1 [2025-04-24 17:21:45,092 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:45,092 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:45,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2055212688, now seen corresponding path program 1 times [2025-04-24 17:21:45,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:45,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313810145] [2025-04-24 17:21:45,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:45,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:45,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 17:21:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-24 17:21:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-24 17:21:45,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:45,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:45,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 17:21:45,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:21:45,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 17:21:45,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:45,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313810145] [2025-04-24 17:21:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313810145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:21:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:21:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 17:21:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407524268] [2025-04-24 17:21:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:21:45,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:21:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:45,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:21:45,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:21:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:45,248 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:45,249 INFO L486 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-04-24 17:21:45,249 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:45,249 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,249 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,249 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,249 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,249 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:45,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:45,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:45,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:45,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-24 17:21:45,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:45,558 INFO L403 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-04-24 17:21:45,558 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:45,558 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #2 [2025-04-24 17:21:45,558 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:21:45,558 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 17:21:45,558 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:21:45,558 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:21:45,558 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:21:45,558 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-24 17:21:45,558 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:45,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:21:45,558 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:45,558 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:21:45,558 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:45,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 564259304, now seen corresponding path program 1 times [2025-04-24 17:21:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:45,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540275702] [2025-04-24 17:21:45,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:21:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:45,561 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:45,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-24 17:21:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 17:21:45,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 17:21:45,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:21:45,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:45,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-24 17:21:45,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:46,162 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:21:46,164 INFO L354 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-04-24 17:21:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:46,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:21:46,479 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:21:46,480 INFO L354 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-04-24 17:21:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:47,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:47,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540275702] [2025-04-24 17:21:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540275702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:47,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:21:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-04-24 17:21:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075186155] [2025-04-24 17:21:47,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:47,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-24 17:21:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-24 17:21:47,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-24 17:21:47,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:47,677 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:47,677 INFO L486 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-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:47,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:48,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:48,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:48,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:48,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-24 17:21:48,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:48,650 INFO L403 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-04-24 17:21:48,650 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:48,650 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #3 [2025-04-24 17:21:48,650 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:21:48,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:21:48,651 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:48,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 17:21:48,651 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:48,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:21:48,651 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:48,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:21:48,651 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:48,651 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:21:48,652 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:48,652 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 17:21:48,652 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:48,652 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:21:48,652 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:48,652 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 17:21:48,652 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:48,652 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:21:48,652 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:48,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash 312817954, now seen corresponding path program 2 times [2025-04-24 17:21:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:48,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67641639] [2025-04-24 17:21:48,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:21:48,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:48,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:48,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-24 17:21:48,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:21:48,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:21:48,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:21:48,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:48,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 17:21:48,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:48,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:21:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:48,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:48,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67641639] [2025-04-24 17:21:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67641639] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:48,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:21:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 17:21:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859019021] [2025-04-24 17:21:48,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:48,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 17:21:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:48,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 17:21:48,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 17:21:48,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:48,993 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:48,993 INFO L486 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-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:48,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:49,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-24 17:21:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-24 17:21:50,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:50,083 INFO L403 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-04-24 17:21:50,083 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:50,083 INFO L139 ounterexampleChecker]: Examining path program with hash 1912357603, occurence #1 [2025-04-24 17:21:50,083 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:50,083 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:50,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 939233311, now seen corresponding path program 3 times [2025-04-24 17:21:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:50,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598676787] [2025-04-24 17:21:50,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 17:21:50,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:50,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:50,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:50,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-24 17:21:50,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:21:50,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:21:50,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 17:21:50,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:50,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 17:21:50,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:50,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:21:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:50,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:50,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598676787] [2025-04-24 17:21:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598676787] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:50,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:21:50,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 17:21:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470833392] [2025-04-24 17:21:50,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:50,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 17:21:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:50,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 17:21:50,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 17:21:50,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:50,414 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:50,415 INFO L486 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-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-24 17:21:50,415 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:51,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:51,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:51,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-24 17:21:51,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:51,911 INFO L403 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-04-24 17:21:51,911 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:51,911 INFO L139 ounterexampleChecker]: Examining path program with hash 1304145205, occurence #1 [2025-04-24 17:21:51,911 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:21:51,911 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:51,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1245874466, now seen corresponding path program 4 times [2025-04-24 17:21:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:51,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107137973] [2025-04-24 17:21:51,912 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 17:21:51,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:51,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:51,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-24 17:21:51,963 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:21:52,002 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:21:52,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 17:21:52,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:52,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 17:21:52,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:52,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:21:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:21:52,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:52,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107137973] [2025-04-24 17:21:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107137973] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:52,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:21:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 17:21:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925238917] [2025-04-24 17:21:52,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:52,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 17:21:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 17:21:52,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 17:21:52,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:52,229 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:52,229 INFO L486 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-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:52,229 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:53,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:53,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:53,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-24 17:21:53,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:53,766 INFO L403 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-04-24 17:21:53,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:53,766 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #2 [2025-04-24 17:21:53,766 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:21:53,766 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 17:21:53,766 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:21:53,766 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:21:53,766 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:21:53,766 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:21:53,766 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:53,766 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-24 17:21:53,766 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:53,766 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:21:53,766 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:53,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1785946185, now seen corresponding path program 5 times [2025-04-24 17:21:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:53,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670990424] [2025-04-24 17:21:53,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 17:21:53,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:53,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:53,768 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:53,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-24 17:21:53,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 17:21:53,887 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 17:21:53,887 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:21:53,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:53,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-24 17:21:53,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:21:53,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:21:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-24 17:21:54,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:54,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670990424] [2025-04-24 17:21:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670990424] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:54,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:21:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 17:21:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623079689] [2025-04-24 17:21:54,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:54,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 17:21:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:54,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 17:21:54,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-24 17:21:54,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:54,078 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:54,078 INFO L486 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-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:54,078 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:54,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:54,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:21:54,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-24 17:21:54,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:54,657 INFO L403 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-04-24 17:21:54,657 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:54,657 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #3 [2025-04-24 17:21:54,657 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:21:54,657 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 17:21:54,657 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:21:54,657 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:21:54,657 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 17:21:54,657 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-24 17:21:54,657 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:54,657 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 17:21:54,657 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:54,657 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:21:54,657 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:54,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash -731946273, now seen corresponding path program 6 times [2025-04-24 17:21:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:54,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268099047] [2025-04-24 17:21:54,658 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-24 17:21:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:54,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:54,659 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:54,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-24 17:21:54,711 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-24 17:21:54,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 17:21:54,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-24 17:21:54,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:21:54,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-24 17:21:54,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:21:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-24 17:21:54,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:21:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-24 17:21:54,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 17:21:54,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268099047] [2025-04-24 17:21:54,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268099047] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:21:54,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-24 17:21:54,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-24 17:21:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777529786] [2025-04-24 17:21:54,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-24 17:21:54,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 17:21:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 17:21:54,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 17:21:54,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-24 17:21:54,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:54,971 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:21:54,971 INFO L486 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-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:21:54,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:21:56,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 17:21:56,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:56,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:56,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:56,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 17:21:56,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-24 17:21:56,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-24 17:21:56,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:56,692 INFO L403 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-04-24 17:21:56,692 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:21:56,692 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #4 [2025-04-24 17:21:56,692 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:21:56,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 17:21:56,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:21:56,692 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-24 17:21:56,692 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 17:21:56,692 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-24 17:21:56,692 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:21:56,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-24 17:21:56,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:21:56,692 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:21:56,692 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:21:56,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:21:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1271740043, now seen corresponding path program 7 times [2025-04-24 17:21:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 17:21:56,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579763067] [2025-04-24 17:21:56,693 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-24 17:21:56,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:21:56,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:21:56,694 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:21:56,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-24 17:21:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 17:23:14,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 17:23:14,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:23:14,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:23:14,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-24 17:23:14,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:23:14,871 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-24 17:23:14,872 INFO L354 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-04-24 17:23:17,713 INFO L325 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2025-04-24 17:23:17,714 INFO L354 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-04-24 17:27:19,785 WARN L849 $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 ((.cse12 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse10 (bvadd .cse7 c_~csum~0 .cse12))) (let ((.cse9 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse8 ((_ sign_extend 32) .cse10))) (and (bvsge .cse8 (bvadd (bvneg ((_ sign_extend 32) .cse9)) (_ bv18446744071562067968 64))) (bvsle .cse10 (bvadd (_ bv2147483647 32) (bvneg .cse9))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse16 (bvadd .cse11 c_~bsum~0))) (let ((.cse13 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse15 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse14 ((_ sign_extend 32) .cse16))) (and (bvsle (bvadd c_~csum~0 .cse11 .cse12) (bvadd (bvneg .cse13) (_ bv2147483647 32))) (bvsge .cse13 (_ bv0 32)) (bvsge .cse14 .cse15) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse15) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse16 (_ bv0 32)) (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse14))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse22 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse23 (bvadd .cse7 c_~csum~0 .cse22))) (let ((.cse17 ((_ sign_extend 32) .cse23)) (.cse18 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse17 (bvadd (bvneg ((_ sign_extend 32) .cse18)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse21 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse19 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse20 (bvadd .cse21 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse19 (_ bv0 32)) (bvsle .cse20 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse21 .cse22)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse19)))) (bvsge .cse17 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse20)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse23 (bvadd (_ bv2147483647 32) (bvneg .cse18)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse28 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse24 ((_ sign_extend 32) .cse28)) (.cse25 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse24 (bvadd (bvneg ((_ sign_extend 32) .cse25)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse26 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse27 ((_ sign_extend 32) .cse26))) (and (bvsle .cse26 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse27 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse26 (_ bv0 32)) (bvsge .cse24 (bvadd (_ bv18446744071562067968 64) (bvneg .cse27))))))) (bvsle .cse28 (bvadd (_ bv2147483647 32) (bvneg .cse25))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse37 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse38 (bvadd .cse7 c_~csum~0 .cse37))) (let ((.cse29 ((_ sign_extend 32) .cse38)) (.cse30 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse29 (bvadd (bvneg ((_ sign_extend 32) .cse30)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse36 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse35 (bvadd .cse36 c_~bsum~0))) (let ((.cse34 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse31 (bvadd c_~csum~0 .cse36 .cse37)) (.cse32 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse33 ((_ sign_extend 32) .cse35))) (and (bvsle .cse31 (bvadd (bvneg .cse32) (_ bv2147483647 32))) (bvsge .cse33 .cse34) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse34) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse35 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse31) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse32)))) (bvsge .cse29 (bvadd (_ bv18446744071562067968 64) (bvneg .cse33)))))))) (bvsle .cse38 (bvadd (_ bv2147483647 32) (bvneg .cse30)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse44 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse39 ((_ sign_extend 32) .cse44)) (.cse40 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse39 (bvadd (bvneg ((_ sign_extend 32) .cse40)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse43 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse41 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse42 ((_ sign_extend 32) .cse43))) (and (bvsge .cse41 (_ bv0 32)) (bvsge .cse42 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse41 (_ bv0 32)) (bvsle .cse43 (_ bv0 32)) (bvsge .cse39 (bvadd (_ bv18446744071562067968 64) (bvneg .cse42))))))) (bvsle .cse44 (bvadd (_ bv2147483647 32) (bvneg .cse40))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse46 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse48 (bvadd .cse7 c_~csum~0 .cse46))) (let ((.cse49 ((_ sign_extend 32) .cse48)) (.cse50 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse45 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse47 (bvadd .cse45 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse45 .cse46) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse47 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse48 (bvadd (_ bv2147483647 32) (bvneg .cse47))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse49 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse47)))))))) (bvsge .cse49 (bvadd (bvneg ((_ sign_extend 32) .cse50)) (_ bv18446744071562067968 64))) (bvsle .cse48 (bvadd (_ bv2147483647 32) (bvneg .cse50)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse53 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse51 ((_ sign_extend 32) .cse53)) (.cse52 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse51 (bvadd (bvneg ((_ sign_extend 32) .cse52)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse54 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse53 (bvadd (_ bv2147483647 32) (bvneg .cse54))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse51 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse54)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse52 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse56 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse57 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse55 (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 .cse55 (_ bv0 32)) (bvsge .cse56 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse55)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse56 (bvadd (bvneg ((_ sign_extend 32) .cse57)) (_ bv18446744071562067968 64))) (bvsle .cse57 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse62 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse63 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse62))) (.cse64 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse61 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse58 (bvadd .cse61 c_~bsum~0))) (let ((.cse60 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse59 ((_ sign_extend 32) .cse58))) (and (bvsle .cse58 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse59 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse60 (_ bv0 32)) (bvsle .cse58 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse61 .cse62)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse60)))) (bvsge .cse63 (bvadd (_ bv18446744071562067968 64) (bvneg .cse59)))))))) (bvsge .cse63 (bvadd (bvneg ((_ sign_extend 32) .cse64)) (_ bv18446744071562067968 64))) (bvsle .cse64 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse71 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse68 (bvadd .cse7 c_~csum~0 .cse71))) (let ((.cse69 ((_ sign_extend 32) .cse68)) (.cse72 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse70 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse65 (bvadd c_~csum~0 .cse70 .cse71)) (.cse66 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse67 (bvadd .cse70 c_~bsum~0))) (and (bvsle .cse65 (bvadd (bvneg .cse66) (_ bv2147483647 32))) (bvsle .cse67 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse68 (bvadd (_ bv2147483647 32) (bvneg .cse67))) (bvsge ((_ sign_extend 32) .cse65) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse66)))) (bvsge .cse69 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse67)))))))) (bvsge .cse69 (bvadd (bvneg ((_ sign_extend 32) .cse72)) (_ bv18446744071562067968 64))) (bvsle .cse68 (bvadd (_ bv2147483647 32) (bvneg .cse72)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse80 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse81 (bvadd .cse7 c_~csum~0 .cse80))) (let ((.cse73 ((_ sign_extend 32) .cse81)) (.cse74 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse73 (bvadd (bvneg ((_ sign_extend 32) .cse74)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse79 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse77 (bvadd .cse79 c_~bsum~0))) (let ((.cse75 (bvadd c_~csum~0 .cse79 .cse80)) (.cse76 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse78 ((_ sign_extend 32) .cse77))) (and (bvsle .cse75 (bvadd (bvneg .cse76) (_ bv2147483647 32))) (bvsle .cse77 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse78 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse77 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse75) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse76)))) (bvsge .cse73 (bvadd (_ bv18446744071562067968 64) (bvneg .cse78)))))))) (bvsle .cse81 (bvadd (_ bv2147483647 32) (bvneg .cse74)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse85 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse83 ((_ sign_extend 32) .cse85)) (.cse84 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse82 (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 .cse82 (_ bv0 32)) (bvsge .cse83 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse82)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse83 (bvadd (bvneg ((_ sign_extend 32) .cse84)) (_ bv18446744071562067968 64))) (bvsle .cse85 (bvadd (_ bv2147483647 32) (bvneg .cse84))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse87 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse89 (bvadd .cse7 c_~csum~0 .cse87))) (let ((.cse91 ((_ sign_extend 32) .cse89)) (.cse92 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse86 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse88 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse90 (bvadd .cse86 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse86 .cse87) (bvadd (bvneg .cse88) (_ bv2147483647 32))) (bvsge .cse88 (_ bv0 32)) (bvsle .cse89 (bvadd (_ bv2147483647 32) (bvneg .cse90))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse91 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse90)))))))) (bvsge .cse91 (bvadd (bvneg ((_ sign_extend 32) .cse92)) (_ bv18446744071562067968 64))) (bvsle .cse89 (bvadd (_ bv2147483647 32) (bvneg .cse92)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse94 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse95 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse93 (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 .cse93 (_ bv0 32)) (bvsge .cse94 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse93))))))) (bvsge .cse94 (bvadd (bvneg ((_ sign_extend 32) .cse95)) (_ bv18446744071562067968 64))) (bvsle .cse95 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse97 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse102 (bvadd .cse7 c_~csum~0 .cse97))) (let ((.cse100 ((_ sign_extend 32) .cse102)) (.cse101 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse96 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse98 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse99 (bvadd .cse96 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse96 .cse97) (bvadd (bvneg .cse98) (_ bv2147483647 32))) (bvsge .cse98 (_ bv0 32)) (bvsle .cse99 (_ bv0 32)) (bvsge .cse100 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse99)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse100 (bvadd (bvneg ((_ sign_extend 32) .cse101)) (_ bv18446744071562067968 64))) (bvsle .cse102 (bvadd (_ bv2147483647 32) (bvneg .cse101)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse103 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse104 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse103 (bvadd (bvneg ((_ sign_extend 32) .cse104)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse106 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse105 (_ bv0 32)) (bvsle .cse105 (_ bv0 32)) (bvsle .cse106 (_ bv0 32)) (bvsge .cse103 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse106)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse104 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse111 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse112 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse111))) (.cse113 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse110 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse109 (bvadd .cse110 c_~bsum~0))) (let ((.cse108 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse107 ((_ sign_extend 32) .cse109))) (and (bvsge .cse107 .cse108) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse108) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse109 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse110 .cse111)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse112 (bvadd (_ bv18446744071562067968 64) (bvneg .cse107)))))))) (bvsge .cse112 (bvadd (bvneg ((_ sign_extend 32) .cse113)) (_ bv18446744071562067968 64))) (bvsle .cse113 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse119 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse116 (bvadd .cse7 c_~csum~0 .cse119))) (let ((.cse115 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse114 ((_ sign_extend 32) .cse116))) (and (bvsge .cse114 (bvadd (bvneg ((_ sign_extend 32) .cse115)) (_ bv18446744071562067968 64))) (bvsle .cse116 (bvadd (_ bv2147483647 32) (bvneg .cse115))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse118 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse117 (bvadd .cse118 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse117 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse118 .cse119)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse114 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse117)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse122 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse121 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse120 ((_ sign_extend 32) .cse122))) (and (bvsge .cse120 (bvadd (bvneg ((_ sign_extend 32) .cse121)) (_ bv18446744071562067968 64))) (bvsle .cse122 (bvadd (_ bv2147483647 32) (bvneg .cse121))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse123 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse124 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse125 ((_ sign_extend 32) .cse123))) (and (bvsle .cse123 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse124 (_ bv0 32)) (bvsge .cse125 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse124 (_ bv0 32)) (bvsle .cse123 (_ bv0 32)) (bvsge .cse120 (bvadd (_ bv18446744071562067968 64) (bvneg .cse125))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse128 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse127 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse126 ((_ sign_extend 32) .cse128))) (and (bvsge .cse126 (bvadd (bvneg ((_ sign_extend 32) .cse127)) (_ bv18446744071562067968 64))) (bvsle .cse128 (bvadd (_ bv2147483647 32) (bvneg .cse127))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse129 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse130 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse129 (_ bv0 32)) (bvsle .cse129 (_ bv0 32)) (bvsle .cse130 (_ bv0 32)) (bvsge .cse126 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse130)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse133 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse134 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse131 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse132 ((_ sign_extend 32) .cse131))) (and (bvsle .cse131 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse132 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse131 (_ bv0 32)) (bvsge .cse133 (bvadd (_ bv18446744071562067968 64) (bvneg .cse132))))))) (bvsge .cse133 (bvadd (bvneg ((_ sign_extend 32) .cse134)) (_ bv18446744071562067968 64))) (bvsle .cse134 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse140 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse135 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse140))) (.cse136 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse135 (bvadd (bvneg ((_ sign_extend 32) .cse136)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse139 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse137 (bvadd .cse139 c_~bsum~0))) (let ((.cse138 ((_ sign_extend 32) .cse137))) (and (bvsle .cse137 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse138 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse137 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse139 .cse140)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse135 (bvadd (_ bv18446744071562067968 64) (bvneg .cse138)))))))) (bvsle .cse136 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse147 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse143 (bvadd .cse7 c_~csum~0 .cse147))) (let ((.cse145 ((_ sign_extend 32) .cse143)) (.cse148 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse146 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse141 (bvadd c_~csum~0 .cse146 .cse147)) (.cse142 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse144 (bvadd .cse146 c_~bsum~0))) (and (bvsle .cse141 (bvadd (bvneg .cse142) (_ bv2147483647 32))) (bvsle .cse143 (bvadd (_ bv2147483647 32) (bvneg .cse144))) (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) .cse141) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse142)))) (bvsge .cse145 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse144)))))))) (bvsge .cse145 (bvadd (bvneg ((_ sign_extend 32) .cse148)) (_ bv18446744071562067968 64))) (bvsle .cse148 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse153 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse156 (bvadd .cse7 c_~csum~0 .cse153))) (let ((.cse154 ((_ sign_extend 32) .cse156)) (.cse155 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse152 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse149 (bvadd .cse152 c_~bsum~0))) (let ((.cse151 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse150 ((_ sign_extend 32) .cse149))) (and (bvsle .cse149 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse150 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse151 (_ bv0 32)) (bvsle .cse149 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse152 .cse153)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse151)))) (bvsge .cse154 (bvadd (_ bv18446744071562067968 64) (bvneg .cse150)))))))) (bvsge .cse154 (bvadd (bvneg ((_ sign_extend 32) .cse155)) (_ bv18446744071562067968 64))) (bvsle .cse156 (bvadd (_ bv2147483647 32) (bvneg .cse155)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse161 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse157 ((_ sign_extend 32) .cse161)) (.cse158 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse157 (bvadd (bvneg ((_ sign_extend 32) .cse158)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse160 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse159 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse159 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse160 (_ bv0 32)) (bvsle .cse161 (bvadd (_ bv2147483647 32) (bvneg .cse159))) (bvsle .cse160 (_ bv0 32)) (bvsge .cse157 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse159))))))) (bvsle .cse158 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse169 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse162 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse169))) (.cse163 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse162 (bvadd (bvneg ((_ sign_extend 32) .cse163)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse168 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse166 (bvadd .cse168 c_~bsum~0))) (let ((.cse164 (bvadd c_~csum~0 .cse168 .cse169)) (.cse165 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse167 ((_ sign_extend 32) .cse166))) (and (bvsle .cse164 (bvadd (bvneg .cse165) (_ bv2147483647 32))) (bvsle .cse166 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse167 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse166 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse164) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse165)))) (bvsge .cse162 (bvadd (_ bv18446744071562067968 64) (bvneg .cse167)))))))) (bvsle .cse163 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse174 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse170 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse174))) (.cse171 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse170 (bvadd (bvneg ((_ sign_extend 32) .cse171)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse173 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse172 (bvadd .cse173 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse172 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse173 .cse174)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse170 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse172)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse171 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse182 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse177 (bvadd .cse7 c_~csum~0 .cse182))) (let ((.cse176 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse175 ((_ sign_extend 32) .cse177))) (and (bvsge .cse175 (bvadd (bvneg ((_ sign_extend 32) .cse176)) (_ bv18446744071562067968 64))) (bvsle .cse177 (bvadd (_ bv2147483647 32) (bvneg .cse176))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse181 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse178 (bvadd c_~csum~0 .cse181 .cse182)) (.cse179 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse180 (bvadd .cse181 c_~bsum~0))) (and (bvsle .cse178 (bvadd (bvneg .cse179) (_ bv2147483647 32))) (bvsle .cse180 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse178) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse179)))) (bvsge .cse175 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse180)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse185 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse184 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse183 ((_ sign_extend 32) .cse185))) (and (bvsge .cse183 (bvadd (bvneg ((_ sign_extend 32) .cse184)) (_ bv18446744071562067968 64))) (bvsle .cse184 (_ bv0 32)) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse186 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse185 (bvadd (_ bv2147483647 32) (bvneg .cse186))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse183 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse186))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse190 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse187 ((_ sign_extend 32) .cse190)) (.cse188 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse187 (bvadd (bvneg ((_ sign_extend 32) .cse188)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse189 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse191 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse189 (_ bv0 32)) (bvsle .cse190 (bvadd (_ bv2147483647 32) (bvneg .cse191))) (bvsle .cse189 (_ bv0 32)) (bvsge .cse187 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse191)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse190 (bvadd (_ bv2147483647 32) (bvneg .cse188))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse193 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse194 ((_ sign_extend 32) .cse193)) (.cse195 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse192 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse192 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse193 (bvadd (_ bv2147483647 32) (bvneg .cse192))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse194 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse192))))))) (bvsge .cse194 (bvadd (bvneg ((_ sign_extend 32) .cse195)) (_ bv18446744071562067968 64))) (bvsle .cse195 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse197 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse200 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse197))) (.cse201 (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 ((.cse198 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse199 (bvadd .cse196 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse196 .cse197) (bvadd (bvneg .cse198) (_ bv2147483647 32))) (bvsge .cse198 (_ bv0 32)) (bvsle .cse199 (_ bv0 32)) (bvsge .cse200 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse199)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse200 (bvadd (bvneg ((_ sign_extend 32) .cse201)) (_ bv18446744071562067968 64))) (bvsle .cse201 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse203 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse204 (bvadd .cse7 c_~csum~0 .cse203))) (let ((.cse206 ((_ sign_extend 32) .cse204)) (.cse207 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse202 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse205 (bvadd .cse202 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse202 .cse203) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse204 (bvadd (_ bv2147483647 32) (bvneg .cse205))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse206 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse205)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse206 (bvadd (bvneg ((_ sign_extend 32) .cse207)) (_ bv18446744071562067968 64))) (bvsle .cse207 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse213 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse210 (bvadd .cse7 c_~csum~0 .cse213))) (let ((.cse208 ((_ sign_extend 32) .cse210)) (.cse209 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse208 (bvadd (bvneg ((_ sign_extend 32) .cse209)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse212 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse211 (bvadd .cse212 c_~bsum~0))) (and (bvsle .cse210 (bvadd (_ bv2147483647 32) (bvneg .cse211))) (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 .cse212 .cse213)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse208 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse211)))))))) (bvsle .cse209 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse218 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse214 ((_ sign_extend 32) .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 ((.cse216 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse217 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse216 (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse216 (_ bv0 32)) (bvsle .cse217 (_ bv0 32)) (bvsge .cse214 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse217)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse218 (bvadd (_ bv2147483647 32) (bvneg .cse215))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse221 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse219 ((_ sign_extend 32) .cse221)) (.cse220 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse219 (bvadd (bvneg ((_ sign_extend 32) .cse220)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse222 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse221 (bvadd (_ bv2147483647 32) (bvneg .cse222))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse219 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse222)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse220 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse229 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse223 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse229))) (.cse224 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse223 (bvadd (bvneg ((_ sign_extend 32) .cse224)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse228 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse225 (bvadd c_~csum~0 .cse228 .cse229)) (.cse226 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse227 (bvadd .cse228 c_~bsum~0))) (and (bvsle .cse225 (bvadd (bvneg .cse226) (_ bv2147483647 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 .cse227 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse225) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse226)))) (bvsge .cse223 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse227)))))))) (bvsle .cse224 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse231 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse232 ((_ sign_extend 32) .cse231)) (.cse233 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse230 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse230 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse231 (bvadd (_ bv2147483647 32) (bvneg .cse230))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse232 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse230))))))) (bvsge .cse232 (bvadd (bvneg ((_ sign_extend 32) .cse233)) (_ bv18446744071562067968 64))) (bvsle .cse231 (bvadd (_ bv2147483647 32) (bvneg .cse233))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse240 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse234 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse240))) (.cse235 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse234 (bvadd (bvneg ((_ sign_extend 32) .cse235)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse239 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse236 (bvadd c_~csum~0 .cse239 .cse240)) (.cse237 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse238 (bvadd .cse239 c_~bsum~0))) (and (bvsle .cse236 (bvadd (bvneg .cse237) (_ bv2147483647 32))) (bvsle .cse238 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse236) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse237)))) (bvsge .cse234 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse238)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse235 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse243 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse242 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse241 ((_ sign_extend 32) .cse243))) (and (bvsge .cse241 (bvadd (bvneg ((_ sign_extend 32) .cse242)) (_ bv18446744071562067968 64))) (bvsle .cse243 (bvadd (_ bv2147483647 32) (bvneg .cse242))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse245 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse244 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse244 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse245 (_ bv0 32)) (bvsle .cse243 (bvadd (_ bv2147483647 32) (bvneg .cse244))) (bvsle .cse245 (_ bv0 32)) (bvsge .cse241 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse244))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse250 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse253 (bvadd .cse7 c_~csum~0 .cse250))) (let ((.cse251 ((_ sign_extend 32) .cse253)) (.cse252 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse249 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse248 (bvadd .cse249 c_~bsum~0))) (let ((.cse247 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse246 ((_ sign_extend 32) .cse248))) (and (bvsge .cse246 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse247 (_ bv0 32)) (bvsle .cse248 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse249 .cse250)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse247)))) (bvsge .cse251 (bvadd (_ bv18446744071562067968 64) (bvneg .cse246)))))))) (bvsge .cse251 (bvadd (bvneg ((_ sign_extend 32) .cse252)) (_ bv18446744071562067968 64))) (bvsle .cse253 (bvadd (_ bv2147483647 32) (bvneg .cse252)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse255 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse259 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse255))) (.cse260 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse254 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse257 (bvadd .cse254 c_~bsum~0))) (let ((.cse256 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse258 ((_ sign_extend 32) .cse257))) (and (bvsle (bvadd c_~csum~0 .cse254 .cse255) (bvadd (bvneg .cse256) (_ bv2147483647 32))) (bvsle .cse257 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse256 (_ bv0 32)) (bvsge .cse258 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse257 (_ bv0 32)) (bvsge .cse259 (bvadd (_ bv18446744071562067968 64) (bvneg .cse258)))))))) (bvsge .cse259 (bvadd (bvneg ((_ sign_extend 32) .cse260)) (_ bv18446744071562067968 64))) (bvsle .cse260 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse265 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse263 (bvadd .cse7 c_~csum~0 .cse265))) (let ((.cse262 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse261 ((_ sign_extend 32) .cse263))) (and (bvsge .cse261 (bvadd (bvneg ((_ sign_extend 32) .cse262)) (_ bv18446744071562067968 64))) (bvsle .cse263 (bvadd (_ bv2147483647 32) (bvneg .cse262))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse264 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse266 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse267 (bvadd .cse264 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse264 .cse265) (bvadd (bvneg .cse266) (_ bv2147483647 32))) (bvsle .cse267 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse266 (_ bv0 32)) (bvsle .cse263 (bvadd (_ bv2147483647 32) (bvneg .cse267))) (bvsge .cse261 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse267))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse270 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse268 ((_ sign_extend 32) .cse270)) (.cse269 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse268 (bvadd (bvneg ((_ sign_extend 32) .cse269)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse271 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg .cse271))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse268 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse271)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg .cse269))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse273 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse274 (bvadd .cse7 c_~csum~0 .cse273))) (let ((.cse276 ((_ sign_extend 32) .cse274)) (.cse277 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse272 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse275 (bvadd .cse272 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse272 .cse273) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse274 (bvadd (_ bv2147483647 32) (bvneg .cse275))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse276 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse275)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse276 (bvadd (bvneg ((_ sign_extend 32) .cse277)) (_ bv18446744071562067968 64))) (bvsle .cse274 (bvadd (_ bv2147483647 32) (bvneg .cse277)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse283 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse284 (bvadd .cse7 c_~csum~0 .cse283))) (let ((.cse278 ((_ sign_extend 32) .cse284)) (.cse279 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse278 (bvadd (bvneg ((_ sign_extend 32) .cse279)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse282 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse280 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse281 (bvadd .cse282 c_~bsum~0))) (and (bvsle .cse280 (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse281 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse282 .cse283)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse280)))) (bvsge .cse278 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse281)))))))) (bvsle .cse284 (bvadd (_ bv2147483647 32) (bvneg .cse279)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse291 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse285 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse291))) (.cse286 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse285 (bvadd (bvneg ((_ sign_extend 32) .cse286)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse290 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse287 (bvadd c_~csum~0 .cse290 .cse291)) (.cse288 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse289 (bvadd .cse290 c_~bsum~0))) (and (bvsle .cse287 (bvadd (bvneg .cse288) (_ bv2147483647 32))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse289 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse287) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse288)))) (bvsge .cse285 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse289)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse286 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse298 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse296 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse298))) (.cse299 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse297 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse294 (bvadd .cse297 c_~bsum~0))) (let ((.cse292 (bvadd c_~csum~0 .cse297 .cse298)) (.cse293 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse295 ((_ sign_extend 32) .cse294))) (and (bvsle .cse292 (bvadd (bvneg .cse293) (_ bv2147483647 32))) (bvsle .cse294 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse295 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse294 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse292) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse293)))) (bvsge .cse296 (bvadd (_ bv18446744071562067968 64) (bvneg .cse295)))))))) (bvsge .cse296 (bvadd (bvneg ((_ sign_extend 32) .cse299)) (_ bv18446744071562067968 64))) (bvsle .cse299 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse303 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse300 ((_ sign_extend 32) .cse303)) (.cse301 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse300 (bvadd (bvneg ((_ sign_extend 32) .cse301)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse302 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse302 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse303 (bvadd (_ bv2147483647 32) (bvneg .cse302))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse300 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse302))))))) (bvsle .cse301 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse310 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse307 (bvadd .cse7 c_~csum~0 .cse310))) (let ((.cse308 ((_ sign_extend 32) .cse307)) (.cse311 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse309 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse304 (bvadd c_~csum~0 .cse309 .cse310)) (.cse305 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse306 (bvadd .cse309 c_~bsum~0))) (and (bvsle .cse304 (bvadd (bvneg .cse305) (_ bv2147483647 32))) (bvsle .cse306 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse307 (bvadd (_ bv2147483647 32) (bvneg .cse306))) (bvsge ((_ sign_extend 32) .cse304) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse305)))) (bvsge .cse308 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse306)))))))) (bvsge .cse308 (bvadd (bvneg ((_ sign_extend 32) .cse311)) (_ bv18446744071562067968 64))) (bvsle .cse311 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse312 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse313 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse312 (bvadd (bvneg ((_ sign_extend 32) .cse313)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse314 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse315 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse316 ((_ sign_extend 32) .cse314))) (and (bvsle .cse314 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse315 (_ bv0 32)) (bvsge .cse316 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse315 (_ bv0 32)) (bvsle .cse314 (_ bv0 32)) (bvsge .cse312 (bvadd (_ bv18446744071562067968 64) (bvneg .cse316))))))) (bvsle .cse313 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse318 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse324 (bvadd .cse7 c_~csum~0 .cse318))) (let ((.cse322 ((_ sign_extend 32) .cse324)) (.cse323 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse317 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse320 (bvadd .cse317 c_~bsum~0))) (let ((.cse319 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse321 ((_ sign_extend 32) .cse320))) (and (bvsle (bvadd c_~csum~0 .cse317 .cse318) (bvadd (bvneg .cse319) (_ bv2147483647 32))) (bvsle .cse320 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse319 (_ bv0 32)) (bvsge .cse321 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse320 (_ bv0 32)) (bvsge .cse322 (bvadd (_ bv18446744071562067968 64) (bvneg .cse321)))))))) (bvsge .cse322 (bvadd (bvneg ((_ sign_extend 32) .cse323)) (_ bv18446744071562067968 64))) (bvsle .cse324 (bvadd (_ bv2147483647 32) (bvneg .cse323)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse326 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse328 (bvadd .cse7 c_~csum~0 .cse326))) (let ((.cse329 ((_ sign_extend 32) .cse328)) (.cse330 (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 ((.cse327 (bvadd .cse325 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse325 .cse326) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse327 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse328 (bvadd (_ bv2147483647 32) (bvneg .cse327))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse329 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse327)))))))) (bvsge .cse329 (bvadd (bvneg ((_ sign_extend 32) .cse330)) (_ bv18446744071562067968 64))) (bvsle .cse330 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse338 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse333 (bvadd .cse7 c_~csum~0 .cse338))) (let ((.cse332 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse331 ((_ sign_extend 32) .cse333))) (and (bvsge .cse331 (bvadd (bvneg ((_ sign_extend 32) .cse332)) (_ bv18446744071562067968 64))) (bvsle .cse333 (bvadd (_ bv2147483647 32) (bvneg .cse332))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse337 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse335 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse336 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse334 (bvadd .cse337 c_~bsum~0))) (and (bvsle .cse334 .cse335) (bvsle .cse333 (bvadd (_ bv2147483647 32) (bvneg .cse334))) (bvsle .cse336 (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse335) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse337 .cse338)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse336)))) (bvsge .cse331 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse334))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse342 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse345 (bvadd .cse7 c_~csum~0 .cse342))) (let ((.cse339 ((_ sign_extend 32) .cse345)) (.cse340 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse339 (bvadd (bvneg ((_ sign_extend 32) .cse340)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse341 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse343 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse344 (bvadd .cse341 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse341 .cse342) (bvadd (bvneg .cse343) (_ bv2147483647 32))) (bvsle .cse344 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse343 (_ bv0 32)) (bvsle .cse345 (bvadd (_ bv2147483647 32) (bvneg .cse344))) (bvsge .cse339 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse344)))))))) (bvsle .cse340 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse352 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse348 (bvadd .cse7 c_~csum~0 .cse352))) (let ((.cse346 ((_ sign_extend 32) .cse348)) (.cse347 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse346 (bvadd (bvneg ((_ sign_extend 32) .cse347)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse351 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse350 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse349 (bvadd .cse351 c_~bsum~0))) (and (bvsle .cse348 (bvadd (_ bv2147483647 32) (bvneg .cse349))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse350 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse351 .cse352)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse350)))) (bvsge .cse346 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse349)))))))) (bvsle .cse348 (bvadd (_ bv2147483647 32) (bvneg .cse347)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse359 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse356 (bvadd .cse7 c_~csum~0 .cse359))) (let ((.cse353 ((_ sign_extend 32) .cse356)) (.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 ((.cse358 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse357 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse355 (bvadd .cse358 c_~bsum~0))) (and (bvsle .cse355 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse356 (bvadd (_ bv2147483647 32) (bvneg .cse355))) (bvsle .cse357 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse358 .cse359)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse357)))) (bvsge .cse353 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse355)))))))) (bvsle .cse354 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse366 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse362 (bvadd .cse7 c_~csum~0 .cse366))) (let ((.cse364 ((_ sign_extend 32) .cse362)) (.cse367 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse365 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse360 (bvadd c_~csum~0 .cse365 .cse366)) (.cse361 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse363 (bvadd .cse365 c_~bsum~0))) (and (bvsle .cse360 (bvadd (bvneg .cse361) (_ bv2147483647 32))) (bvsle .cse362 (bvadd (_ bv2147483647 32) (bvneg .cse363))) (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) .cse360) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse361)))) (bvsge .cse364 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse363)))))))) (bvsge .cse364 (bvadd (bvneg ((_ sign_extend 32) .cse367)) (_ bv18446744071562067968 64))) (bvsle .cse362 (bvadd (_ bv2147483647 32) (bvneg .cse367)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse371 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse368 ((_ sign_extend 32) .cse371)) (.cse369 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse368 (bvadd (bvneg ((_ sign_extend 32) .cse369)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse370 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse372 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse370 (_ bv0 32)) (bvsle .cse371 (bvadd (_ bv2147483647 32) (bvneg .cse372))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse370 (_ bv0 32)) (bvsge .cse368 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse372))))))) (bvsle .cse371 (bvadd (_ bv2147483647 32) (bvneg .cse369))))))))) (= c_~csum~0 (bvadd c_~asum~0 c_~bsum~0))) is different from false