./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 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/goblint-regression/28-race_reach_71-funloop_racing.i -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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 02:45:22,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 02:45:22,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 02:45:22,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 02:45:22,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 02:45:22,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 02:45:22,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 02:45:22,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 02:45:22,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 02:45:22,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 02:45:22,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 02:45:22,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 02:45:22,123 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 02:45:22,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 02:45:22,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 02:45:22,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 02:45:22,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 02:45:22,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 02:45:22,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 02:45:22,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 02:45:22,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:45:22,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 02:45:22,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:45:22,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 02:45:22,127 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 02:45:22,127 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 02:45:22,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 02:45:22,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 02:45:22,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 02:45:22,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 02:45:22,365 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 02:45:22,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-04-25 02:45:23,635 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/295e009f1/3ab31e10799342a4a2ebbcac6fe93fcf/FLAG9911c8716 [2025-04-25 02:45:23,903 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 02:45:23,904 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-04-25 02:45:23,921 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/295e009f1/3ab31e10799342a4a2ebbcac6fe93fcf/FLAG9911c8716 [2025-04-25 02:45:24,636 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/295e009f1/3ab31e10799342a4a2ebbcac6fe93fcf [2025-04-25 02:45:24,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 02:45:24,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 02:45:24,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 02:45:24,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 02:45:24,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 02:45:24,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:45:24" (1/1) ... [2025-04-25 02:45:24,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1bde6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:24, skipping insertion in model container [2025-04-25 02:45:24,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:45:24" (1/1) ... [2025-04-25 02:45:24,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 02:45:25,022 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/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2025-04-25 02:45:25,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:45:25,069 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 02:45:25,127 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/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2025-04-25 02:45:25,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:45:25,186 INFO L204 MainTranslator]: Completed translation [2025-04-25 02:45:25,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25 WrapperNode [2025-04-25 02:45:25,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 02:45:25,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 02:45:25,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 02:45:25,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 02:45:25,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,230 INFO L138 Inliner]: procedures = 272, calls = 107, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 308 [2025-04-25 02:45:25,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 02:45:25,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 02:45:25,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 02:45:25,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 02:45:25,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 02:45:25,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 02:45:25,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 02:45:25,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 02:45:25,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (1/1) ... [2025-04-25 02:45:25,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:45:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:25,290 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-25 02:45:25,292 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-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-25 02:45:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 02:45:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 02:45:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 02:45:25,309 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 02:45:25,416 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 02:45:25,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 02:45:25,723 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 02:45:25,723 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 02:45:26,026 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 02:45:26,028 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-04-25 02:45:26,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:45:26 BoogieIcfgContainer [2025-04-25 02:45:26,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 02:45:26,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 02:45:26,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 02:45:26,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 02:45:26,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 02:45:24" (1/3) ... [2025-04-25 02:45:26,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8c957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:45:26, skipping insertion in model container [2025-04-25 02:45:26,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:45:25" (2/3) ... [2025-04-25 02:45:26,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8c957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:45:26, skipping insertion in model container [2025-04-25 02:45:26,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:45:26" (3/3) ... [2025-04-25 02:45:26,034 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-04-25 02:45:26,044 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 02:45:26,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 94 locations, 133 edges, 1 initial locations, 20 loop locations, and 3 error locations. [2025-04-25 02:45:26,046 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 02:45:26,080 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-25 02:45:26,113 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:26,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 02:45:26,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:26,116 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-25 02:45:26,117 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-25 02:45:26,179 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:45:26,186 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2025-04-25 02:45:26,193 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;@405607ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:26,193 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 02:45:26,270 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:26,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1419539754, now seen corresponding path program 1 times [2025-04-25 02:45:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:26,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48471947] [2025-04-25 02:45:26,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 02:45:26,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 02:45:26,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:26,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:26,550 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-25 02:45:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:26,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48471947] [2025-04-25 02:45:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48471947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:45:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81938385] [2025-04-25 02:45:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:26,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:45:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:26,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:45:26,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:45:26,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:26,570 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:26,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:45:26,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:26,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:26,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 02:45:26,641 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:26,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2076837302, now seen corresponding path program 1 times [2025-04-25 02:45:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:26,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793146096] [2025-04-25 02:45:26,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:26,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 02:45:26,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 02:45:26,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:26,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:26,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793146096] [2025-04-25 02:45:26,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793146096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:26,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130460112] [2025-04-25 02:45:26,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:26,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:26,763 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-25 02:45:26,763 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-25 02:45:26,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 02:45:26,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 02:45:26,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:26,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:26,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-25 02:45:26,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:26,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130460112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:26,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-25 02:45:26,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557954420] [2025-04-25 02:45:26,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:26,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:45:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:26,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:45:26,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:45:26,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:26,917 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:26,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-25 02:45:26,917 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:26,917 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:26,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:26,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:26,993 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-25 02:45:27,186 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,SelfDestructingSolverStorable1 [2025-04-25 02:45:27,186 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:27,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 93369808, now seen corresponding path program 2 times [2025-04-25 02:45:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:27,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411590748] [2025-04-25 02:45:27,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:45:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:27,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-25 02:45:27,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-04-25 02:45:27,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:45:27,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-25 02:45:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:27,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411590748] [2025-04-25 02:45:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411590748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 02:45:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025336158] [2025-04-25 02:45:27,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:27,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:45:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:27,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:45:27,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-25 02:45:27,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:27,595 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:27,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-25 02:45:27,595 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:27,595 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:27,596 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:27,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:27,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:27,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:27,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 02:45:27,766 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:27,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash 382237868, now seen corresponding path program 1 times [2025-04-25 02:45:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:27,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817184400] [2025-04-25 02:45:27,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:27,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:27,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-25 02:45:27,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-25 02:45:27,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:27,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 02:45:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:27,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817184400] [2025-04-25 02:45:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817184400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:27,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189429594] [2025-04-25 02:45:27,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:27,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:27,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:27,885 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-25 02:45:27,887 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-25 02:45:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-25 02:45:28,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-25 02:45:28,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:28,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:28,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 02:45:28,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 02:45:28,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 02:45:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189429594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:28,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-25 02:45:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775237686] [2025-04-25 02:45:28,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:28,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 02:45:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 02:45:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-25 02:45:28,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:28,087 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:28,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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-25 02:45:28,087 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:28,087 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:28,087 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:28,087 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:28,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:28,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:28,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:28,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:28,170 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-25 02:45:28,365 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-25 02:45:28,365 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:28,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash 417458796, now seen corresponding path program 2 times [2025-04-25 02:45:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:28,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639601103] [2025-04-25 02:45:28,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:45:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:28,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-25 02:45:28,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:45:28,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:45:28,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:29,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:29,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639601103] [2025-04-25 02:45:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639601103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:29,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138244239] [2025-04-25 02:45:29,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:45:29,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:29,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:29,027 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-25 02:45:29,028 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-25 02:45:29,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-25 02:45:29,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:45:29,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:45:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:29,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-25 02:45:29,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:29,232 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:45:29,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:45:29,257 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:29,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:29,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:29,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:29,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:29,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:29,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:29,786 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_222 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_218))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_222))) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:29,850 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_218) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138244239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:29,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-04-25 02:45:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751568027] [2025-04-25 02:45:29,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:29,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-25 02:45:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:29,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-25 02:45:29,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=527, Unknown=21, NotChecked=98, Total=756 [2025-04-25 02:45:29,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:29,964 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:29,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 27 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:45:29,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:29,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:29,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:29,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:29,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:30,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:30,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:30,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:30,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:30,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:30,220 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-25 02:45:30,415 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-25 02:45:30,416 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:30,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 380455752, now seen corresponding path program 3 times [2025-04-25 02:45:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:30,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341493356] [2025-04-25 02:45:30,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:45:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:30,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 6 equivalence classes. [2025-04-25 02:45:30,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 67 statements. [2025-04-25 02:45:30,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 02:45:30,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:31,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341493356] [2025-04-25 02:45:31,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341493356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:31,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049073885] [2025-04-25 02:45:31,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:45:31,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:31,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:31,408 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-25 02:45:31,409 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-25 02:45:31,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 6 equivalence classes. [2025-04-25 02:45:31,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 67 statements. [2025-04-25 02:45:31,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 02:45:31,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:31,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-25 02:45:31,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:31,619 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:45:31,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:45:31,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:31,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:31,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:31,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:31,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:31,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:32,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:32,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:32,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:32,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:32,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:32,420 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_351 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_348))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_351))) |c_~#cache~0.base|) (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:32,513 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_348) |c_~#cache~0.base|) (+ 56 |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049073885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:32,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 35 [2025-04-25 02:45:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967379076] [2025-04-25 02:45:32,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:32,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-25 02:45:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:32,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-25 02:45:32,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=983, Unknown=9, NotChecked=130, Total=1260 [2025-04-25 02:45:32,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:32,591 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:32,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 35 states have internal predecessors, (165), 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-25 02:45:32,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:32,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:32,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:32,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:32,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:32,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:33,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:33,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:33,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:33,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:33,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:33,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:33,136 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-25 02:45:33,329 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-25 02:45:33,330 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:33,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1887151652, now seen corresponding path program 4 times [2025-04-25 02:45:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:33,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255692833] [2025-04-25 02:45:33,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 02:45:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:33,342 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-04-25 02:45:33,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-04-25 02:45:33,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 02:45:33,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:34,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:34,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255692833] [2025-04-25 02:45:34,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255692833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:34,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025628749] [2025-04-25 02:45:34,236 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 02:45:34,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:34,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:34,239 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-25 02:45:34,240 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-25 02:45:34,314 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-04-25 02:45:34,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-04-25 02:45:34,976 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 02:45:34,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:34,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-25 02:45:34,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:35,060 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:45:35,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:45:35,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:35,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:35,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:35,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:35,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:35,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:35,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:35,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:35,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:35,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:35,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:35,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:35,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:35,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:35,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:35,986 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_514))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_517))) |c_~#cache~0.base|) (+ 84 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:36,005 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_514 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_514) |c_~#cache~0.base|) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39|)))) is different from false [2025-04-25 02:45:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025628749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:36,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:36,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2025-04-25 02:45:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854677713] [2025-04-25 02:45:36,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:36,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-25 02:45:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:36,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-25 02:45:36,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1242, Unknown=14, NotChecked=146, Total=1560 [2025-04-25 02:45:36,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:36,126 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:36,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.625) internal successors, (225), 39 states have internal predecessors, (225), 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-25 02:45:36,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:36,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:36,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:36,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:36,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:36,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:36,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:36,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:36,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:36,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:36,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:36,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:36,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:36,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:45:36,638 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-25 02:45:36,831 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-25 02:45:36,831 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:36,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:36,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1896610560, now seen corresponding path program 5 times [2025-04-25 02:45:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:36,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472862401] [2025-04-25 02:45:36,832 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 02:45:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:36,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 6 equivalence classes. [2025-04-25 02:45:36,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 107 of 107 statements. [2025-04-25 02:45:36,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-25 02:45:36,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:37,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472862401] [2025-04-25 02:45:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472862401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:37,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174270069] [2025-04-25 02:45:37,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 02:45:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:37,984 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-25 02:45:37,985 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-25 02:45:38,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 6 equivalence classes. [2025-04-25 02:45:42,598 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 107 of 107 statements. [2025-04-25 02:45:42,598 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-25 02:45:42,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:42,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-25 02:45:42,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:42,671 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:45:42,671 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:45:42,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:42,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:42,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:42,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:42,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:42,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:43,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:43,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:43,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:43,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:43,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:43,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:43,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:44,004 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_716 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_720))) |c_~#cache~0.base|) (+ 112 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:44,074 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_716 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716) |c_~#cache~0.base|) (+ 112 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174270069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:44,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 47 [2025-04-25 02:45:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643881200] [2025-04-25 02:45:44,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:44,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-25 02:45:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:44,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-25 02:45:44,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1878, Unknown=26, NotChecked=178, Total=2256 [2025-04-25 02:45:44,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:44,196 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:44,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 47 states have internal predecessors, (286), 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-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:44,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:45:44,197 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:44,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:45:44,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:45:44,865 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-25 02:45:45,055 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-25 02:45:45,056 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:45,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1919071780, now seen corresponding path program 6 times [2025-04-25 02:45:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:45,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134100413] [2025-04-25 02:45:45,056 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 02:45:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:45,070 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 127 statements into 6 equivalence classes. [2025-04-25 02:45:45,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 127 of 127 statements. [2025-04-25 02:45:45,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-25 02:45:45,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:46,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134100413] [2025-04-25 02:45:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134100413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:46,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152937421] [2025-04-25 02:45:46,717 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 02:45:46,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:46,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:46,719 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-25 02:45:46,720 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-25 02:45:46,800 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 127 statements into 6 equivalence classes. [2025-04-25 02:45:48,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 127 of 127 statements. [2025-04-25 02:45:48,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-25 02:45:48,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:49,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-25 02:45:49,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:49,077 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:45:49,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:45:49,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:49,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:49,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:49,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:49,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:50,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:50,840 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_957 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_954))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_957))) |c_~#cache~0.base|) (+ 140 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:50,926 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_954 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_954) |c_~#cache~0.base|) (+ 140 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152937421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:51,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:51,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 56 [2025-04-25 02:45:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329983871] [2025-04-25 02:45:51,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:51,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-25 02:45:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-25 02:45:51,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2725, Unknown=26, NotChecked=214, Total=3192 [2025-04-25 02:45:51,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:51,058 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:51,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.052631578947368) internal successors, (345), 56 states have internal predecessors, (345), 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-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:45:51,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:45:52,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:45:52,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:45:52,175 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-25 02:45:52,365 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-25 02:45:52,365 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:45:52,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash 636392120, now seen corresponding path program 7 times [2025-04-25 02:45:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:52,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644694831] [2025-04-25 02:45:52,366 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 02:45:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:52,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-04-25 02:45:52,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-04-25 02:45:52,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:53,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:53,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644694831] [2025-04-25 02:45:53,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644694831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:45:53,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190243523] [2025-04-25 02:45:53,629 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 02:45:53,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:45:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:45:53,631 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-25 02:45:53,632 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-25 02:45:53,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-04-25 02:45:53,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-04-25 02:45:53,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:53,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:53,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-04-25 02:45:53,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:45:53,840 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:45:53,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:45:53,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:53,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:45:54,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:45:54,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:45:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:54,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:45:59,776 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1228 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1228) |c_~#cache~0.base|) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)))) is different from false [2025-04-25 02:45:59,833 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1228 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1228) |c_~#cache~0.base|) (+ 168 |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:45:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:45:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190243523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:45:59,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:45:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 57 [2025-04-25 02:45:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409128714] [2025-04-25 02:45:59,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:45:59,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-25 02:45:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:59,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-25 02:45:59,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2837, Unknown=25, NotChecked=218, Total=3306 [2025-04-25 02:45:59,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:59,906 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:59,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 6.982758620689655) internal successors, (405), 57 states have internal predecessors, (405), 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-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:45:59,906 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:46:01,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:46:01,217 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-25 02:46:01,410 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-25 02:46:01,411 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:46:01,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1144968596, now seen corresponding path program 8 times [2025-04-25 02:46:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:01,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629159314] [2025-04-25 02:46:01,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:46:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:01,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-04-25 02:46:01,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-04-25 02:46:01,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:46:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:03,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629159314] [2025-04-25 02:46:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629159314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:46:03,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863274557] [2025-04-25 02:46:03,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:46:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:46:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:46:03,125 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-25 02:46:03,125 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-25 02:46:03,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-04-25 02:46:03,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-04-25 02:46:03,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:46:03,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:03,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-04-25 02:46:03,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:46:03,391 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:46:03,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:46:03,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:46:03,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-25 02:46:03,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:03,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:03,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:03,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:03,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:03,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:03,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:03,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:04,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:04,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:05,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:05,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:05,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:46:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863274557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:46:06,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:46:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 63 [2025-04-25 02:46:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018914980] [2025-04-25 02:46:06,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:46:06,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-25 02:46:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:06,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-25 02:46:06,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=3703, Unknown=68, NotChecked=0, Total=4032 [2025-04-25 02:46:06,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:06,524 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:06,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 7.265625) internal successors, (465), 63 states have internal predecessors, (465), 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-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:46:06,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:46:06,525 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:46:06,525 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:46:06,525 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:46:07,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:46:07,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:46:07,915 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-25 02:46:08,108 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-25 02:46:08,108 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:46:08,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1565332080, now seen corresponding path program 9 times [2025-04-25 02:46:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:08,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077120948] [2025-04-25 02:46:08,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:46:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:08,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 9 equivalence classes. [2025-04-25 02:46:08,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 187 of 187 statements. [2025-04-25 02:46:08,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-25 02:46:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:10,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:10,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077120948] [2025-04-25 02:46:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077120948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:46:10,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228671773] [2025-04-25 02:46:10,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:46:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:46:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:46:10,719 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-25 02:46:10,719 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-25 02:46:10,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 9 equivalence classes. [2025-04-25 02:46:40,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 187 of 187 statements. [2025-04-25 02:46:40,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-25 02:46:40,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:40,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-04-25 02:46:40,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:46:40,932 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:46:40,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:46:40,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-25 02:46:41,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-25 02:46:41,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:41,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:41,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:42,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:42,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:46:42,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-25 02:46:42,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-25 02:46:42,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,629 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-25 02:46:42,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-04-25 02:46:42,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,736 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-25 02:46:42,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2025-04-25 02:46:42,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:42,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:46:42,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-25 02:46:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:43,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:46:44,683 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1887 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1884))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1887))) |c_~#cache~0.base|) (+ 224 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:46:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228671773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:46:45,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:46:45,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 25] total 78 [2025-04-25 02:46:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146186907] [2025-04-25 02:46:45,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:46:45,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-04-25 02:46:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:45,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-04-25 02:46:45,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=5614, Unknown=60, NotChecked=152, Total=6162 [2025-04-25 02:46:45,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:45,070 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:45,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 6.6455696202531644) internal successors, (525), 78 states have internal predecessors, (525), 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-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:46:45,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:46:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:46:47,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-25 02:46:47,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-25 02:46:47,304 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-25 02:46:47,304 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:46:47,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash 274221388, now seen corresponding path program 10 times [2025-04-25 02:46:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:47,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581806376] [2025-04-25 02:46:47,305 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 02:46:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:47,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-04-25 02:46:47,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-04-25 02:46:47,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 02:46:47,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:46:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:49,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581806376] [2025-04-25 02:46:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581806376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:46:49,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455375661] [2025-04-25 02:46:49,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 02:46:49,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:46:49,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:46:49,976 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-25 02:46:49,976 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-25 02:46:50,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-04-25 02:48:50,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-04-25 02:48:50,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 02:48:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:50,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 172 conjuncts are in the unsatisfiable core [2025-04-25 02:48:50,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:48:50,585 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:48:50,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:48:50,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2025-04-25 02:48:50,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2025-04-25 02:48:50,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:50,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:50,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:50,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:50,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:50,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:50,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2025-04-25 02:48:51,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2025-04-25 02:48:51,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2025-04-25 02:48:51,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:51,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2025-04-25 02:48:51,767 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2025-04-25 02:48:51,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2025-04-25 02:48:52,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2025-04-25 02:48:52,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2025-04-25 02:48:52,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,608 INFO L325 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-04-25 02:48:52,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 69 [2025-04-25 02:48:52,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:52,796 INFO L325 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-04-25 02:48:52,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 77 [2025-04-25 02:48:53,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2025-04-25 02:48:53,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2025-04-25 02:48:53,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2025-04-25 02:48:53,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2025-04-25 02:48:54,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2025-04-25 02:48:54,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2025-04-25 02:48:54,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:54,451 INFO L325 Elim1Store]: treesize reduction 48, result has 41.5 percent of original size [2025-04-25 02:48:54,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2025-04-25 02:48:54,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:48:54,622 INFO L325 Elim1Store]: treesize reduction 48, result has 41.5 percent of original size [2025-04-25 02:48:54,623 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 64 [2025-04-25 02:48:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:48:54,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:49:02,411 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2266) |c_~#cache~0.base|) (+ 252 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:49:02,414 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2266) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0)) is different from false [2025-04-25 02:49:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:02,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455375661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:49:02,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:49:02,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37, 27] total 92 [2025-04-25 02:49:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688751579] [2025-04-25 02:49:02,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:49:02,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-04-25 02:49:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:02,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-04-25 02:49:02,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=7641, Unknown=40, NotChecked=358, Total=8556 [2025-04-25 02:49:02,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:02,514 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:02,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 6.290322580645161) internal successors, (585), 92 states have internal predecessors, (585), 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-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-25 02:49:02,515 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:49:05,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-25 02:49:05,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-25 02:49:05,826 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-25 02:49:05,989 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,SelfDestructingSolverStorable12 [2025-04-25 02:49:05,989 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:05,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash -417367512, now seen corresponding path program 11 times [2025-04-25 02:49:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:05,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184882904] [2025-04-25 02:49:05,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 02:49:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:06,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 227 statements into 11 equivalence classes. [2025-04-25 02:49:06,059 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 227 of 227 statements. [2025-04-25 02:49:06,059 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-25 02:49:06,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 910 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:06,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184882904] [2025-04-25 02:49:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184882904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-25 02:49:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129848588] [2025-04-25 02:49:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:06,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 02:49:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:06,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 02:49:06,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-25 02:49:06,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:06,270 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:06,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.76923076923077) internal successors, (218), 13 states have internal predecessors, (218), 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-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-25 02:49:06,270 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-04-25 02:49:18,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:18,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-25 02:49:18,435 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:18,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash -543670945, now seen corresponding path program 1 times [2025-04-25 02:49:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:18,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821574352] [2025-04-25 02:49:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:18,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-25 02:49:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-25 02:49:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-04-25 02:49:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:18,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821574352] [2025-04-25 02:49:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821574352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:49:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628185741] [2025-04-25 02:49:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:18,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:49:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:18,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:49:18,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:49:18,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:18,487 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:18,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-25 02:49:18,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:18,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:18,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:18,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:18,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:18,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:24,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:24,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:49:24,722 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 02:49:24,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-25 02:49:24,726 INFO L422 BasicCegarLoop]: Path program histogram: [11, 2, 1, 1] [2025-04-25 02:49:24,727 INFO L320 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2025-04-25 02:49:24,729 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:49:24,729 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:49:24,730 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:49:24,730 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;@405607ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:49:24,730 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 02:49:24,733 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:49:24,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash -967948563, now seen corresponding path program 1 times [2025-04-25 02:49:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:24,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589186408] [2025-04-25 02:49:24,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:24,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-25 02:49:24,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-25 02:49:24,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:24,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:24,747 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-25 02:49:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:24,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589186408] [2025-04-25 02:49:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589186408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:24,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:24,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:49:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054287946] [2025-04-25 02:49:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:24,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:49:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:24,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:49:24,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:49:24,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:24,747 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:24,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-25 02:49:24,747 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:24,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:24,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-25 02:49:24,759 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:49:24,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash -267062605, now seen corresponding path program 1 times [2025-04-25 02:49:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:24,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714010929] [2025-04-25 02:49:24,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:24,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-25 02:49:24,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-25 02:49:24,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:24,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:24,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714010929] [2025-04-25 02:49:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714010929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:24,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96293733] [2025-04-25 02:49:24,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:24,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:24,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:24,778 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-25 02:49:24,779 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-25 02:49:24,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-25 02:49:24,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-25 02:49:24,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:24,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:24,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-25 02:49:24,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:49:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:24,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:49:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:24,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96293733] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:49:24,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:49:24,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-25 02:49:24,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427079872] [2025-04-25 02:49:24,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:49:24,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:49:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:24,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:49:24,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:49:24,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:24,915 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:24,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-25 02:49:24,915 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:24,915 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:24,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:24,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:24,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-25 02:49:25,136 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,SelfDestructingSolverStorable16 [2025-04-25 02:49:25,136 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:49:25,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1484654701, now seen corresponding path program 2 times [2025-04-25 02:49:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:25,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276636108] [2025-04-25 02:49:25,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:49:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:25,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-25 02:49:25,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-25 02:49:25,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:49:25,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:25,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276636108] [2025-04-25 02:49:25,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276636108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:25,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331684628] [2025-04-25 02:49:25,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:49:25,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:25,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:25,173 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-25 02:49:25,174 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-25 02:49:25,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-25 02:49:25,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-25 02:49:25,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:49:25,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:25,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 02:49:25,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:49:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:25,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:49:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331684628] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:49:25,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:49:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-25 02:49:25,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930779587] [2025-04-25 02:49:25,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:49:25,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 02:49:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:25,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 02:49:25,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-25 02:49:25,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:25,337 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:25,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:49:25,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:25,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:25,337 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:25,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:25,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:25,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:25,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-25 02:49:25,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-25 02:49:25,562 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:49:25,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1121860947, now seen corresponding path program 3 times [2025-04-25 02:49:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:25,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178799427] [2025-04-25 02:49:25,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:49:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:25,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-25 02:49:25,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 02:49:25,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-25 02:49:25,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:49:25,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:49:25,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 02:49:25,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 02:49:25,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:25,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:49:25,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:49:25,593 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:49:25,593 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-25 02:49:25,593 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-25 02:49:25,593 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-25 02:49:25,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-25 02:49:25,594 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-25 02:49:25,594 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2025-04-25 02:49:25,595 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:49:25,595 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-25 02:49:25,614 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 02:49:25,617 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:49:25,626 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:49:25,626 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2025-04-25 02:49:25,627 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;@405607ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:49:25,627 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 02:49:25,719 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:25,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash 445206564, now seen corresponding path program 1 times [2025-04-25 02:49:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:25,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397260461] [2025-04-25 02:49:25,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:25,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-25 02:49:25,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-25 02:49:25,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:25,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:25,750 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-25 02:49:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:25,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397260461] [2025-04-25 02:49:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397260461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:25,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:49:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753821067] [2025-04-25 02:49:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:25,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:49:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:25,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:49:25,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:49:25,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:25,751 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:25,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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-25 02:49:25,752 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:25,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:25,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-25 02:49:25,977 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:25,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1401366674, now seen corresponding path program 1 times [2025-04-25 02:49:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:25,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296954615] [2025-04-25 02:49:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:25,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-04-25 02:49:25,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-04-25 02:49:25,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:25,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:26,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296954615] [2025-04-25 02:49:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296954615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:26,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880986914] [2025-04-25 02:49:26,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:26,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:26,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:26,042 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:49:26,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-25 02:49:26,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-04-25 02:49:26,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-04-25 02:49:26,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:26,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:26,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-25 02:49:26,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:49:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:26,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:49:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:49:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880986914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:49:26,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:49:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-25 02:49:26,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553362946] [2025-04-25 02:49:26,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:49:26,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:49:26,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:26,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:49:26,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:49:26,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:26,277 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:26,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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-25 02:49:26,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:26,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:26,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:26,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:26,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-25 02:49:26,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:26,528 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:26,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -455298675, now seen corresponding path program 2 times [2025-04-25 02:49:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:26,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239429418] [2025-04-25 02:49:26,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:49:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:26,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-04-25 02:49:26,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 181 of 185 statements. [2025-04-25 02:49:26,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:49:26,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-25 02:49:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:26,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239429418] [2025-04-25 02:49:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239429418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 02:49:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804401729] [2025-04-25 02:49:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:26,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:49:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:26,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:49:26,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-25 02:49:26,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:26,876 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:26,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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-25 02:49:26,876 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:26,876 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:26,876 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:27,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:27,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:27,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:27,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-25 02:49:27,044 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:27,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1441418110, now seen corresponding path program 1 times [2025-04-25 02:49:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:27,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080929317] [2025-04-25 02:49:27,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:27,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-04-25 02:49:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-04-25 02:49:27,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:27,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-25 02:49:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:27,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080929317] [2025-04-25 02:49:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080929317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:27,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864789898] [2025-04-25 02:49:27,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:27,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:27,147 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:49:27,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-25 02:49:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-04-25 02:49:27,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-04-25 02:49:27,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:27,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:27,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 02:49:27,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:49:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-25 02:49:27,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:49:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-25 02:49:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864789898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:49:27,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:49:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-25 02:49:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2171332] [2025-04-25 02:49:27,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:49:27,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 02:49:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:27,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 02:49:27,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-25 02:49:27,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:27,429 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:27,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 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-25 02:49:27,429 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:27,429 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:27,429 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:27,429 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:27,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:27,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:27,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:27,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:27,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-25 02:49:27,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-25 02:49:27,719 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:27,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:27,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1276402914, now seen corresponding path program 2 times [2025-04-25 02:49:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:27,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679595499] [2025-04-25 02:49:27,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:49:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:27,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-04-25 02:49:27,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 220 statements. [2025-04-25 02:49:27,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:49:27,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-25 02:49:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:27,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679595499] [2025-04-25 02:49:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679595499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-25 02:49:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742726017] [2025-04-25 02:49:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:27,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:49:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:27,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:49:27,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:49:27,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:27,814 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:27,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-25 02:49:27,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:27,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:27,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:27,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:27,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:27,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:27,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:27,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:27,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:27,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:27,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-25 02:49:27,971 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:27,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1231042476, now seen corresponding path program 1 times [2025-04-25 02:49:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:27,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328172373] [2025-04-25 02:49:27,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:27,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-04-25 02:49:28,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-04-25 02:49:28,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:28,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-25 02:49:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:28,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328172373] [2025-04-25 02:49:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328172373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:49:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 02:49:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753972500] [2025-04-25 02:49:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:28,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-25 02:49:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:28,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-25 02:49:28,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-25 02:49:28,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:28,433 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:28,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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-25 02:49:28,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:28,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:28,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:28,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:28,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:28,433 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:28,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:28,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:28,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:28,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:28,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:28,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:28,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-25 02:49:28,570 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:28,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2032322536, now seen corresponding path program 1 times [2025-04-25 02:49:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:28,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964276287] [2025-04-25 02:49:28,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:28,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-25 02:49:28,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-25 02:49:28,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:28,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:28,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964276287] [2025-04-25 02:49:28,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964276287] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:28,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235880616] [2025-04-25 02:49:28,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:49:28,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:28,688 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:49:28,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-25 02:49:28,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-25 02:49:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-25 02:49:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:49:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:28,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 02:49:28,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:49:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:29,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:49:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235880616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:49:29,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:49:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-25 02:49:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046755064] [2025-04-25 02:49:29,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:49:29,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-25 02:49:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:29,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-25 02:49:29,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-25 02:49:29,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:29,245 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:29,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.272727272727273) internal successors, (333), 11 states have internal predecessors, (333), 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-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:29,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:29,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:49:29,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-25 02:49:29,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-25 02:49:29,733 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:29,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash 838686548, now seen corresponding path program 2 times [2025-04-25 02:49:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:29,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391352893] [2025-04-25 02:49:29,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:49:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:29,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 592 statements into 2 equivalence classes. [2025-04-25 02:49:29,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 592 of 592 statements. [2025-04-25 02:49:29,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:49:29,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 630 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:30,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391352893] [2025-04-25 02:49:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391352893] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:30,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351407333] [2025-04-25 02:49:30,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:49:30,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:30,507 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:49:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-25 02:49:30,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 592 statements into 2 equivalence classes. [2025-04-25 02:49:30,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 592 of 592 statements. [2025-04-25 02:49:30,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:49:30,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:30,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-25 02:49:31,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:49:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-04-25 02:49:31,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:49:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351407333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:49:31,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 02:49:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [21] total 22 [2025-04-25 02:49:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804180038] [2025-04-25 02:49:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:49:31,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 02:49:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:49:31,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 02:49:31,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2025-04-25 02:49:31,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:31,308 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:49:31,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 27.923076923076923) internal successors, (363), 13 states have internal predecessors, (363), 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-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:49:31,308 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:49:31,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:49:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 02:49:31,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-25 02:49:32,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-25 02:49:32,059 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:49:32,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:49:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2065895978, now seen corresponding path program 3 times [2025-04-25 02:49:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:49:32,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966992661] [2025-04-25 02:49:32,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:49:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:49:32,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 314 statements into 6 equivalence classes. [2025-04-25 02:49:32,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 308 of 314 statements. [2025-04-25 02:49:32,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 02:49:32,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:49:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:49:48,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:49:48,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966992661] [2025-04-25 02:49:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966992661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:49:48,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179216825] [2025-04-25 02:49:48,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:49:48,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:49:48,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:49:48,478 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:49:48,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-25 02:49:48,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 314 statements into 6 equivalence classes. [2025-04-25 02:50:03,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 308 of 314 statements. [2025-04-25 02:50:03,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 02:50:03,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:50:03,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 232 conjuncts are in the unsatisfiable core [2025-04-25 02:50:03,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:50:03,386 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 02:50:03,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 02:50:03,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-25 02:50:03,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-25 02:50:03,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-25 02:50:03,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2025-04-25 02:50:04,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2025-04-25 02:50:04,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2025-04-25 02:50:04,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2025-04-25 02:50:05,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2025-04-25 02:50:05,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-04-25 02:50:05,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2025-04-25 02:50:05,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2025-04-25 02:50:06,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2025-04-25 02:50:06,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2025-04-25 02:50:06,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2025-04-25 02:50:06,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2025-04-25 02:50:07,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:07,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:08,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:08,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:08,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:08,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:08,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:08,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:08,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:08,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:08,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-04-25 02:50:08,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:09,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:09,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2025-04-25 02:50:09,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2025-04-25 02:50:09,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-04-25 02:50:10,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-25 02:50:10,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-25 02:50:10,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:10,704 INFO L325 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2025-04-25 02:50:10,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2025-04-25 02:50:10,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:10,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:10,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2025-04-25 02:50:11,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:11,023 INFO L325 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2025-04-25 02:50:11,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2025-04-25 02:50:11,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:11,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 02:50:11,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-25 02:50:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-25 02:50:11,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:50:16,807 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 56 (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0) (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|))) is different from false [2025-04-25 02:50:19,055 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (or (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5714)))) (store .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse1 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 56 (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0))) is different from false [2025-04-25 02:50:23,134 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5714)) |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 56 .cse2 |c_~#cache~0.offset|))) 0) (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|))) is different from false [2025-04-25 02:50:27,147 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (or (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5714)) |c_~#cache~0.base|)) (.cse1 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 84 .cse2 |c_~#cache~0.offset|))) 0))) is different from false [2025-04-25 02:50:31,194 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (or (= 0 (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (select (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse3 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5714))) |c_~#cache~0.base|)) (.cse1 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 84 .cse2 |c_~#cache~0.offset|)))) (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|))) is different from false [2025-04-25 02:50:33,799 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (or (< (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (select (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse4 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse3 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5714))) |c_~#cache~0.base|)) (.cse1 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 84 .cse2 |c_~#cache~0.offset|))) 0))) is different from false [2025-04-25 02:50:37,552 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (let ((.cse4 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 84 .cse2 |c_~#cache~0.offset|))) 0) (< (+ .cse4 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:50:40,310 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 (+ .cse3 |c_~#cache~0.offset|))) (store .cse4 .cse5 (select .cse4 .cse5))) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 84 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:50:44,002 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (let ((.cse5 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4))) (+ .cse5 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse2 |c_~#cache~0.offset|))) 0) (< (+ .cse5 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:50:46,924 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse5 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse4 .cse5 (select .cse4 .cse5))) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:50:49,463 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int)) (let ((.cse6 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse5 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse4 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4))) (+ .cse6 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse6 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:50:53,516 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708)))) (store .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse7 (select .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse7 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse7 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|)) (.cse5 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse4 .cse5 (select .cse4 .cse5))) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:50:57,556 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse9 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (select (let ((.cse7 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse8 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse8 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse5 (store (select .cse7 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708))) (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse5) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (select (store .cse7 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse5) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) |c_~#cache~0.base|)) (.cse4 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4))) (+ .cse9 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse9 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:51:01,604 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse11 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (select (let ((.cse8 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse9 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse9 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) (let ((.cse5 (store (select (store .cse8 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708))) (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse5) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse5) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))))) |c_~#cache~0.base|)) (.cse4 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4))) (+ .cse11 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse11 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:51:05,506 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse10 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse4 (+ .cse2 |c_~#cache~0.offset|))) (let ((.cse3 (select (let ((.cse7 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse9 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse9 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse6 (let ((.cse8 (select .cse7 |c_~#cache~0.base|))) (store .cse8 .cse4 (+ (select .cse8 .cse4) 1))))) (store (store |c_#memory_int| |c_~#cache~0.base| .cse6) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse7 |c_~#cache~0.base| .cse6) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708)))) |c_~#cache~0.base|)) (.cse5 (+ .cse2 28 |c_~#cache~0.offset|))) (store (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4))) .cse5 (select .cse3 .cse5)))) (+ .cse10 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 112 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse10 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:51:08,554 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse5 (+ .cse3 28 |c_~#cache~0.offset|))) (let ((.cse4 (select (let ((.cse8 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#cache~0.base|))) (store .cse9 .cse5 (+ (select .cse9 .cse5) 1))))) (store (store |c_#memory_int| |c_~#cache~0.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#cache~0.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708)))) |c_~#cache~0.base|)) (.cse6 (+ 56 .cse3 |c_~#cache~0.offset|))) (store (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))) .cse6 (select .cse4 .cse6)))) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 140 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:51:11,959 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse12 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse4 (+ .cse2 28 |c_~#cache~0.offset|))) (let ((.cse3 (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) (let ((.cse8 (store .cse6 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (select .cse6 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#cache~0.base|))) (store .cse9 .cse4 (+ (select .cse9 .cse4) 1))))) (store (store .cse6 |c_~#cache~0.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#cache~0.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708))))) |c_~#cache~0.base|)) (.cse5 (+ 56 .cse2 |c_~#cache~0.offset|))) (store (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4))) .cse5 (select .cse3 .cse5)))) (+ .cse12 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 84 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 140 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse12 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:51:15,232 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse12 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse4 (+ .cse2 28 |c_~#cache~0.offset|))) (let ((.cse3 (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))) (let ((.cse8 (store .cse6 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (select .cse6 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#cache~0.base|))) (store .cse9 .cse4 (+ 1 (select .cse9 .cse4)))))) (store (store .cse6 |c_~#cache~0.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#cache~0.base| .cse7) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5708))))) |c_~#cache~0.base|)) (.cse5 (+ 56 .cse2 |c_~#cache~0.offset|))) (store (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4))) .cse5 (select .cse3 .cse5)))) (+ .cse12 28 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 84 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 140 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse12 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-04-25 02:54:11,831 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (select (let ((.cse8 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)))) (store .cse8 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (select .cse8 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse9 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse9 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse5 (+ .cse3 28 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 56 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 140 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:15,869 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)) |c_~#cache~0.base|)) (.cse9 (+ .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ .cse3 28 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 56 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 140 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:19,888 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)) |c_~#cache~0.base|)) (.cse9 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 56 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 84 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 168 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:23,988 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (let ((.cse10 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701))) |c_~#cache~0.base|)) (.cse9 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 56 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 84 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 168 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:28,080 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (let ((.cse11 (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse13 (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse13 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse13 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse10 (let ((.cse12 (select .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse12 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse11 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)))) |c_~#cache~0.base|)) (.cse9 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 56 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 84 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 168 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:32,160 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (let ((.cse13 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse15 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse15 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse15 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) (let ((.cse11 (let ((.cse14 (select .cse13 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse14 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse14 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) (let ((.cse10 (let ((.cse12 (select (store .cse13 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse11) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse12 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse11) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701))))) |c_~#cache~0.base|)) (.cse9 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 56 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 84 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 168 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:36,329 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (let ((.cse13 (+ .cse3 |c_~#cache~0.offset|))) (let ((.cse14 (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse16 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse16 .cse13 (+ (select .cse16 .cse13) 1)))))) (let ((.cse11 (let ((.cse15 (select .cse14 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse15 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse15 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) (let ((.cse10 (let ((.cse12 (select (store .cse14 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse11) |c_~#cache~0.base|))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13)))))) (store (store |c_#memory_int| |c_~#cache~0.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse11) |c_~#cache~0.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)))))) |c_~#cache~0.base|)) (.cse9 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 56 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 84 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 168 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:40,352 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (let ((.cse13 (+ .cse3 28 |c_~#cache~0.offset|))) (let ((.cse14 (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse16 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse16 .cse13 (+ (select .cse16 .cse13) 1)))))) (let ((.cse11 (let ((.cse15 (select .cse14 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse15 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse15 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) (let ((.cse10 (let ((.cse12 (select (store .cse14 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse11) |c_~#cache~0.base|))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13)))))) (store (store |c_#memory_int| |c_~#cache~0.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse11) |c_~#cache~0.base| .cse10) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)))))) |c_~#cache~0.base|)) (.cse9 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 84 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 112 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (- 1) (select .cse6 .cse5))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 140 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 196 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false [2025-04-25 02:54:44,449 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (select (let ((.cse14 (+ .cse3 28 |c_~#cache~0.offset|)) (.cse10 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse18 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) (let ((.cse15 (store .cse10 |c_~#cache~0.base| (let ((.cse17 (select .cse10 |c_~#cache~0.base|))) (store .cse17 .cse14 (+ (select .cse17 .cse14) 1)))))) (let ((.cse12 (let ((.cse16 (select .cse15 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) (let ((.cse11 (let ((.cse13 (select (store .cse15 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse12) |c_~#cache~0.base|))) (store .cse13 .cse14 (+ (- 1) (select .cse13 .cse14)))))) (store (store .cse10 |c_~#cache~0.base| .cse11) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store .cse10 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| .cse12) |c_~#cache~0.base| .cse11) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5701)))))) |c_~#cache~0.base|)) (.cse9 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 84 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 112 .cse3 |c_~#cache~0.offset|))) (store (store (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse5 (+ (select .cse6 .cse5) (- 1))) .cse7 (select .cse6 .cse7)))) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 140 .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 196 .cse3 |c_~#cache~0.offset|))) 0)))) is different from false