./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 6f232940 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-6f23294-m [2025-03-20 01:52:25,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 01:52:25,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 01:52:25,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 01:52:25,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 01:52:25,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 01:52:25,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 01:52:25,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 01:52:25,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 01:52:25,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 01:52:25,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 01:52:25,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 01:52:25,546 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 01:52:25,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 01:52:25,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 01:52:25,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 01:52:25,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 01:52:25,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 01:52:25,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 01:52:25,549 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 01:52:25,549 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 01:52:25,549 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-03-20 01:52:25,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 01:52:25,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 01:52:25,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 01:52:25,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 01:52:25,797 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 01:52:25,797 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-03-20 01:52:27,077 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/031fcf361/5525126a038f45a4b2c28121898f6ba0/FLAGa0d42b192 [2025-03-20 01:52:27,297 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 01:52:27,298 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-20 01:52:27,313 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/031fcf361/5525126a038f45a4b2c28121898f6ba0/FLAGa0d42b192 [2025-03-20 01:52:28,078 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/031fcf361/5525126a038f45a4b2c28121898f6ba0 [2025-03-20 01:52:28,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 01:52:28,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 01:52:28,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 01:52:28,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 01:52:28,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 01:52:28,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d41239b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28, skipping insertion in model container [2025-03-20 01:52:28,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 01:52:28,350 WARN L250 ndardFunctionHandler]: 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-03-20 01:52:28,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 01:52:28,395 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 01:52:28,465 WARN L250 ndardFunctionHandler]: 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-03-20 01:52:28,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 01:52:28,524 INFO L204 MainTranslator]: Completed translation [2025-03-20 01:52:28,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28 WrapperNode [2025-03-20 01:52:28,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 01:52:28,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 01:52:28,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 01:52:28,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 01:52:28,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,574 INFO L138 Inliner]: procedures = 272, calls = 107, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 308 [2025-03-20 01:52:28,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 01:52:28,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 01:52:28,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 01:52:28,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 01:52:28,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 01:52:28,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 01:52:28,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 01:52:28,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 01:52:28,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (1/1) ... [2025-03-20 01:52:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 01:52:28,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:28,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 01:52:28,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 01:52:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-20 01:52:28,646 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-20 01:52:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 01:52:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 01:52:28,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 01:52:28,646 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 01:52:28,728 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 01:52:28,729 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 01:52:29,050 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 01:52:29,050 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 01:52:29,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 01:52:29,378 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-03-20 01:52:29,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:52:29 BoogieIcfgContainer [2025-03-20 01:52:29,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 01:52:29,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 01:52:29,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 01:52:29,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 01:52:29,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 01:52:28" (1/3) ... [2025-03-20 01:52:29,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df62229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:52:29, skipping insertion in model container [2025-03-20 01:52:29,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:52:28" (2/3) ... [2025-03-20 01:52:29,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df62229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:52:29, skipping insertion in model container [2025-03-20 01:52:29,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:52:29" (3/3) ... [2025-03-20 01:52:29,386 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-03-20 01:52:29,395 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 01:52:29,398 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-03-20 01:52:29,398 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 01:52:29,437 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-20 01:52:29,473 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:52:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 01:52:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:29,475 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-03-20 01:52:29,477 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-03-20 01:52:29,539 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:52:29,546 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2025-03-20 01:52:29,553 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;@186b32b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:52:29,554 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-20 01:52:29,784 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:29,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1419539754, now seen corresponding path program 1 times [2025-03-20 01:52:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830171713] [2025-03-20 01:52:29,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:52:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:29,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-20 01:52:29,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-20 01:52:29,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:29,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:52:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830171713] [2025-03-20 01:52:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830171713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:52:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:52:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:52:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292036913] [2025-03-20 01:52:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:52:30,061 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:52:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:30,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:52:30,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:52:30,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:30,079 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:30,080 INFO L481 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-03-20 01:52:30,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:30,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:30,185 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 01:52:30,185 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:30,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2076837302, now seen corresponding path program 1 times [2025-03-20 01:52:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828735892] [2025-03-20 01:52:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:52:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 01:52:30,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 01:52:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:52:30,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:30,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828735892] [2025-03-20 01:52:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828735892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:30,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599669108] [2025-03-20 01:52:30,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:52:30,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:30,319 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-03-20 01:52:30,321 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-03-20 01:52:30,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 01:52:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 01:52:30,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:30,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:30,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 01:52:30,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:52:30,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:52:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599669108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:30,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-20 01:52:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826350661] [2025-03-20 01:52:30,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:30,463 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-20 01:52:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:30,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-20 01:52:30,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-20 01:52:30,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:30,464 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:30,465 INFO L481 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-03-20 01:52:30,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:30,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:30,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:30,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:30,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-20 01:52:30,754 WARN L461 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-03-20 01:52:30,754 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:30,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 93369808, now seen corresponding path program 2 times [2025-03-20 01:52:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710338937] [2025-03-20 01:52:30,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:52:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:30,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-20 01:52:30,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-03-20 01:52:30,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:52:30,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 01:52:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710338937] [2025-03-20 01:52:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710338937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:52:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:52:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-20 01:52:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118174621] [2025-03-20 01:52:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:52:31,134 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 01:52:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:31,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 01:52:31,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-20 01:52:31,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:31,135 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:31,135 INFO L481 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-03-20 01:52:31,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:31,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:31,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:31,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:31,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:31,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:31,292 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-20 01:52:31,293 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:31,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 382237868, now seen corresponding path program 1 times [2025-03-20 01:52:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252184960] [2025-03-20 01:52:31,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:52:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-20 01:52:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 01:52:31,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:31,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 01:52:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:31,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252184960] [2025-03-20 01:52:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252184960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:31,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718963927] [2025-03-20 01:52:31,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:52:31,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:31,411 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-03-20 01:52:31,413 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-03-20 01:52:31,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-20 01:52:31,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 01:52:31,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:31,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:31,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 01:52:31,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 01:52:31,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 01:52:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718963927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:31,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-20 01:52:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3288204] [2025-03-20 01:52:31,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:31,576 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-20 01:52:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:31,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-20 01:52:31,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-20 01:52:31,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:31,578 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:31,578 INFO L481 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-03-20 01:52:31,578 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:31,578 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:31,578 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:31,578 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:31,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:31,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:31,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:31,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:31,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-20 01:52:31,848 WARN L461 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-03-20 01:52:31,848 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:31,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash 417458796, now seen corresponding path program 2 times [2025-03-20 01:52:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429479392] [2025-03-20 01:52:31,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:52:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:31,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-20 01:52:31,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-20 01:52:31,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:52:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:32,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429479392] [2025-03-20 01:52:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429479392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703095736] [2025-03-20 01:52:32,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:52:32,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:32,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:32,475 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-03-20 01:52:32,477 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-03-20 01:52:32,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-20 01:52:32,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-20 01:52:32,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:52:32,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:32,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-20 01:52:32,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:32,695 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:52:32,696 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-03-20 01:52:32,722 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-03-20 01:52:32,855 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-03-20 01:52:32,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:32,922 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-03-20 01:52:32,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:32,964 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-03-20 01:52:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:33,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:33,222 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-03-20 01:52:33,290 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-03-20 01:52:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703095736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:33,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-03-20 01:52:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138434550] [2025-03-20 01:52:33,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:33,424 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-20 01:52:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:33,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-20 01:52:33,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=527, Unknown=21, NotChecked=98, Total=756 [2025-03-20 01:52:33,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:33,426 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:33,426 INFO L481 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-03-20 01:52:33,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:33,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:33,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:33,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:33,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:33,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:33,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:33,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:33,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:33,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:33,677 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-03-20 01:52:33,876 WARN L461 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-03-20 01:52:33,876 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:33,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash 380455752, now seen corresponding path program 3 times [2025-03-20 01:52:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884685703] [2025-03-20 01:52:33,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:52:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:33,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 6 equivalence classes. [2025-03-20 01:52:33,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 67 statements. [2025-03-20 01:52:33,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-20 01:52:33,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884685703] [2025-03-20 01:52:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884685703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36933463] [2025-03-20 01:52:34,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:52:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:34,777 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-03-20 01:52:34,779 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-03-20 01:52:34,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 6 equivalence classes. [2025-03-20 01:52:34,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 67 statements. [2025-03-20 01:52:34,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-20 01:52:34,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:34,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-20 01:52:34,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:35,003 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:52:35,003 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-03-20 01:52:35,026 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-03-20 01:52:35,123 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-03-20 01:52:35,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:35,186 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-03-20 01:52:35,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:35,228 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-03-20 01:52:35,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:35,381 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-03-20 01:52:35,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:35,425 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-03-20 01:52:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:35,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:35,781 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-03-20 01:52:35,879 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-03-20 01:52:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36933463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:35,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 35 [2025-03-20 01:52:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655808155] [2025-03-20 01:52:35,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:35,948 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-20 01:52:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:35,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-20 01:52:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=983, Unknown=9, NotChecked=130, Total=1260 [2025-03-20 01:52:35,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:35,949 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:35,949 INFO L481 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-03-20 01:52:35,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:35,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:35,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:35,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:35,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:35,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:36,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:36,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-20 01:52:36,653 WARN L461 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-03-20 01:52:36,654 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:36,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1887151652, now seen corresponding path program 4 times [2025-03-20 01:52:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537588832] [2025-03-20 01:52:36,654 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 01:52:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:36,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-03-20 01:52:36,697 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-20 01:52:36,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 01:52:36,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537588832] [2025-03-20 01:52:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537588832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361096755] [2025-03-20 01:52:37,493 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 01:52:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:37,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:37,495 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-03-20 01:52:37,496 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-03-20 01:52:37,562 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-03-20 01:52:38,199 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-20 01:52:38,199 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 01:52:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:38,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-20 01:52:38,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:38,289 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:52:38,289 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-03-20 01:52:38,307 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-03-20 01:52:38,399 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-03-20 01:52:38,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:38,450 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-03-20 01:52:38,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:38,484 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-03-20 01:52:38,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:38,602 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-03-20 01:52:38,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:38,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-03-20 01:52:38,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:38,741 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-03-20 01:52:38,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:38,775 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-03-20 01:52:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:38,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:39,166 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-03-20 01:52:39,183 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-03-20 01:52:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361096755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:39,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:39,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2025-03-20 01:52:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664826907] [2025-03-20 01:52:39,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:39,302 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-20 01:52:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:39,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-20 01:52:39,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1242, Unknown=14, NotChecked=146, Total=1560 [2025-03-20 01:52:39,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:39,303 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:39,303 INFO L481 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-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:39,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:39,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:52:39,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-20 01:52:39,956 WARN L461 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-03-20 01:52:39,957 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:39,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1896610560, now seen corresponding path program 5 times [2025-03-20 01:52:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863079157] [2025-03-20 01:52:39,957 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 01:52:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:39,974 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 6 equivalence classes. [2025-03-20 01:52:40,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 107 of 107 statements. [2025-03-20 01:52:40,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-20 01:52:40,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863079157] [2025-03-20 01:52:41,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863079157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938083308] [2025-03-20 01:52:41,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 01:52:41,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:41,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:41,097 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-03-20 01:52:41,099 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-03-20 01:52:41,173 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 6 equivalence classes. [2025-03-20 01:52:45,662 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 107 of 107 statements. [2025-03-20 01:52:45,662 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-20 01:52:45,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:45,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-20 01:52:45,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:45,732 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:52:45,733 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-03-20 01:52:45,751 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-03-20 01:52:45,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 16 treesize of output 11 [2025-03-20 01:52:45,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:45,908 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-03-20 01:52:45,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:45,939 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-03-20 01:52:46,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:46,068 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-03-20 01:52:46,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:46,103 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-03-20 01:52:46,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:46,219 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-03-20 01:52:46,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:46,254 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-03-20 01:52:46,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:46,361 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-03-20 01:52:46,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:46,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-03-20 01:52:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:46,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:46,946 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-03-20 01:52:47,017 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-03-20 01:52:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938083308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:47,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 47 [2025-03-20 01:52:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331699039] [2025-03-20 01:52:47,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:47,126 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-20 01:52:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:47,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-20 01:52:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1878, Unknown=26, NotChecked=178, Total=2256 [2025-03-20 01:52:47,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:47,127 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:47,127 INFO L481 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-03-20 01:52:47,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:47,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:47,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:47,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:47,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:47,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:47,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:52:47,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:52:47,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:52:47,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-20 01:52:47,973 WARN L461 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-03-20 01:52:47,973 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:47,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1919071780, now seen corresponding path program 6 times [2025-03-20 01:52:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864958408] [2025-03-20 01:52:47,974 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 01:52:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:47,990 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 127 statements into 6 equivalence classes. [2025-03-20 01:52:48,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 127 of 127 statements. [2025-03-20 01:52:48,054 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-20 01:52:48,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864958408] [2025-03-20 01:52:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864958408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138635978] [2025-03-20 01:52:49,640 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-20 01:52:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:49,642 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-03-20 01:52:49,642 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-03-20 01:52:49,718 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 127 statements into 6 equivalence classes. [2025-03-20 01:52:51,817 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 127 of 127 statements. [2025-03-20 01:52:51,817 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-20 01:52:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:51,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-20 01:52:51,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:51,893 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:52:51,893 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-03-20 01:52:51,917 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-03-20 01:52:52,014 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-03-20 01:52:52,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,067 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-03-20 01:52:52,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,100 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-03-20 01:52:52,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,248 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-03-20 01:52:52,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,283 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-03-20 01:52:52,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,414 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-03-20 01:52:52,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,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-03-20 01:52:52,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,564 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-03-20 01:52:52,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,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-03-20 01:52:52,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,712 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-03-20 01:52:52,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:52,747 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-03-20 01:52:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:52,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:52:53,536 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-03-20 01:52:53,617 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-03-20 01:52:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138635978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:52:53,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:52:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 56 [2025-03-20 01:52:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225510306] [2025-03-20 01:52:53,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:52:53,723 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-20 01:52:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:52:53,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-20 01:52:53,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2725, Unknown=26, NotChecked=214, Total=3192 [2025-03-20 01:52:53,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:53,725 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:52:53,725 INFO L481 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-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:52:53,725 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:52:54,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:52:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:52:54,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-20 01:52:55,067 WARN L461 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-03-20 01:52:55,067 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:52:55,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:52:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 636392120, now seen corresponding path program 7 times [2025-03-20 01:52:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:52:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836228463] [2025-03-20 01:52:55,068 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 01:52:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:52:55,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-20 01:52:55,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-20 01:52:55,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:55,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:52:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836228463] [2025-03-20 01:52:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836228463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:52:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685605004] [2025-03-20 01:52:56,328 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-20 01:52:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:52:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:52:56,330 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-03-20 01:52:56,331 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-03-20 01:52:56,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-20 01:52:56,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-20 01:52:56,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:52:56,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:52:56,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-20 01:52:56,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:52:56,534 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:52:56,534 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-03-20 01:52:56,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 16 treesize of output 11 [2025-03-20 01:52:56,652 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-03-20 01:52:56,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:56,701 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-03-20 01:52:56,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:56,732 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-03-20 01:52:56,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:56,863 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-03-20 01:52:56,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:56,896 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-03-20 01:52:57,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,012 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-03-20 01:52:57,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,045 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-03-20 01:52:57,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,154 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-03-20 01:52:57,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,184 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-03-20 01:52:57,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,301 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-03-20 01:52:57,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,333 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-03-20 01:52:57,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,448 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-03-20 01:52:57,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:52:57,478 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-03-20 01:52:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:52:57,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:53:00,401 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-03-20 01:53:00,405 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|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 168 |c_~#cache~0.offset|)) 0)) is different from false [2025-03-20 01:53:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685605004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:53:00,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:53:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 57 [2025-03-20 01:53:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323803210] [2025-03-20 01:53:00,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:53:00,517 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-20 01:53:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:53:00,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-20 01:53:00,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2835, Unknown=25, NotChecked=218, Total=3306 [2025-03-20 01:53:00,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:53:00,518 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:53:00,519 INFO L481 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-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:53:00,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:53:01,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:53:01,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:53:01,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-20 01:53:01,816 WARN L461 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-03-20 01:53:01,816 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:53:01,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:53:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1144968596, now seen corresponding path program 8 times [2025-03-20 01:53:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:53:01,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294200961] [2025-03-20 01:53:01,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:53:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:53:01,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-20 01:53:01,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-03-20 01:53:01,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:53:01,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:53:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:53:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294200961] [2025-03-20 01:53:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294200961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:53:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113801339] [2025-03-20 01:53:03,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:53:03,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:53:03,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:53:03,468 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-03-20 01:53:03,469 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-03-20 01:53:03,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-20 01:53:03,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 167 of 167 statements. [2025-03-20 01:53:03,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:53:03,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:53:03,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-20 01:53:03,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:53:03,712 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:53:03,712 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-03-20 01:53:03,742 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-03-20 01:53:03,866 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-03-20 01:53:03,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:03,929 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-03-20 01:53:03,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:03,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 23 treesize of output 11 [2025-03-20 01:53:04,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,099 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-03-20 01:53:04,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,132 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-03-20 01:53:04,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,253 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-03-20 01:53:04,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,286 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-03-20 01:53:04,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,425 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-03-20 01:53:04,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,467 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-03-20 01:53:04,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53: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-03-20 01:53:04,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,642 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-03-20 01:53:04,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,778 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-03-20 01:53:04,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,812 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-03-20 01:53:04,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,940 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-03-20 01:53:04,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:04,973 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-03-20 01:53:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:05,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:53:06,223 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1541 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1538))) (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_1541))) |c_~#cache~0.base|) (+ 196 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-03-20 01:53:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113801339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:53:06,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:53:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 62 [2025-03-20 01:53:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985992711] [2025-03-20 01:53:06,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:53:06,497 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-20 01:53:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:53:06,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-20 01:53:06,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3492, Unknown=42, NotChecked=120, Total=3906 [2025-03-20 01:53:06,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:53:06,499 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:53:06,500 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 7.380952380952381) internal successors, (465), 62 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-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:53:06,500 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:53:07,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:53:07,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-20 01:53:07,854 WARN L461 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-03-20 01:53:07,854 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:53:07,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:53:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1565332080, now seen corresponding path program 9 times [2025-03-20 01:53:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:53:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044937562] [2025-03-20 01:53:07,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:53:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:53:07,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 9 equivalence classes. [2025-03-20 01:53:07,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 187 of 187 statements. [2025-03-20 01:53:07,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-20 01:53:07,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:53:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:53:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044937562] [2025-03-20 01:53:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044937562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:53:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312789281] [2025-03-20 01:53:10,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:53:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:53:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:53:10,291 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-03-20 01:53:10,293 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-03-20 01:53:10,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 9 equivalence classes. [2025-03-20 01:53:39,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 187 of 187 statements. [2025-03-20 01:53:39,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-20 01:53:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:53:39,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-03-20 01:53:39,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:53:39,501 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:53:39,501 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-03-20 01:53:39,545 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-03-20 01:53:39,680 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-03-20 01:53:39,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:39,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:39,748 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-03-20 01:53:39,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:39,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:39,791 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-03-20 01:53:39,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:39,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:39,976 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-03-20 01:53:40,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,018 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-03-20 01:53:40,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,176 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-03-20 01:53:40,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,223 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-03-20 01:53:40,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,384 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-03-20 01:53:40,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,441 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-03-20 01:53:40,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,638 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-03-20 01:53:40,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:40,691 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-03-20 01:53:40,889 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-03-20 01:53:40,984 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-03-20 01:53:41,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:41,175 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-20 01:53:41,175 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-03-20 01:53:41,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:41,272 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-20 01:53:41,272 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-03-20 01:53:41,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:41,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 23 treesize of output 11 [2025-03-20 01:53:41,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:53:41,500 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-03-20 01:53:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:41,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:53:43,004 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-03-20 01:53:43,196 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1884 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1884) |c_~#cache~0.base|) (+ 224 |c_~#cache~0.offset|)) 0)) is different from false [2025-03-20 01:53:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312789281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:53:43,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:53:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 24] total 77 [2025-03-20 01:53:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254828598] [2025-03-20 01:53:43,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:53:43,282 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-20 01:53:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:53:43,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-20 01:53:43,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=5367, Unknown=18, NotChecked=298, Total=6006 [2025-03-20 01:53:43,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:53:43,284 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:53:43,284 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 6.730769230769231) internal successors, (525), 77 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-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:53:43,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:53:45,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-20 01:53:45,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-20 01:53:45,448 WARN L461 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-03-20 01:53:45,449 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:53:45,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:53:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash 274221388, now seen corresponding path program 10 times [2025-03-20 01:53:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:53:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914501728] [2025-03-20 01:53:45,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 01:53:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:53:45,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-03-20 01:53:45,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-03-20 01:53:45,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 01:53:45,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:53:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:53:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:53:48,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914501728] [2025-03-20 01:53:48,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914501728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:53:48,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882455384] [2025-03-20 01:53:48,182 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 01:53:48,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:53:48,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:53:48,184 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-03-20 01:53:48,189 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-03-20 01:53:48,314 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-03-20 01:55:42,195 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-03-20 01:55:42,195 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 01:55:42,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:55:42,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 172 conjuncts are in the unsatisfiable core [2025-03-20 01:55:42,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:55:42,409 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:55:42,409 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-03-20 01:55:42,452 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-03-20 01:55:42,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 51 treesize of output 36 [2025-03-20 01:55:42,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,765 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-03-20 01:55:42,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:42,845 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-03-20 01:55:43,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,162 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-03-20 01:55:43,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:43,243 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-03-20 01:55:43,512 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-03-20 01:55:43,625 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-03-20 01:55:43,913 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-03-20 01:55:44,028 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-03-20 01:55:44,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,318 INFO L325 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-03-20 01:55:44,319 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-03-20 01:55:44,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:44,506 INFO L325 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-03-20 01:55:44,506 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-03-20 01:55:44,852 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-03-20 01:55:44,970 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-03-20 01:55:45,253 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-03-20 01:55:45,369 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-03-20 01:55:45,678 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-03-20 01:55:45,780 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-03-20 01:55:46,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:46,086 INFO L325 Elim1Store]: treesize reduction 48, result has 41.5 percent of original size [2025-03-20 01:55:46,087 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-03-20 01:55:46,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:55:46,258 INFO L325 Elim1Store]: treesize reduction 48, result has 41.5 percent of original size [2025-03-20 01:55:46,258 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-03-20 01:55:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:55:46,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:55:47,967 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2270 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2266))) (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_2270))) |c_~#cache~0.base|) (+ 252 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0)) is different from false [2025-03-20 01:55:48,158 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-03-20 01:55:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:55:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882455384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:55:48,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:55:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37, 27] total 92 [2025-03-20 01:55:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161025801] [2025-03-20 01:55:48,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:55:48,250 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-03-20 01:55:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:55:48,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-03-20 01:55:48,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=7638, Unknown=40, NotChecked=358, Total=8556 [2025-03-20 01:55:48,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:55:48,255 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:55:48,255 INFO L481 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-03-20 01:55:48,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:55:48,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:55:48,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:55:48,255 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-03-20 01:55:48,256 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:55:51,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-20 01:55:51,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-20 01:55:51,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-20 01:55:51,324 WARN L461 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-03-20 01:55:51,324 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:55:51,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:55:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash -417367512, now seen corresponding path program 11 times [2025-03-20 01:55:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:55:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280891103] [2025-03-20 01:55:51,325 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 01:55:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:55:51,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 227 statements into 11 equivalence classes. [2025-03-20 01:55:51,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 227 of 227 statements. [2025-03-20 01:55:51,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-20 01:55:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:55:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 910 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:55:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:55:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280891103] [2025-03-20 01:55:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280891103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:55:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:55:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-20 01:55:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284593046] [2025-03-20 01:55:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:55:51,599 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-20 01:55:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:55:51,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-20 01:55:51,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-20 01:55:51,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:55:51,599 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:55:51,599 INFO L481 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-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-03-20 01:55:51,599 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-20 01:56:03,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:56:03,034 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-20 01:56:03,034 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:03,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -543670945, now seen corresponding path program 1 times [2025-03-20 01:56:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849965250] [2025-03-20 01:56:03,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:03,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-20 01:56:03,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-20 01:56:03,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:03,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-20 01:56:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:03,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849965250] [2025-03-20 01:56:03,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849965250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:03,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:56:03,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:56:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635272371] [2025-03-20 01:56:03,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:03,083 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 01:56:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:03,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 01:56:03,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-20 01:56:03,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:03,084 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:03,084 INFO L481 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-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:56:03,084 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:08,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:08,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:56:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:56:08,617 INFO L791 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-20 01:56:08,617 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-20 01:56:08,621 INFO L422 BasicCegarLoop]: Path program histogram: [11, 2, 1, 1] [2025-03-20 01:56:08,622 INFO L320 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2025-03-20 01:56:08,624 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:56:08,625 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:56:08,625 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:56:08,625 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;@186b32b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:56:08,626 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-20 01:56:08,628 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-03-20 01:56:08,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash -967948563, now seen corresponding path program 1 times [2025-03-20 01:56:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430768295] [2025-03-20 01:56:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:08,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-20 01:56:08,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-20 01:56:08,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:08,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430768295] [2025-03-20 01:56:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430768295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:56:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:56:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641389509] [2025-03-20 01:56:08,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:08,647 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:56:08,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:08,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:56:08,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:56:08,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:08,648 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:08,648 INFO L481 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-03-20 01:56:08,648 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:08,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:08,660 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-20 01:56:08,661 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-03-20 01:56:08,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash -267062605, now seen corresponding path program 1 times [2025-03-20 01:56:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:08,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454623684] [2025-03-20 01:56:08,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:08,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-20 01:56:08,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-20 01:56:08,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:08,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:08,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:08,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454623684] [2025-03-20 01:56:08,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454623684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:08,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549311631] [2025-03-20 01:56:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:08,679 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-03-20 01:56:08,681 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-03-20 01:56:08,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-20 01:56:08,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-20 01:56:08,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:08,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:08,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 01:56:08,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:08,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:56:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549311631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:56:08,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:56:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-20 01:56:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548924445] [2025-03-20 01:56:08,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:56:08,810 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-20 01:56:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-20 01:56:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-20 01:56:08,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:08,810 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:08,810 INFO L481 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-03-20 01:56:08,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:08,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:08,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:08,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:08,837 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-03-20 01:56:09,030 WARN L461 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-03-20 01:56:09,031 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-03-20 01:56:09,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1484654701, now seen corresponding path program 2 times [2025-03-20 01:56:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548481201] [2025-03-20 01:56:09,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:56:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:09,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-20 01:56:09,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-20 01:56:09,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:56:09,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548481201] [2025-03-20 01:56:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548481201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211563115] [2025-03-20 01:56:09,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:56:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:09,066 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-03-20 01:56:09,084 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-03-20 01:56:09,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-20 01:56:09,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-20 01:56:09,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:56:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:09,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 01:56:09,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:09,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:56:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211563115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:56:09,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:56:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-20 01:56:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335255395] [2025-03-20 01:56:09,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:56:09,239 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-20 01:56:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-20 01:56:09,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-20 01:56:09,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:09,239 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:09,240 INFO L481 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-03-20 01:56:09,240 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:09,240 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:09,240 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:09,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:09,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:09,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:09,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-20 01:56:09,464 WARN L461 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-03-20 01:56:09,464 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-03-20 01:56:09,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1121860947, now seen corresponding path program 3 times [2025-03-20 01:56:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214501699] [2025-03-20 01:56:09,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:56:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:09,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-03-20 01:56:09,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 01:56:09,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-20 01:56:09,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:56:09,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:56:09,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-20 01:56:09,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-20 01:56:09,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:09,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:56:09,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:56:09,502 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:56:09,502 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-20 01:56:09,502 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-20 01:56:09,502 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-20 01:56:09,502 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-20 01:56:09,503 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-20 01:56:09,504 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2025-03-20 01:56:09,504 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:56:09,505 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-20 01:56:09,522 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 01:56:09,526 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:56:09,534 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:56:09,535 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2025-03-20 01:56:09,535 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;@186b32b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:56:09,535 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-20 01:56:09,834 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:09,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 445206564, now seen corresponding path program 1 times [2025-03-20 01:56:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746994312] [2025-03-20 01:56:09,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:09,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-20 01:56:09,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-20 01:56:09,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:09,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746994312] [2025-03-20 01:56:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746994312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:56:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:56:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570240791] [2025-03-20 01:56:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:09,861 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:56:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:09,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:56:09,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:56:09,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:09,862 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:09,862 INFO L481 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-03-20 01:56:09,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:10,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:10,479 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-20 01:56:10,479 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:10,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1401366674, now seen corresponding path program 1 times [2025-03-20 01:56:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354400689] [2025-03-20 01:56:10,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-20 01:56:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-20 01:56:10,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:10,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354400689] [2025-03-20 01:56:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354400689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377889299] [2025-03-20 01:56:10,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:10,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:10,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:10,532 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-03-20 01:56:10,533 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-03-20 01:56:10,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-20 01:56:10,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-20 01:56:10,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:10,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:10,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 01:56:10,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:10,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:56:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:56:10,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377889299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:56:10,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:56:10,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-20 01:56:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347788859] [2025-03-20 01:56:10,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:56:10,757 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-20 01:56:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:10,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-20 01:56:10,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-20 01:56:10,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:10,758 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:10,758 INFO L481 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-03-20 01:56:10,758 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:10,758 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:10,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:10,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:10,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-20 01:56:11,003 WARN L461 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-03-20 01:56:11,003 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:11,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash -455298675, now seen corresponding path program 2 times [2025-03-20 01:56:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441456011] [2025-03-20 01:56:11,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:56:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:11,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-03-20 01:56:11,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 181 of 185 statements. [2025-03-20 01:56:11,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:56:11,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-20 01:56:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:11,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441456011] [2025-03-20 01:56:11,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441456011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:11,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:56:11,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-20 01:56:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277508384] [2025-03-20 01:56:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:11,346 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 01:56:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:11,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 01:56:11,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-20 01:56:11,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:11,346 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:11,346 INFO L481 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-03-20 01:56:11,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:11,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:11,346 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:11,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:11,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:11,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:11,510 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-20 01:56:11,510 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:11,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1441418110, now seen corresponding path program 1 times [2025-03-20 01:56:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830174739] [2025-03-20 01:56:11,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:11,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-20 01:56:11,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-20 01:56:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 01:56:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830174739] [2025-03-20 01:56:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830174739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238313844] [2025-03-20 01:56:11,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:11,644 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-03-20 01:56:11,645 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-03-20 01:56:11,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-20 01:56:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-20 01:56:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:11,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:11,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 01:56:11,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 01:56:11,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:56:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 01:56:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238313844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:56:11,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:56:11,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-20 01:56:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002326839] [2025-03-20 01:56:11,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:56:11,916 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-20 01:56:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:11,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-20 01:56:11,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-20 01:56:11,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:11,916 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:11,916 INFO L481 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-03-20 01:56:11,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:11,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:11,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:11,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:11,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:11,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:11,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:11,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:11,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-20 01:56:12,191 WARN L461 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-03-20 01:56:12,191 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:12,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1276402914, now seen corresponding path program 2 times [2025-03-20 01:56:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:12,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027998423] [2025-03-20 01:56:12,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:56:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:12,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-20 01:56:12,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 220 statements. [2025-03-20 01:56:12,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:56:12,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-20 01:56:12,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:12,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027998423] [2025-03-20 01:56:12,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027998423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:12,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:56:12,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-20 01:56:12,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503528573] [2025-03-20 01:56:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:12,282 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-20 01:56:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:12,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-20 01:56:12,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-20 01:56:12,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:12,282 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:12,282 INFO L481 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-03-20 01:56:12,282 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:12,282 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:12,282 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:12,282 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:12,282 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:12,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:12,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:12,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:12,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:12,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:12,425 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-20 01:56:12,425 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:12,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1231042476, now seen corresponding path program 1 times [2025-03-20 01:56:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859741547] [2025-03-20 01:56:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:12,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-20 01:56:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-20 01:56:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-20 01:56:12,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:12,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859741547] [2025-03-20 01:56:12,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859741547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:12,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:56:12,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-20 01:56:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774089640] [2025-03-20 01:56:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:12,887 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-20 01:56:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:12,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-20 01:56:12,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-20 01:56:12,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:12,888 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:12,888 INFO L481 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-03-20 01:56:12,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:12,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:12,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:12,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:12,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:12,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:13,012 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-20 01:56:13,012 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:13,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:13,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2032322536, now seen corresponding path program 1 times [2025-03-20 01:56:13,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:13,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576148374] [2025-03-20 01:56:13,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:13,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-20 01:56:13,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-20 01:56:13,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:13,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:56:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576148374] [2025-03-20 01:56:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576148374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017599700] [2025-03-20 01:56:13,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:56:13,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:13,144 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-03-20 01:56:13,145 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-03-20 01:56:13,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-20 01:56:13,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-20 01:56:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:56:13,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:13,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-20 01:56:13,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:56:13,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:56:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:56:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017599700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 01:56:13,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 01:56:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-20 01:56:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961214535] [2025-03-20 01:56:13,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 01:56:13,661 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-20 01:56:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:13,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-20 01:56:13,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-20 01:56:13,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:13,662 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:13,662 INFO L481 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-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:13,662 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:13,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:13,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:13,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:13,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:13,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:13,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:13,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-20 01:56:13,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-20 01:56:14,069 WARN L461 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-03-20 01:56:14,069 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:14,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 838686548, now seen corresponding path program 2 times [2025-03-20 01:56:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968828232] [2025-03-20 01:56:14,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:56:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:14,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 592 statements into 2 equivalence classes. [2025-03-20 01:56:14,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 592 of 592 statements. [2025-03-20 01:56:14,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:56:14,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 630 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:56:14,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:14,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968828232] [2025-03-20 01:56:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968828232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:14,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72185708] [2025-03-20 01:56:14,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:56:14,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:14,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:14,904 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-03-20 01:56:14,905 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-03-20 01:56:15,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 592 statements into 2 equivalence classes. [2025-03-20 01:56:15,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 592 of 592 statements. [2025-03-20 01:56:15,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 01:56:15,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:15,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-20 01:56:15,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-20 01:56:15,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 01:56:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72185708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:56:15,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-20 01:56:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [21] total 22 [2025-03-20 01:56:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748909586] [2025-03-20 01:56:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:56:15,612 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-20 01:56:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:56:15,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-20 01:56:15,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2025-03-20 01:56:15,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:15,614 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:56:15,614 INFO L481 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-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-20 01:56:15,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-20 01:56:16,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 01:56:16,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-20 01:56:16,259 WARN L461 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-03-20 01:56:16,260 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 01:56:16,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:56:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2065895978, now seen corresponding path program 3 times [2025-03-20 01:56:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:56:16,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535353105] [2025-03-20 01:56:16,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:56:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:56:16,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 314 statements into 6 equivalence classes. [2025-03-20 01:56:16,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 308 of 314 statements. [2025-03-20 01:56:16,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-20 01:56:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:56:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:56:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535353105] [2025-03-20 01:56:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535353105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 01:56:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311835707] [2025-03-20 01:56:31,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 01:56:31,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 01:56:31,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:56:31,670 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-03-20 01:56:31,673 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-03-20 01:56:31,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 314 statements into 6 equivalence classes. [2025-03-20 01:56:44,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 308 of 314 statements. [2025-03-20 01:56:44,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-20 01:56:44,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:56:44,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 232 conjuncts are in the unsatisfiable core [2025-03-20 01:56:44,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 01:56:44,909 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 01:56:44,909 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-03-20 01:56:44,977 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-03-20 01:56:45,186 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-03-20 01:56:45,335 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-03-20 01:56:45,476 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-03-20 01:56:45,629 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-03-20 01:56:46,116 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-03-20 01:56:46,285 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-03-20 01:56:46,561 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-03-20 01:56:46,721 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-03-20 01:56:46,974 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-03-20 01:56:47,167 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-03-20 01:56:47,635 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-03-20 01:56:47,788 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-03-20 01:56:47,963 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-03-20 01:56:48,315 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-03-20 01:56:48,731 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-03-20 01:56:48,831 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-03-20 01:56:49,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:49,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:49,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:49,282 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-03-20 01:56:49,361 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-03-20 01:56:49,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:49,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:49,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:49,445 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-03-20 01:56:49,687 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-03-20 01:56:50,222 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-03-20 01:56:50,319 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-03-20 01:56:50,674 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-03-20 01:56:50,940 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-03-20 01:56:51,185 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-03-20 01:56:51,422 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-03-20 01:56:51,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:51,843 INFO L325 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2025-03-20 01:56:51,843 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-03-20 01:56:52,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:52,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:52,024 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-03-20 01:56:52,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:52,158 INFO L325 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2025-03-20 01:56:52,159 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-03-20 01:56:52,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:52,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 01:56:52,401 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-03-20 01:56:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 01:56:52,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 01:56:55,949 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-03-20 01:56:57,984 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-03-20 01:57:00,056 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-03-20 01:57:02,064 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-03-20 01:57:04,099 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-03-20 01:57:06,139 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-03-20 01:57:08,199 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-03-20 01:57:10,210 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-03-20 01:57:12,224 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-03-20 01:57:14,261 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-03-20 01:57:16,277 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-03-20 01:57:18,317 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-03-20 01:57:20,350 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-03-20 01:57:22,397 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-03-20 01:57:24,461 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-03-20 01:57:26,474 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-03-20 01:57:28,524 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-03-20 01:57:30,591 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-03-20 01:59:12,191 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-03-20 01:59:14,219 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-03-20 01:59:16,247 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-03-20 01:59:18,349 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-03-20 01:59:20,423 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-03-20 01:59:22,495 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-03-20 01:59:24,655 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-03-20 01:59:26,675 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-03-20 01:59:28,763 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 [2025-03-20 01:59:30,828 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|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 |c_~#cache~0.offset|))) (store (let ((.cse10 (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse14 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse14 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse14 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse11 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11)))) .cse13 v_ArrVal_5701))) (.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) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-03-20 01:59:32,880 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 ((.cse14 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ .cse14 |c_~#cache~0.offset|))) (store (let ((.cse9 (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse13 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse13 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse13 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|)) (.cse10 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10)))) .cse12 v_ArrVal_5701))) (.cse8 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 84 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ 112 .cse2 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 56 .cse14 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 140 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 196 .cse2 |c_~#cache~0.offset|))) 0) (< (+ .cse14 28 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 84 .cse14 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-03-20 01:59:34,910 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 ((.cse14 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ .cse14 28 |c_~#cache~0.offset|))) (store (let ((.cse9 (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse13 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse13 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse13 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|)) (.cse10 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10)))) .cse12 v_ArrVal_5701))) (.cse8 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 84 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ 112 .cse2 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 84 .cse14 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 140 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 196 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 112 .cse14 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse14 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2025-03-20 01:59:36,996 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_ArrVal_5695 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse15 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ .cse15 28 |c_~#cache~0.offset|))) (store (let ((.cse9 (select (let ((.cse13 (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_5695)))) (store .cse13 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse14 (select .cse13 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse14 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse14 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse10 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10)))) .cse12 v_ArrVal_5701))) (.cse8 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 84 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ 112 .cse2 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 84 .cse15 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 140 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 196 .cse2 |c_~#cache~0.offset|))) 0) (< (+ 112 .cse15 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse15 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2025-03-20 02:01:01,028 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_ArrVal_5695 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 (< (+ 112 .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 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (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_5695)) |c_~#cache~0.base|))) (let ((.cse10 (let ((.cse15 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 112 .cse3 |c_~#cache~0.offset|))) (let ((.cse6 (store (store .cse4 .cse5 (+ (select (store .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ 1 (select .cse4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|))) .cse5) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse7 (+ 140 .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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ .cse3 168 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 224 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2025-03-20 02:01:03,128 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_ArrVal_5695 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 (< (+ 112 .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 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (select (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse17 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5695))) |c_~#cache~0.base|))) (let ((.cse10 (let ((.cse15 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 112 .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 (+ 140 .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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ .cse3 168 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 224 |c_~#cache~0.offset|))) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2025-03-20 02:01:05,217 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_ArrVal_5695 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 (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (select (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse17 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5695))) |c_~#cache~0.base|))) (let ((.cse10 (let ((.cse15 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ 1 (select .cse14 .cse11))))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 112 .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 (+ 140 .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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ .cse3 168 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 224 |c_~#cache~0.offset|))) 0)))) is different from false [2025-03-20 02:01:07,348 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_ArrVal_5695 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 (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (select (let ((.cse16 (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse17 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse18 (+ .cse3 |c_~#cache~0.offset|))) (store .cse17 .cse18 (select .cse17 .cse18)))))) (store .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5695))) |c_~#cache~0.base|))) (let ((.cse10 (let ((.cse15 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 112 .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 (+ 140 .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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ .cse3 168 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse3 224 |c_~#cache~0.offset|))) 0)))) is different from false [2025-03-20 02:01:09,371 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_ArrVal_5695 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 (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (select (let ((.cse16 (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse17 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse18 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse17 .cse18 (select .cse17 .cse18)))))) (store .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5695))) |c_~#cache~0.base|))) (let ((.cse10 (let ((.cse15 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 140 .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 (+ .cse3 168 |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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 196 .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 252 |c_~#cache~0.offset|))) 0)))) is different from false [2025-03-20 02:01:11,459 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_ArrVal_5695 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 (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= 0 (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (select (let ((.cse16 (let ((.cse17 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse20 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse20 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse20 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse17 |c_~#cache~0.base| (let ((.cse18 (select .cse17 |c_~#cache~0.base|)) (.cse19 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse18 .cse19 (select .cse18 .cse19))))))) (store .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_5695))) |c_~#cache~0.base|))) (let ((.cse10 (let ((.cse15 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 140 .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 (+ .cse3 168 |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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 196 .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 252 |c_~#cache~0.offset|))))))) is different from false [2025-03-20 02:01:13,494 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_ArrVal_5695 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse18 (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (or (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ .cse18 28 |c_~#cache~0.offset|))) (store (let ((.cse13 (store (let ((.cse15 (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse17 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse16 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse15 .cse16 (select .cse15 .cse16))) (+ .cse18 |c_~#cache~0.offset|) v_ArrVal_5695))) (let ((.cse9 (let ((.cse14 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse13 .cse14 (select .cse13 .cse14)))) (.cse10 (+ 84 .cse2 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse13 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10))))) .cse12 v_ArrVal_5701))) (.cse8 (+ 112 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 140 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ .cse2 168 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 84 .cse18 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 196 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse2 252 |c_~#cache~0.offset|))) 0) (< (+ 112 .cse18 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse18 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2025-03-20 02:01:15,553 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_ArrVal_5695 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 (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= 0 (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (store (let ((.cse16 (select (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| (select .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|)) (.cse17 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse16 .cse17 (select .cse16 .cse17))) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_5695))) (let ((.cse10 (let ((.cse15 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 140 .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 (+ .cse3 168 |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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 196 .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 252 |c_~#cache~0.offset|))))))) is different from false [2025-03-20 02:01:17,601 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5688 (Array Int Int)) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_5695 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 (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= 0 (let ((.cse3 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse1 (store (let ((.cse4 (let ((.cse8 (let ((.cse13 (+ .cse0 28 |c_~#cache~0.offset|))) (store (let ((.cse14 (store (let ((.cse16 (select (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5688))) (store .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse19 (select .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse19 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse19 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse17 (+ .cse3 28 |c_~#cache~0.offset|))) (store .cse16 .cse17 (select .cse16 .cse17))) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_5695))) (let ((.cse10 (let ((.cse15 (+ 56 .cse3 |c_~#cache~0.offset|))) (store .cse14 .cse15 (select .cse14 .cse15)))) (.cse11 (+ 84 .cse3 |c_~#cache~0.offset|))) (store .cse10 .cse11 (+ (- 1) (select (let ((.cse12 (store .cse10 .cse11 (+ (select .cse14 .cse11) 1)))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse11))))) .cse13 v_ArrVal_5701))) (.cse9 (+ 112 .cse3 |c_~#cache~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse5 (+ 140 .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 (+ .cse3 168 |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)))) (+ 84 .cse0 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse2 (+ 196 .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 252 |c_~#cache~0.offset|))))))) is different from false [2025-03-20 02:01:17,626 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5688 (Array Int 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_5695 Int) (v_ArrVal_5708 Int)) (or (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 112 |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 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ 28 |c_~#cache~0.offset|))) (store (let ((.cse13 (store (let ((.cse15 (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5688))) (store .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse18 (select .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse16 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse15 .cse16 (select .cse15 .cse16))) |c_~#cache~0.offset| v_ArrVal_5695))) (let ((.cse9 (let ((.cse14 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse13 .cse14 (select .cse13 .cse14)))) (.cse10 (+ 84 .cse2 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse13 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10))))) .cse12 v_ArrVal_5701))) (.cse8 (+ 112 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 140 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ .cse2 168 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 84 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 196 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse2 252 |c_~#cache~0.offset|))) 0))) is different from false [2025-03-20 02:01:17,700 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5688 (Array Int Int)) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_5695 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (or (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (< (+ 112 |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 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ 28 |c_~#cache~0.offset|))) (store (let ((.cse13 (store (let ((.cse15 (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5688))) (store .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse18 (select .cse17 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse18 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse16 (+ .cse2 28 |c_~#cache~0.offset|))) (store .cse15 .cse16 (select .cse15 .cse16))) |c_~#cache~0.offset| v_ArrVal_5695))) (let ((.cse9 (let ((.cse14 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse13 .cse14 (select .cse13 .cse14)))) (.cse10 (+ 84 .cse2 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse13 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10))))) .cse12 v_ArrVal_5701))) (.cse8 (+ 112 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 140 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ .cse2 168 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 84 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 196 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse2 252 |c_~#cache~0.offset|))) 0))) is different from false [2025-03-20 02:01:17,769 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5688 (Array Int Int)) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_5695 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (or (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (let ((.cse2 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (select (store (let ((.cse0 (store (let ((.cse3 (let ((.cse7 (let ((.cse12 (+ 28 |c_~#cache~0.offset|))) (store (let ((.cse13 (store (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5688) |c_~#cache~0.base|)) (.cse17 (+ .cse2 28 |c_~#cache~0.offset|))) (store (let ((.cse16 (+ .cse2 |c_~#cache~0.offset|))) (store .cse15 .cse16 (select .cse15 .cse16))) .cse17 (select .cse15 .cse17))) |c_~#cache~0.offset| v_ArrVal_5695))) (let ((.cse9 (let ((.cse14 (+ 56 .cse2 |c_~#cache~0.offset|))) (store .cse13 .cse14 (select .cse13 .cse14)))) (.cse10 (+ 84 .cse2 |c_~#cache~0.offset|))) (store .cse9 .cse10 (+ (- 1) (select (let ((.cse11 (store .cse9 .cse10 (+ (select .cse13 .cse10) 1)))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1))) .cse10))))) .cse12 v_ArrVal_5701))) (.cse8 (+ 112 .cse2 |c_~#cache~0.offset|))) (store .cse7 .cse8 (select .cse7 .cse8)))) (.cse4 (+ 140 .cse2 |c_~#cache~0.offset|))) (let ((.cse5 (store (store .cse3 .cse4 (+ (select (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse4) 1)) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse6 (+ .cse2 168 |c_~#cache~0.offset|))) (store (store (store .cse3 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708) .cse4 (+ (- 1) (select .cse5 .cse4))) .cse6 (select .cse5 .cse6)))) (+ 84 |c_~#cache~0.offset|) v_ArrVal_5714)) (.cse1 (+ 196 .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ .cse2 252 |c_~#cache~0.offset|))) 0) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|))) is different from false [2025-03-20 02:01:18,615 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5714 Int) (v_ArrVal_5688 (Array Int Int)) (v_ArrVal_5701 Int) (v_ArrVal_5723 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_5695 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_5708 Int)) (let ((.cse0 (+ 56 |c_~#cache~0.offset|)) (.cse10 (+ 112 |c_~#cache~0.offset|))) (or (< .cse0 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) (= (select (store (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5688) |c_~#cache~0.base|))) (let ((.cse6 (store (store .cse8 |c_~#cache~0.offset| v_ArrVal_5695) .cse0 (select .cse8 .cse0))) (.cse9 (+ 28 |c_~#cache~0.offset|)) (.cse11 (select .cse8 .cse10))) (let ((.cse1 (store (store (store .cse6 .cse9 v_ArrVal_5701) .cse10 .cse11) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse12 (+ 196 |c_~#cache~0.offset|))) (store (let ((.cse7 (+ 84 |c_~#cache~0.offset|))) (store (let ((.cse2 (+ 140 |c_~#cache~0.offset|))) (let ((.cse3 (store (let ((.cse5 (store (store (store .cse6 .cse7 (select .cse8 .cse7)) .cse9 v_ArrVal_5701) .cse10 .cse11))) (store .cse5 .cse2 (+ (select (store .cse5 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (select .cse5 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44|) 1)) .cse2) 1))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_5708)) (.cse4 (+ 168 |c_~#cache~0.offset|))) (store (store .cse1 .cse2 (+ (- 1) (select .cse3 .cse2))) .cse4 (select .cse3 .cse4)))) .cse7 v_ArrVal_5714)) .cse12 (select .cse1 .cse12))))) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_5723) (+ 252 |c_~#cache~0.offset|)) 0) (< .cse10 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_40|)))) is different from false [2025-03-20 02:01:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 106 not checked. [2025-03-20 02:01:18,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311835707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 02:01:18,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 02:01:18,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 53, 60] total 177 [2025-03-20 02:01:18,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816768691] [2025-03-20 02:01:18,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 02:01:18,956 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2025-03-20 02:01:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 02:01:18,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2025-03-20 02:01:18,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=16599, Unknown=135, NotChecked=13508, Total=31506 [2025-03-20 02:01:18,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:01:18,962 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 02:01:18,962 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 5.106741573033708) internal successors, (909), 177 states have internal predecessors, (909), 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-03-20 02:01:18,962 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:01:18,962 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:01:18,962 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:01:18,963 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-03-20 02:01:18,963 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 02:01:18,963 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:01:18,963 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-20 02:01:18,963 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-20 02:01:18,963 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-20 02:01:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2025-03-20 02:01:53,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-20 02:01:54,082 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-20 02:01:54,082 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-20 02:01:54,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 02:01:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2144529836, now seen corresponding path program 4 times [2025-03-20 02:01:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 02:01:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969336409] [2025-03-20 02:01:54,083 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 02:01:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 02:01:54,115 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 380 statements into 2 equivalence classes. [2025-03-20 02:01:56,265 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 380 of 380 statements. [2025-03-20 02:01:56,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 02:01:56,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 02:02:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-20 02:02:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 02:02:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969336409] [2025-03-20 02:02:09,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969336409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 02:02:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887733218] [2025-03-20 02:02:09,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 02:02:09,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 02:02:09,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 02:02:09,390 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 02:02:09,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-20 02:02:09,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 380 statements into 2 equivalence classes. Killed by 15