./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b03bd7cf Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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/pthread/queue_longest.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 22:41:31,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 22:41:31,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-10-28 22:41:31,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 22:41:31,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 22:41:31,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 22:41:31,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 22:41:31,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 22:41:31,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 22:41:31,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 22:41:31,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 22:41:31,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 22:41:31,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 22:41:31,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 22:41:31,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 22:41:31,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 22:41:31,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 22:41:31,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 22:41:31,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 22:41:31,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 22:41:31,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 22:41:31,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 22:41:31,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 22:41:31,708 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-28 22:41:31,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-28 22:41:31,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 22:41:31,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 22:41:31,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 22:41:31,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 22:41:31,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 22:41:31,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 22:41:31,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 22:41:31,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 22:41:31,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 22:41:31,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 22:41:31,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 22:41:31,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 22:41:31,715 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 22:41:31,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 22:41:31,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 22:41:31,715 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-28 22:41:31,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 22:41:31,717 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 22:41:31,717 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 22:41:31,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 ! overflow) ) 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2024-10-28 22:41:31,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 22:41:31,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 22:41:32,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 22:41:32,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 22:41:32,001 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 22:41:32,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_longest.i [2024-10-28 22:41:33,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 22:41:33,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 22:41:33,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2024-10-28 22:41:33,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/908fdfa5d/1cad0d9874f346438b53d0a48583b398/FLAG8ba23caf5 [2024-10-28 22:41:33,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/908fdfa5d/1cad0d9874f346438b53d0a48583b398 [2024-10-28 22:41:33,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 22:41:33,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 22:41:33,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 22:41:33,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 22:41:33,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 22:41:33,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:41:33" (1/1) ... [2024-10-28 22:41:33,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85380c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:33, skipping insertion in model container [2024-10-28 22:41:33,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:41:33" (1/1) ... [2024-10-28 22:41:33,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 22:41:34,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 22:41:34,432 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 22:41:34,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 22:41:34,622 INFO L204 MainTranslator]: Completed translation [2024-10-28 22:41:34,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34 WrapperNode [2024-10-28 22:41:34,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 22:41:34,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 22:41:34,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 22:41:34,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 22:41:34,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,795 INFO L138 Inliner]: procedures = 274, calls = 1659, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1864 [2024-10-28 22:41:34,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 22:41:34,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 22:41:34,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 22:41:34,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 22:41:34,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 22:41:34,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 22:41:34,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 22:41:34,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 22:41:34,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (1/1) ... [2024-10-28 22:41:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 22:41:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:41:34,985 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) [2024-10-28 22:41:34,991 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 [2024-10-28 22:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-28 22:41:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-28 22:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-28 22:41:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-28 22:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-28 22:41:35,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-28 22:41:35,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-28 22:41:35,033 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-28 22:41:35,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 22:41:35,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 22:41:35,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 22:41:35,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 22:41:35,036 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 22:41:35,204 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 22:41:35,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 22:41:36,986 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 22:41:36,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 22:42:05,092 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 22:42:05,093 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-28 22:42:05,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:42:05 BoogieIcfgContainer [2024-10-28 22:42:05,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 22:42:05,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 22:42:05,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 22:42:05,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 22:42:05,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:41:33" (1/3) ... [2024-10-28 22:42:05,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58137b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:42:05, skipping insertion in model container [2024-10-28 22:42:05,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:41:34" (2/3) ... [2024-10-28 22:42:05,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58137b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:42:05, skipping insertion in model container [2024-10-28 22:42:05,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:42:05" (3/3) ... [2024-10-28 22:42:05,104 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-10-28 22:42:05,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 22:42:05,121 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-28 22:42:05,121 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 22:42:05,238 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-28 22:42:05,293 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 22:42:05,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 22:42:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:42:05,296 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) [2024-10-28 22:42:05,297 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 [2024-10-28 22:42:05,335 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 22:42:05,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-10-28 22:42:05,353 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@11c3fcc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 22:42:05,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-28 22:42:05,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:05,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -356156547, now seen corresponding path program 1 times [2024-10-28 22:42:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809100403] [2024-10-28 22:42:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:08,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809100403] [2024-10-28 22:42:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809100403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 22:42:08,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866837239] [2024-10-28 22:42:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-28 22:42:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-28 22:42:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-28 22:42:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:08,176 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:08,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-28 22:42:08,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:08,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-28 22:42:08,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:08,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1844052889, now seen corresponding path program 1 times [2024-10-28 22:42:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:08,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330335849] [2024-10-28 22:42:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:08,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:10,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330335849] [2024-10-28 22:42:10,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330335849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:10,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:10,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 22:42:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368474881] [2024-10-28 22:42:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:10,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-28 22:42:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-28 22:42:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-28 22:42:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:10,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2024-10-28 22:42:10,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:10,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-28 22:42:11,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1686540228, now seen corresponding path program 1 times [2024-10-28 22:42:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:11,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538997053] [2024-10-28 22:42:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538997053] [2024-10-28 22:42:13,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538997053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:13,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:13,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 22:42:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536464160] [2024-10-28 22:42:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:13,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 22:42:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 22:42:13,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 22:42:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:13,594 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:13,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-10-28 22:42:13,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:13,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:13,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:15,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-28 22:42:15,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:15,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1337010171, now seen corresponding path program 1 times [2024-10-28 22:42:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611092125] [2024-10-28 22:42:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611092125] [2024-10-28 22:42:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611092125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 22:42:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490381178] [2024-10-28 22:42:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-28 22:42:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-28 22:42:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-28 22:42:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:15,593 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:15,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 22:42:15,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:15,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:15,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:15,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:16,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-28 22:42:16,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:16,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash -3816937, now seen corresponding path program 1 times [2024-10-28 22:42:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260921029] [2024-10-28 22:42:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260921029] [2024-10-28 22:42:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260921029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-28 22:42:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365818417] [2024-10-28 22:42:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-28 22:42:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-28 22:42:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-28 22:42:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:17,059 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:17,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 22:42:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:17,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:17,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-28 22:42:17,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1681622897, now seen corresponding path program 1 times [2024-10-28 22:42:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:17,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576199822] [2024-10-28 22:42:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576199822] [2024-10-28 22:42:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576199822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:42:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190798165] [2024-10-28 22:42:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:18,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:42:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:42:18,231 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) [2024-10-28 22:42:18,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-28 22:42:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:18,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 3467 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 22:42:18,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:42:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:18,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 22:42:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190798165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-28 22:42:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-28 22:42:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114253827] [2024-10-28 22:42:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 22:42:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:18,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 22:42:18,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-28 22:42:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:18,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:18,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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) [2024-10-28 22:42:18,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:18,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:18,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:18,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:18,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:18,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:19,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-28 22:42:19,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-28 22:42:19,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 590706246, now seen corresponding path program 1 times [2024-10-28 22:42:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639161504] [2024-10-28 22:42:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 22:42:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639161504] [2024-10-28 22:42:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639161504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:20,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 22:42:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419849771] [2024-10-28 22:42:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:20,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-28 22:42:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:20,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-28 22:42:20,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-28 22:42:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:20,213 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:20,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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) [2024-10-28 22:42:20,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:20,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-28 22:42:20,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1690894632, now seen corresponding path program 1 times [2024-10-28 22:42:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160977965] [2024-10-28 22:42:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 22:42:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160977965] [2024-10-28 22:42:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160977965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 22:42:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442214998] [2024-10-28 22:42:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 22:42:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 22:42:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 22:42:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:21,067 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:22,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-28 22:42:22,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1203290577, now seen corresponding path program 1 times [2024-10-28 22:42:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118415103] [2024-10-28 22:42:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118415103] [2024-10-28 22:42:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118415103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 22:42:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896601271] [2024-10-28 22:42:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 22:42:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 22:42:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 22:42:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:22,601 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:22,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-10-28 22:42:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:22,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:22,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-28 22:42:22,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:22,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1625422466, now seen corresponding path program 1 times [2024-10-28 22:42:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803607582] [2024-10-28 22:42:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803607582] [2024-10-28 22:42:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803607582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-28 22:42:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208900214] [2024-10-28 22:42:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 22:42:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 22:42:26,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-28 22:42:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:26,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:26,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 22:42:26,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:26,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:26,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:28,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-28 22:42:28,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1151507121, now seen corresponding path program 1 times [2024-10-28 22:42:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883786216] [2024-10-28 22:42:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883786216] [2024-10-28 22:42:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883786216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:31,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-28 22:42:31,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260151592] [2024-10-28 22:42:31,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:31,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 22:42:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 22:42:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-28 22:42:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:31,724 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:31,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 22:42:31,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:31,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:31,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:31,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:31,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:31,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:31,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:31,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:31,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:31,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:31,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:33,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-28 22:42:33,375 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1503346708, now seen corresponding path program 1 times [2024-10-28 22:42:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507376258] [2024-10-28 22:42:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:35,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:35,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507376258] [2024-10-28 22:42:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507376258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:42:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:42:35,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-28 22:42:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383637946] [2024-10-28 22:42:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:42:35,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 22:42:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 22:42:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-28 22:42:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:35,492 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:35,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:35,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:42:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:42:37,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-28 22:42:37,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:42:37,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:42:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1623926878, now seen corresponding path program 1 times [2024-10-28 22:42:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:42:37,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622950245] [2024-10-28 22:42:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:42:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:42:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622950245] [2024-10-28 22:42:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622950245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:42:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996448228] [2024-10-28 22:42:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:42:42,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:42:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:42:42,607 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) [2024-10-28 22:42:42,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-28 22:42:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:42:43,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-28 22:42:43,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:42:43,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-10-28 22:42:43,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:42:43,253 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:42:43,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:42:43,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:42:43,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-10-28 22:42:43,492 INFO L378 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 47 treesize of output 28 [2024-10-28 22:42:43,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,545 INFO L378 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 36 treesize of output 27 [2024-10-28 22:42:43,658 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:42:43,688 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:42:43,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:42:43,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:42:43,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-10-28 22:42:43,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:42:43,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 39 [2024-10-28 22:42:43,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:43,975 INFO L378 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 36 treesize of output 27 [2024-10-28 22:42:44,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:44,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:42:44,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:42:44,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-10-28 22:42:44,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:42:44,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2024-10-28 22:42:44,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-10-28 22:42:44,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:42:44,305 INFO L378 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 43 treesize of output 23 [2024-10-28 22:42:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:42:44,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:42:44,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< 0 (+ (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483650))))) is different from false [2024-10-28 22:42:44,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1)))))) is different from false [2024-10-28 22:42:44,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse3))) (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse2 .cse3)))))) is different from false [2024-10-28 22:42:44,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_414 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_414) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< 0 (+ (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse3) 2147483650)) (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse2 .cse3)) (< v_ArrVal_414 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) is different from false [2024-10-28 22:42:45,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_414) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< v_ArrVal_414 (+ (select .cse2 .cse1) 1)) (< 0 (+ (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483650)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|)))))) is different from false [2024-10-28 22:42:49,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_414) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|))) (or (< v_ArrVal_414 (+ (select .cse0 .cse1) 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38|) (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse4 .cse1)) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< 0 (+ 2147483650 (select (store (store (store .cse4 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1))))))))) is different from false [2024-10-28 22:42:49,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_409 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_409) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))))) (let ((.cse2 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_414) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38|) (< 0 (+ (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483650)) (< v_ArrVal_409 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< v_ArrVal_414 (+ (select .cse2 .cse1) 1)))))))) is different from false [2024-10-28 22:42:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-28 22:42:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996448228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:42:54,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:42:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 41 [2024-10-28 22:42:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597933089] [2024-10-28 22:42:54,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:42:54,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-28 22:42:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:42:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-28 22:42:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1070, Unknown=14, NotChecked=518, Total=1806 [2024-10-28 22:42:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:42:54,857 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:42:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.8333333333333335) internal successors, (161), 42 states have internal predecessors, (161), 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) [2024-10-28 22:42:54,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:54,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:42:54,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:42:54,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:42:54,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:42:54,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:05,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:43:05,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-28 22:43:05,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-28 22:43:06,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-28 22:43:06,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:43:06,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:43:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1197870349, now seen corresponding path program 1 times [2024-10-28 22:43:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:43:06,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247364047] [2024-10-28 22:43:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:43:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:43:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247364047] [2024-10-28 22:43:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247364047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:43:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506276275] [2024-10-28 22:43:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:11,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:43:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:43:11,352 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) [2024-10-28 22:43:11,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-28 22:43:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:11,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 3580 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-28 22:43:11,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:43:11,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-10-28 22:43:11,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:11,983 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:43:11,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:43:12,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,181 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:12,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-10-28 22:43:12,290 INFO L378 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 47 treesize of output 28 [2024-10-28 22:43:12,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,331 INFO L378 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 36 treesize of output 27 [2024-10-28 22:43:12,428 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:12,462 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:43:12,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:43:12,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:12,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-10-28 22:43:12,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:12,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 39 [2024-10-28 22:43:12,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,759 INFO L378 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 36 treesize of output 27 [2024-10-28 22:43:12,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:12,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:12,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-10-28 22:43:12,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:12,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2024-10-28 22:43:13,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-10-28 22:43:13,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:13,035 INFO L378 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 43 treesize of output 23 [2024-10-28 22:43:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:13,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:43:13,528 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647))))) is different from false [2024-10-28 22:43:13,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_513) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_513))))) is different from false [2024-10-28 22:43:16,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_513) (< (select (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)))))) is different from false [2024-10-28 22:43:16,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_513) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse3 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (select (store (store (store .cse3 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647)))))) is different from false [2024-10-28 22:43:16,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_513) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_513) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|))))))) is different from false [2024-10-28 22:43:16,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_508) (< (+ (select .cse0 .cse1) 1) v_ArrVal_513) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select (store (store (store .cse3 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|) (< (select .cse3 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|))))))) is different from false [2024-10-28 22:43:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-28 22:43:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506276275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:43:23,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:43:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 41 [2024-10-28 22:43:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160732843] [2024-10-28 22:43:23,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:43:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-28 22:43:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:43:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-28 22:43:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1096, Unknown=17, NotChecked=450, Total=1806 [2024-10-28 22:43:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:23,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:43:23,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 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) [2024-10-28 22:43:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-28 22:43:23,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-28 22:43:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-28 22:43:27,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-28 22:43:27,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:43:27,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:43:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:43:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash -102042440, now seen corresponding path program 1 times [2024-10-28 22:43:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:43:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243661087] [2024-10-28 22:43:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:27,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:43:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:43:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243661087] [2024-10-28 22:43:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243661087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:43:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428905118] [2024-10-28 22:43:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:31,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:43:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:43:31,445 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) [2024-10-28 22:43:31,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-28 22:43:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:31,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 3592 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-28 22:43:32,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:43:32,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-10-28 22:43:32,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:32,117 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:43:32,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:43:32,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:32,197 INFO L378 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 47 treesize of output 43 [2024-10-28 22:43:32,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:32,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-10-28 22:43:32,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,342 INFO L378 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 27 treesize of output 20 [2024-10-28 22:43:32,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:32,445 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-28 22:43:32,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-10-28 22:43:32,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,517 INFO L378 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 38 treesize of output 25 [2024-10-28 22:43:32,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:32,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-10-28 22:43:32,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,671 INFO L378 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 27 treesize of output 20 [2024-10-28 22:43:32,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:32,807 INFO L378 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 38 treesize of output 25 [2024-10-28 22:43:32,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:32,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-10-28 22:43:32,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:43:32,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:43:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:32,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:43:33,338 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) is different from false [2024-10-28 22:43:33,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) is different from false [2024-10-28 22:43:33,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_616) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) is different from false [2024-10-28 22:43:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-28 22:43:33,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428905118] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:43:33,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:43:33,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 37 [2024-10-28 22:43:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076461792] [2024-10-28 22:43:33,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:43:33,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-28 22:43:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:43:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-28 22:43:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1043, Unknown=10, NotChecked=210, Total=1482 [2024-10-28 22:43:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:33,846 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:43:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.473684210526316) internal successors, (170), 38 states have internal predecessors, (170), 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) [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-28 22:43:33,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-28 22:43:33,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:40,976 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) .cse2 v_ArrVal_518) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (v_ArrVal_518 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store (store (store .cse4 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) .cse2 v_ArrVal_518) (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse4 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)))))) is different from false [2024-10-28 22:43:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 22:43:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-28 22:43:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-28 22:43:41,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-28 22:43:41,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-28 22:43:41,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:43:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:43:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1131655652, now seen corresponding path program 1 times [2024-10-28 22:43:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:43:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032681871] [2024-10-28 22:43:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:43:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:44,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:43:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032681871] [2024-10-28 22:43:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032681871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:43:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219873967] [2024-10-28 22:43:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:44,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:43:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:43:44,910 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) [2024-10-28 22:43:44,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-28 22:43:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:45,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 3593 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-28 22:43:45,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:43:45,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-10-28 22:43:45,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:45,546 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:43:45,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:43:45,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:45,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:45,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:45,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:45,613 INFO L378 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 47 treesize of output 43 [2024-10-28 22:43:45,698 INFO L378 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 38 treesize of output 16 [2024-10-28 22:43:45,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:45,728 INFO L378 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 27 treesize of output 20 [2024-10-28 22:43:45,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:43:45,847 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-28 22:43:45,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-10-28 22:43:45,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:45,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:45,899 INFO L378 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 38 treesize of output 25 [2024-10-28 22:43:45,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:45,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-10-28 22:43:46,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:46,013 INFO L378 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 27 treesize of output 20 [2024-10-28 22:43:46,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:46,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:43:46,124 INFO L378 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 38 treesize of output 25 [2024-10-28 22:43:46,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:43:46,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-10-28 22:43:46,212 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:43:46,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:43:46,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:43:46,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-28 22:43:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:46,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:43:46,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse3)) 2147483647)))) is different from false [2024-10-28 22:43:46,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse3)) 2147483647)))) is different from false [2024-10-28 22:43:47,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647)))))) is different from false [2024-10-28 22:43:47,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_716 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_716) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) is different from false [2024-10-28 22:43:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-28 22:43:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219873967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:43:47,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:43:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 38 [2024-10-28 22:43:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808411064] [2024-10-28 22:43:47,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:43:47,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-28 22:43:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:43:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-28 22:43:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=968, Unknown=25, NotChecked=284, Total=1560 [2024-10-28 22:43:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:47,246 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:43:47,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.410256410256411) internal successors, (172), 39 states have internal predecessors, (172), 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) [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-28 22:43:47,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-28 22:43:47,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:52,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select .cse9 .cse10))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_716 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_716) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))) (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (or (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647))) (< .cse7 2147483647)))) is different from false [2024-10-28 22:43:53,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select .cse10 .cse11))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_716 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_716) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_727 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (< (select (let ((.cse7 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_727)) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647)) (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647))) (< .cse8 2147483647)))) is different from false [2024-10-28 22:43:55,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse2)) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-10-28 22:43:55,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse2)) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:43:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:43:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:43:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-28 22:43:56,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-28 22:43:56,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-28 22:43:56,408 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:43:56,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:43:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1349031956, now seen corresponding path program 1 times [2024-10-28 22:43:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:43:56,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667340128] [2024-10-28 22:43:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:43:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 44 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:56,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:43:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667340128] [2024-10-28 22:43:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667340128] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:43:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308768390] [2024-10-28 22:43:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:56,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:43:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:43:56,736 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) [2024-10-28 22:43:56,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-28 22:43:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:57,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 3870 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-28 22:43:57,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:43:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:43:57,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 22:43:57,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308768390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:43:57,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-28 22:43:57,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2024-10-28 22:43:57,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804313105] [2024-10-28 22:43:57,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:43:57,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-28 22:43:57,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:43:57,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-28 22:43:57,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-28 22:43:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:57,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:43:57,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 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) [2024-10-28 22:43:57,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:57,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:57,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:57,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:57,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:57,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-28 22:43:57,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:43:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:43:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-28 22:43:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:43:58,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-28 22:43:58,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-28 22:43:58,896 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:43:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:43:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1019973513, now seen corresponding path program 1 times [2024-10-28 22:43:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:43:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856551288] [2024-10-28 22:43:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:43:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:43:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-28 22:43:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:43:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856551288] [2024-10-28 22:43:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856551288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:43:59,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:43:59,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-28 22:43:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935827672] [2024-10-28 22:43:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:43:59,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-28 22:43:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:43:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-28 22:43:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-28 22:43:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:59,065 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:43:59,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:43:59,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:43:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:43:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:43:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:43:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-28 22:43:59,877 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:43:59,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:43:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash -991344362, now seen corresponding path program 2 times [2024-10-28 22:43:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:43:59,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136104897] [2024-10-28 22:43:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:43:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:44:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:44:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-28 22:44:01,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:44:01,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136104897] [2024-10-28 22:44:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136104897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 22:44:01,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 22:44:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-28 22:44:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936820918] [2024-10-28 22:44:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 22:44:01,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 22:44:01,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:44:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 22:44:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-28 22:44:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:44:01,485 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:44:01,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 22:44:01,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:44:01,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:44:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:44:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:44:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:44:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 22:44:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:44:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-28 22:44:02,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:44:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:44:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -666900165, now seen corresponding path program 2 times [2024-10-28 22:44:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:44:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053736254] [2024-10-28 22:44:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:44:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:44:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:44:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:44:09,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:44:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053736254] [2024-10-28 22:44:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053736254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:44:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655209978] [2024-10-28 22:44:09,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 22:44:09,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:44:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:44:09,917 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) [2024-10-28 22:44:09,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-28 22:44:11,516 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 22:44:11,517 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 22:44:11,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 3874 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-10-28 22:44:11,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:44:11,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-10-28 22:44:11,616 INFO L378 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 [2024-10-28 22:44:11,676 INFO L378 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 [2024-10-28 22:44:11,776 INFO L378 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 30 treesize of output 14 [2024-10-28 22:44:11,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:11,820 INFO L378 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 [2024-10-28 22:44:11,918 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-10-28 22:44:11,918 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-10-28 22:44:11,981 INFO L378 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 [2024-10-28 22:44:12,056 INFO L378 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 43 treesize of output 23 [2024-10-28 22:44:12,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:12,106 INFO L378 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 [2024-10-28 22:44:12,221 INFO L378 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 [2024-10-28 22:44:12,256 INFO L378 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 30 treesize of output 14 [2024-10-28 22:44:12,340 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:44:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:44:12,394 INFO L378 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 [2024-10-28 22:44:12,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-28 22:44:12,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:12,502 INFO L378 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 [2024-10-28 22:44:12,594 INFO L378 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 [2024-10-28 22:44:12,627 INFO L378 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 [2024-10-28 22:44:12,687 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:44:12,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:44:12,744 INFO L378 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 [2024-10-28 22:44:12,857 INFO L378 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 43 treesize of output 23 [2024-10-28 22:44:12,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:12,908 INFO L378 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 [2024-10-28 22:44:13,033 INFO L378 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 43 treesize of output 23 [2024-10-28 22:44:13,092 INFO L378 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 [2024-10-28 22:44:13,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-10-28 22:44:13,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 33 treesize of output 23 [2024-10-28 22:44:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:44:13,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:44:13,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))) is different from false [2024-10-28 22:44:13,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))) is different from false [2024-10-28 22:44:13,449 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) is different from false [2024-10-28 22:44:13,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) is different from false [2024-10-28 22:44:15,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse2 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1247) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|))))))) is different from false [2024-10-28 22:44:15,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1238) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1247) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|))))))) is different from false [2024-10-28 22:44:20,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1247) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< 2147483647 v_ArrVal_1247) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse3 .cse4 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse4) 2147483647))))))) is different from false [2024-10-28 22:44:20,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (let ((.cse7 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse6 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1247) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647))))))) is different from false [2024-10-28 22:44:20,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| 1))))) (let ((.cse6 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1247) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse4 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select (store (store (store .cse4 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* 4 (select .cse4 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5) 2147483647)))))))) is different from false [2024-10-28 22:44:20,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1230 Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1230) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| 1))))) (let ((.cse6 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1238) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse5))) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))))))) is different from false [2024-10-28 22:44:22,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1228 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1230 Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse5 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1230) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse2 (let ((.cse7 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85|)))))))) is different from false [2024-10-28 22:44:22,170 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1228 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1230 Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_88| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_88| 1))))) (let ((.cse5 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1230) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1238) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1247) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_88|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85|) (< 2147483647 v_ArrVal_1247) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|))))))))) is different from false [2024-10-28 22:44:22,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1228 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1230 Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1225 Int) (v_ArrVal_1247 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_88| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1225) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_88| 1))))) (let ((.cse3 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1230) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85| 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse4 (let ((.cse9 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1238) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_85|) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_88|) (< 2147483647 v_ArrVal_1247))))))))) is different from false [2024-10-28 22:44:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2024-10-28 22:44:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655209978] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:44:23,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:44:23,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 29] total 70 [2024-10-28 22:44:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160560987] [2024-10-28 22:44:23,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:44:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-28 22:44:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:44:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-28 22:44:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=2831, Unknown=40, NotChecked=1638, Total=5112 [2024-10-28 22:44:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:44:23,169 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:44:23,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 4.802816901408451) internal successors, (341), 71 states have internal predecessors, (341), 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) [2024-10-28 22:44:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:44:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:23,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:44:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:44:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-28 22:44:34,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-28 22:44:34,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:44:34,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:44:34,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:44:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash -940803840, now seen corresponding path program 2 times [2024-10-28 22:44:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:44:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992674741] [2024-10-28 22:44:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:44:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:44:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:44:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:44:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:44:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992674741] [2024-10-28 22:44:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992674741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:44:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076808362] [2024-10-28 22:44:41,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 22:44:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:44:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:44:41,544 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) [2024-10-28 22:44:41,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-28 22:44:43,570 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 22:44:43,571 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 22:44:43,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 3886 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-28 22:44:43,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:44:43,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-10-28 22:44:43,703 INFO L378 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 [2024-10-28 22:44:43,789 INFO L378 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 [2024-10-28 22:44:43,939 INFO L378 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 30 treesize of output 14 [2024-10-28 22:44:44,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:44,001 INFO L378 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 [2024-10-28 22:44:44,139 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-10-28 22:44:44,140 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-10-28 22:44:44,214 INFO L378 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 [2024-10-28 22:44:44,297 INFO L378 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 43 treesize of output 23 [2024-10-28 22:44:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:44,348 INFO L378 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 [2024-10-28 22:44:44,459 INFO L378 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 [2024-10-28 22:44:44,498 INFO L378 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 30 treesize of output 14 [2024-10-28 22:44:44,590 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:44:44,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:44:44,637 INFO L378 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 [2024-10-28 22:44:44,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-28 22:44:44,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:44,754 INFO L378 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 [2024-10-28 22:44:44,853 INFO L378 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 [2024-10-28 22:44:44,880 INFO L378 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 [2024-10-28 22:44:44,941 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:44:44,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:44:44,993 INFO L378 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 [2024-10-28 22:44:45,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-28 22:44:45,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:44:45,202 INFO L378 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 25 treesize of output 18 [2024-10-28 22:44:45,384 INFO L378 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 32 treesize of output 16 [2024-10-28 22:44:45,416 INFO L378 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 32 treesize of output 16 [2024-10-28 22:44:45,476 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:44:45,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2024-10-28 22:44:45,523 INFO L378 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 32 treesize of output 16 [2024-10-28 22:44:45,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-28 22:44:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:44:45,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:44:45,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int)) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1)) 2147483650))) is different from false [2024-10-28 22:44:45,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int)) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1)) 2147483650))) is different from false [2024-10-28 22:44:45,961 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1)) 2147483650)) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|)))) is different from false [2024-10-28 22:44:45,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (v_ArrVal_1446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1446) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1)))) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|)))) is different from false [2024-10-28 22:44:47,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1446 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1))) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|)))))) is different from false [2024-10-28 22:44:47,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1437) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< 0 (+ (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1) 2147483650)) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|)))))) is different from false [2024-10-28 22:44:49,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (v_ArrVal_1432 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse5 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1437) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1))) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|)))))) is different from false [2024-10-28 22:44:49,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (v_ArrVal_1432 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))))) (let ((.cse5 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1437) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|))))))) is different from false [2024-10-28 22:44:49,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1429 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (v_ArrVal_1432 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1429) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))))) (let ((.cse0 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1437) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|))))))) is different from false [2024-10-28 22:44:52,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1429 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (v_ArrVal_1432 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1427) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1429) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse3 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1437) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< 0 (+ 2147483650 (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1))))))))) is different from false [2024-10-28 22:44:52,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1429 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (v_ArrVal_1432 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_107| Int) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_107| 1))))) (let ((.cse7 (let ((.cse11 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1427) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1429) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse3 (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1437) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< 0 (+ (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1) 2147483650)) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_107|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|)))))))) is different from false [2024-10-28 22:44:52,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1429 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (v_ArrVal_1432 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1440 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_107| Int) (v_ArrVal_1446 Int) (v_ArrVal_1437 Int) (v_ArrVal_1425 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1425) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_107| 1))))) (let ((.cse6 (let ((.cse11 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1427) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse10 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1429) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse4 (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1437) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1440) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< 0 (+ (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1446) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 1))) |c_~#stored_elements~0.base| v_ArrVal_1448) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)) .cse1) 2147483650)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98|) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_107|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_98| 2147483649) 0)))))))) is different from false [2024-10-28 22:44:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 81 refuted. 3 times theorem prover too weak. 0 trivial. 30 not checked. [2024-10-28 22:44:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076808362] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:44:55,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:44:55,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 30] total 70 [2024-10-28 22:44:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525274431] [2024-10-28 22:44:55,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:44:55,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-28 22:44:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:44:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-28 22:44:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=3016, Unknown=49, NotChecked=1524, Total=5112 [2024-10-28 22:44:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:44:55,015 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:44:55,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 4.929577464788732) internal successors, (350), 71 states have internal predecessors, (350), 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) [2024-10-28 22:44:55,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:44:55,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-10-28 22:44:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:45:06,653 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse14 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse4 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< 2147483647 v_ArrVal_1247) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse11 (store .cse13 .cse14 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (let ((.cse10 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse9 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (or (< (select (store (store (store .cse13 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) .cse14 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse13 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))))) is different from false [2024-10-28 22:45:07,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse2 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647))))) (forall ((v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse7 (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse8 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< 2147483647 v_ArrVal_1247) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse9 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse9 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))))))) is different from false [2024-10-28 22:45:09,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse8 .cse10)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1238) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1247) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse11 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse14 (store .cse16 .cse17 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (let ((.cse13 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse12 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (or (< (select (store (store (store .cse16 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) .cse17 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse16 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))))) is different from false [2024-10-28 22:45:13,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse17 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse18 (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse19 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200)) (.cse5 (select .cse8 .cse10)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1238) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1241 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1252 Int) (v_ArrVal_1235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse17 .cse18 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse19 v_ArrVal_1235)))) (let ((.cse12 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse13 (let ((.cse15 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse11 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse11 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse20 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse17 .cse18 (+ (- 1) |c_t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse19 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse21 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1247) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse21 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse21 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse21 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store (store (store .cse22 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse22 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|))))))) is different from false [2024-10-28 22:45:17,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:22,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:26,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:28,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:29,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:29,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse8 .cse10)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse17 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse19 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1238) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1241 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1252 Int) (v_ArrVal_1235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse17 .cse18 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse19 v_ArrVal_1235)))) (let ((.cse12 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse13 (let ((.cse15 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse11 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse11 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse20 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse17 .cse18 (+ (- 1) |c_t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse19 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse21 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1247) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse21 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse21 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse21 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse22 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse17 .cse19 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse1) 2147483647))))) is different from false [2024-10-28 22:45:32,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:35,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:38,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse8 .cse10)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse17 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse18 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1238) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1241 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1252 Int) (v_ArrVal_1235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse17 (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse18 v_ArrVal_1235)))) (let ((.cse12 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse13 (let ((.cse15 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse11 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse11 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse19 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1247) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse19 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse19 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse20 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse17 .cse18 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse1) 2147483647))))) is different from false [2024-10-28 22:45:40,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:45:43,899 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse8 .cse10)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1238) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int)) (< (select (store .cse11 .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1247) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse13 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse13 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse16 (store .cse11 .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (let ((.cse15 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse1 v_ArrVal_1238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse14 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse14 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-10-28 22:45:44,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse8 .cse10)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (v_ArrVal_1238 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1238) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1247) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse11 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-10-28 22:45:44,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse5 .cse6)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* 4 (select .cse0 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse8 (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1247) (< (select .cse7 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse7 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|))))))))) is different from false [2024-10-28 22:45:46,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse2 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647))))) (forall ((v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< (select (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647)))))) is different from false [2024-10-28 22:45:48,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse0 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1247) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse7 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647) (< (select .cse7 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (or (< (select (store (store (store .cse5 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647) (< (select .cse5 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))))) is different from false [2024-10-28 22:45:49,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse3 (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse4 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse2 .cse3 (+ (- 1) |c_t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse5) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse6 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse7 v_ArrVal_1252) (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5) 2147483647) (< (select .cse6 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store (store (store .cse10 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse7 v_ArrVal_1252) (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5) 2147483647) (< (select .cse10 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1243 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse13 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1243)))) (let ((.cse12 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse11 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_1247) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse11 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse7 v_ArrVal_1252) (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5) 2147483647) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse11 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))))))) is different from false [2024-10-28 22:45:59,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse4 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse2 .cse3 (+ (- 1) |c_t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse5) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse6 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse7 v_ArrVal_1252) (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5) 2147483647) (< (select .cse6 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1243 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1243)))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse10 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1247) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse10 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse7 v_ArrVal_1252) (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse5) 2147483647) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse10 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse14 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse2 .cse4 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse5) 2147483647)))) is different from false [2024-10-28 22:46:00,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse10 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse11 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1243 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse8 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse10 (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse11 v_ArrVal_1243)))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse2 v_ArrVal_1252) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int)) (< (select (let ((.cse12 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse10 .cse11 v_ArrVal_1252)) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse1) 2147483647)))) is different from false [2024-10-28 22:46:03,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse0 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1247) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int)) (< (select (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse7 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) .cse4 v_ArrVal_1252) (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse3) 2147483647) (< (select .cse7 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-10-28 22:46:03,435 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| Int) (v_ArrVal_1249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_1252 Int) (v_ArrVal_1247 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1247) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))) |c_~#stored_elements~0.base| v_ArrVal_1249) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1252) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_35|) (< 2147483647 v_ArrVal_1247) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:46:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-28 22:46:06,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-28 22:46:07,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:46:07,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:46:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:46:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 194685488, now seen corresponding path program 2 times [2024-10-28 22:46:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:46:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752238311] [2024-10-28 22:46:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:46:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:46:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:46:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:46:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:46:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752238311] [2024-10-28 22:46:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752238311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:46:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109439469] [2024-10-28 22:46:22,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 22:46:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:46:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:46:22,394 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) [2024-10-28 22:46:22,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-28 22:46:24,089 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 22:46:24,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 22:46:24,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 4328 conjuncts, 253 conjuncts are in the unsatisfiable core [2024-10-28 22:46:24,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:46:24,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-10-28 22:46:24,204 INFO L378 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 [2024-10-28 22:46:24,263 INFO L378 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 [2024-10-28 22:46:24,377 INFO L378 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 [2024-10-28 22:46:24,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:24,427 INFO L378 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 [2024-10-28 22:46:24,541 INFO L378 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 [2024-10-28 22:46:24,626 INFO L378 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 [2024-10-28 22:46:24,737 INFO L378 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 [2024-10-28 22:46:24,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:24,796 INFO L378 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 [2024-10-28 22:46:24,912 INFO L378 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 [2024-10-28 22:46:24,989 INFO L378 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 [2024-10-28 22:46:25,095 INFO L378 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 [2024-10-28 22:46:25,162 INFO L378 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 [2024-10-28 22:46:25,278 INFO L378 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 [2024-10-28 22:46:25,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:25,337 INFO L378 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 [2024-10-28 22:46:25,468 INFO L378 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 [2024-10-28 22:46:25,500 INFO L378 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 30 treesize of output 14 [2024-10-28 22:46:25,588 INFO L378 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 [2024-10-28 22:46:25,649 INFO L378 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 [2024-10-28 22:46:25,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-28 22:46:25,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:25,838 INFO L378 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 [2024-10-28 22:46:25,944 INFO L378 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 [2024-10-28 22:46:25,977 INFO L378 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 [2024-10-28 22:46:26,034 INFO L378 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 [2024-10-28 22:46:26,102 INFO L378 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 [2024-10-28 22:46:26,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-28 22:46:26,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:26,272 INFO L378 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 [2024-10-28 22:46:26,381 INFO L378 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 [2024-10-28 22:46:26,409 INFO L378 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 [2024-10-28 22:46:26,471 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:46:26,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:46:26,528 INFO L378 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 [2024-10-28 22:46:26,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-28 22:46:26,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:26,693 INFO L378 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 [2024-10-28 22:46:26,803 INFO L378 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 [2024-10-28 22:46:26,829 INFO L378 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 [2024-10-28 22:46:26,894 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:46:26,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:46:26,950 INFO L378 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 [2024-10-28 22:46:27,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-28 22:46:27,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:46:27,121 INFO L378 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 [2024-10-28 22:46:27,234 INFO L378 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 [2024-10-28 22:46:27,256 INFO L378 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 [2024-10-28 22:46:27,302 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:46:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-10-28 22:46:27,340 INFO L378 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 [2024-10-28 22:46:27,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-28 22:46:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:46:27,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:46:27,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1)) 2147483647)) is different from false [2024-10-28 22:46:27,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1792 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1792) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1)) 2147483647)) (= 800 .cse4)))) is different from false [2024-10-28 22:46:28,720 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse6 (select .cse5 .cse3))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1792) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= .cse6 800))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2024-10-28 22:46:28,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1783) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1792) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647) (= .cse4 800) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) (= 800 .cse5)))) is different from false [2024-10-28 22:46:31,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse7 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse4 .cse2)) (.cse6 (select .cse7 .cse2))) (or (= .cse0 800) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1792) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647) (= .cse6 800) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) is different from false [2024-10-28 22:46:31,260 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse9 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1783) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse9 .cse4)) (.cse8 (select .cse6 .cse4))) (or (= 800 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1792) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse4) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse8))))))))) is different from false [2024-10-28 22:46:31,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse12))) (or (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1774 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1774) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse8 (let ((.cse10 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse9 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse1 (select .cse5 .cse3)) (.cse7 (select .cse8 .cse3))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse7))))))) (= 800 .cse0)))) is different from false [2024-10-28 22:46:35,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse7 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse5 (select .cse3 .cse1)) (.cse6 (select .cse7 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1792) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647) (= .cse6 800) (= 800 .cse5) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) is different from false [2024-10-28 22:46:35,195 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse1) (= 800 .cse0) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2024-10-28 22:46:35,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1766 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1766) .cse11 (+ .cse12 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) (= 800 .cse12)))) is different from false [2024-10-28 22:46:39,172 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= 800 .cse0) (= 800 .cse1) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2024-10-28 22:46:39,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((v_ArrVal_1759 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1759) .cse11 (+ .cse12 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse1 (select .cse5 .cse3)) (.cse0 (select .cse7 .cse3))) (or (= 800 .cse0) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) (= 800 .cse12)))) is different from false [2024-10-28 22:46:44,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse1 (select .cse6 .cse3)) (.cse0 (select .cse4 .cse3))) (or (= 800 .cse0) (= .cse1 800) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1792) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) is different from false [2024-10-28 22:46:44,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1751) .cse11 (+ .cse12 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse6 (select .cse4 .cse2)) (.cse0 (select .cse7 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1792) .cse2 (+ 1 .cse6))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647) (= 800 .cse6) (= .cse0 800))))))) (= 800 .cse12)))) is different from false [2024-10-28 22:46:47,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1748 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1748) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse6 .cse2)) (.cse5 (select .cse3 .cse2))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1792) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647) (= .cse5 800))))))) is different from false [2024-10-28 22:46:47,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1748 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1748) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse1 (select .cse5 .cse3)) (.cse0 (select .cse7 .cse3))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= 800 .cse0))))))) is different from false [2024-10-28 22:46:47,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1745 Int) (v_ArrVal_1748 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1745) .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse7 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1748) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse6 (select .cse7 .cse1)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1792) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647) (= .cse6 800) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse5 800))))))) is different from false [2024-10-28 22:46:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 15 proven. 216 refuted. 31 times theorem prover too weak. 133 trivial. 109 not checked. [2024-10-28 22:46:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109439469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:46:50,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:46:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 41, 43] total 114 [2024-10-28 22:46:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059217156] [2024-10-28 22:46:50,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:46:50,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2024-10-28 22:46:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:46:50,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2024-10-28 22:46:50,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1981, Invalid=7604, Unknown=185, NotChecked=3570, Total=13340 [2024-10-28 22:46:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:46:50,473 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:46:50,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 4.886956521739131) internal successors, (562), 115 states have internal predecessors, (562), 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) [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:50,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-10-28 22:46:50,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:47:06,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse31 (select .cse10 .cse12))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ .cse31 1)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse14 (= 800 .cse31))) (and (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1766 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1766) .cse12 .cse13)))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) .cse14) (or (forall ((v_ArrVal_1759 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1759) .cse12 .cse13)))) (let ((.cse20 (let ((.cse22 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse19 (let ((.cse21 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse16 (select .cse19 .cse3)) (.cse15 (select .cse20 .cse3))) (or (= 800 .cse15) (= .cse16 800) (< (select (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1792) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1751) .cse12 .cse13)))) (let ((.cse28 (let ((.cse30 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse26 (let ((.cse29 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse28 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse27 (select .cse26 .cse3)) (.cse23 (select .cse28 .cse3))) (or (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_1792) .cse3 (+ 1 .cse27))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= 800 .cse27) (= .cse23 800))))))) .cse14) (or (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1774 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse34 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1774) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse37 (let ((.cse39 (select (store .cse34 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* (select .cse39 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse35 (let ((.cse38 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse37 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse32 (select .cse35 .cse3)) (.cse36 (select .cse37 .cse3))) (or (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse32 800) (< (select (let ((.cse33 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_1792) .cse3 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse36 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse36))))))) .cse14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_69| Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1745 Int) (v_ArrVal_1748 (Array Int Int))) (let ((.cse44 (let ((.cse46 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse47 (let ((.cse48 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse48 (+ (* (select .cse48 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_69|)))) (store (store .cse47 .cse6 v_ArrVal_1745) .cse3 (+ 1 (select .cse47 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1748) |c_~#queue~0.base|))) (store .cse46 (+ (* (select .cse46 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse43 (let ((.cse45 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse44 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse40 (select .cse44 .cse3)) (.cse41 (select .cse43 .cse3))) (or (< .cse40 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse41) (= .cse40 800) (< (select (let ((.cse42 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse43 .cse6 v_ArrVal_1792) .cse3 (+ .cse41 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse42 (+ |c_~#queue~0.offset| (* (select .cse42 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)))))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse50 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1783) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse51 (let ((.cse53 (select (store .cse50 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse53 (+ (* (select .cse53 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse52 (select .cse51 .cse3))) (or (< (select (let ((.cse49 (select (store (store .cse50 |c_~#queue~0.base| (store (store .cse51 .cse6 v_ArrVal_1792) .cse3 (+ .cse52 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse49 (+ (* (select .cse49 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= .cse52 800) (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) .cse14) (or (forall ((v_ArrVal_1792 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse54 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1792) .cse12 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse54 (+ (* (select .cse54 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)) .cse14) (< .cse31 2147483647))))) is different from false [2024-10-28 22:47:07,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse31 (select .cse10 .cse12))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ .cse31 1)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse14 (= 800 .cse31))) (and (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1766 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1766) .cse12 .cse13)))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) .cse14) (or (forall ((v_ArrVal_1759 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1759) .cse12 .cse13)))) (let ((.cse20 (let ((.cse22 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse19 (let ((.cse21 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse16 (select .cse19 .cse3)) (.cse15 (select .cse20 .cse3))) (or (= 800 .cse15) (= .cse16 800) (< (select (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1792) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1751) .cse12 .cse13)))) (let ((.cse28 (let ((.cse30 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse26 (let ((.cse29 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse28 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse27 (select .cse26 .cse3)) (.cse23 (select .cse28 .cse3))) (or (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_1792) .cse3 (+ 1 .cse27))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= 800 .cse27) (= .cse23 800))))))) .cse14) (or (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1774 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse34 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1774) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse37 (let ((.cse39 (select (store .cse34 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* (select .cse39 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse35 (let ((.cse38 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse37 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse32 (select .cse35 .cse3)) (.cse36 (select .cse37 .cse3))) (or (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse32 800) (< (select (let ((.cse33 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_1792) .cse3 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse36 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse36))))))) .cse14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_69| Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1745 Int) (v_ArrVal_1748 (Array Int Int))) (let ((.cse44 (let ((.cse46 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse47 (let ((.cse48 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse48 (+ (* (select .cse48 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_69|)))) (store (store .cse47 .cse6 v_ArrVal_1745) .cse3 (+ 1 (select .cse47 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1748) |c_~#queue~0.base|))) (store .cse46 (+ (* (select .cse46 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse43 (let ((.cse45 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse44 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse40 (select .cse44 .cse3)) (.cse41 (select .cse43 .cse3))) (or (< .cse40 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse41) (= .cse40 800) (< (select (let ((.cse42 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse43 .cse6 v_ArrVal_1792) .cse3 (+ .cse41 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse42 (+ |c_~#queue~0.offset| (* (select .cse42 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)))))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse50 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1783) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse51 (let ((.cse53 (select (store .cse50 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse53 (+ (* (select .cse53 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse52 (select .cse51 .cse3))) (or (< (select (let ((.cse49 (select (store (store .cse50 |c_~#queue~0.base| (store (store .cse51 .cse6 v_ArrVal_1792) .cse3 (+ .cse52 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse49 (+ (* (select .cse49 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= .cse52 800) (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) .cse14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1779 Int)) (let ((.cse55 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_1779)))) (let ((.cse59 (let ((.cse61 (select .cse55 |c_~#queue~0.base|))) (store .cse61 (+ (* (select .cse61 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse56 (let ((.cse60 (select (store (store .cse55 |c_~#queue~0.base| (store (store .cse59 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse60 (+ (* (select .cse60 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse57 (select .cse56 .cse3)) (.cse58 (select .cse59 .cse3))) (or (< (select (let ((.cse54 (select (store (store .cse55 |c_~#queue~0.base| (store (store .cse56 .cse6 v_ArrVal_1792) .cse3 (+ .cse57 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse54 (+ (* (select .cse54 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse58 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse57) (= .cse58 800))))))) (or (forall ((v_ArrVal_1792 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse62 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1792) .cse12 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse62 (+ (* (select .cse62 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)) .cse14) (< .cse31 2147483647))))) is different from false [2024-10-28 22:47:08,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse31 (select .cse10 .cse12))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ .cse31 1)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse14 (= 800 .cse31))) (and (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1766 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1766) .cse12 .cse13)))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) .cse14) (or (forall ((v_ArrVal_1759 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1759) .cse12 .cse13)))) (let ((.cse20 (let ((.cse22 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse19 (let ((.cse21 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse16 (select .cse19 .cse3)) (.cse15 (select .cse20 .cse3))) (or (= 800 .cse15) (= .cse16 800) (< (select (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1792) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1751) .cse12 .cse13)))) (let ((.cse28 (let ((.cse30 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse26 (let ((.cse29 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse28 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse27 (select .cse26 .cse3)) (.cse23 (select .cse28 .cse3))) (or (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_1792) .cse3 (+ 1 .cse27))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= 800 .cse27) (= .cse23 800))))))) .cse14) (or (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1774 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse34 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1774) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse37 (let ((.cse39 (select (store .cse34 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* (select .cse39 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse35 (let ((.cse38 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse37 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse32 (select .cse35 .cse3)) (.cse36 (select .cse37 .cse3))) (or (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse32 800) (< (select (let ((.cse33 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_1792) .cse3 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse36 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse36))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse41 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1783) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse42 (let ((.cse44 (select (store .cse41 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse44 (+ (* (select .cse44 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse43 (select .cse42 .cse3))) (or (< (select (let ((.cse40 (select (store (store .cse41 |c_~#queue~0.base| (store (store .cse42 .cse6 v_ArrVal_1792) .cse3 (+ .cse43 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= .cse43 800) (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) .cse14) (or (forall ((v_ArrVal_1792 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse45 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1792) .cse12 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)) .cse14) (< .cse31 2147483647))))) is different from false [2024-10-28 22:47:08,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse9))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1)))) (.cse10 (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800))) (and (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse6 (select .cse4 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1792) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647) (= .cse6 800)))))) .cse10) (or .cse10 (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse16 (let ((.cse18 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse14 (let ((.cse17 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse16 .cse5 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse11 (select .cse16 .cse2)) (.cse15 (select .cse14 .cse2))) (or (= 800 .cse11) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (< (select (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_1792) .cse2 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse15)))))))) (or (forall ((v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* 4 (select .cse19 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647)) .cse10) (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse25 (let ((.cse27 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse24 (let ((.cse26 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse25 .cse5 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse21 (select .cse25 .cse2)) (.cse22 (select .cse24 .cse2))) (or (< .cse21 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse22) (= 800 .cse21) (< (select (let ((.cse23 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse24 .cse5 v_ArrVal_1792) .cse2 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647)))))) .cse10) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse32 (let ((.cse34 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* 4 (select .cse34 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse31 (let ((.cse33 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse32 .cse5 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* (select .cse33 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse28 (select .cse32 .cse2)) (.cse29 (select .cse31 .cse2))) (or (= 800 .cse28) (= 800 .cse29) (< .cse28 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse30 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse31 .cse5 v_ArrVal_1792) .cse2 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647)))))) .cse10) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse39 (let ((.cse41 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse41 (+ (* 4 (select .cse41 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse37 (let ((.cse40 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse39 .cse5 v_ArrVal_1783) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse40 (+ |c_~#queue~0.offset| (* (select .cse40 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse35 (select .cse37 .cse2)) (.cse38 (select .cse39 .cse2))) (or (= 800 .cse35) (< (select (let ((.cse36 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse37 .cse5 v_ArrVal_1792) .cse2 (+ .cse35 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse36 (+ (* 4 (select .cse36 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse2) 2147483647) (= 800 .cse38) (< .cse38 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) .cse10) (< .cse0 2147483647))))) is different from false [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:47:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-28 22:47:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-28 22:47:08,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-28 22:47:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-28 22:47:08,952 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:47:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:47:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -846315061, now seen corresponding path program 3 times [2024-10-28 22:47:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:47:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30850702] [2024-10-28 22:47:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:47:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:47:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:47:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 22:47:26,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:47:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30850702] [2024-10-28 22:47:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30850702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:47:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498472811] [2024-10-28 22:47:26,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 22:47:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:47:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:47:26,760 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) [2024-10-28 22:47:26,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-28 22:47:29,289 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-28 22:47:29,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 22:47:29,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 3727 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-28 22:47:29,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:47:30,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-28 22:47:30,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:47:30,301 INFO L378 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 17 treesize of output 12 [2024-10-28 22:47:30,409 INFO L378 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 24 treesize of output 12 [2024-10-28 22:47:30,436 INFO L378 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 24 treesize of output 12 [2024-10-28 22:47:30,506 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-28 22:47:30,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 30 [2024-10-28 22:47:30,561 INFO L378 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 24 treesize of output 12 [2024-10-28 22:47:30,693 INFO L378 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 33 treesize of output 24 [2024-10-28 22:47:30,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:47:30,755 INFO L378 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 24 treesize of output 17 [2024-10-28 22:47:30,901 INFO L378 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 44 treesize of output 24 [2024-10-28 22:47:31,006 INFO L378 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 31 treesize of output 22 [2024-10-28 22:47:31,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-10-28 22:47:31,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 34 treesize of output 24 [2024-10-28 22:47:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 196 proven. 156 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-10-28 22:47:31,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:47:31,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73| Int) (v_ArrVal_2137 Int) (v_ArrVal_2134 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2134) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2137) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73|)))) is different from false [2024-10-28 22:47:31,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73| Int) (v_ArrVal_2137 Int) (v_ArrVal_2134 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2134) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2137) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73|)))) is different from false [2024-10-28 22:47:31,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73| Int) (v_ArrVal_2132 Int) (v_ArrVal_2137 Int) (v_ArrVal_2134 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2132) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2134) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_73|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2137) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|) .cse1) 2147483647) (< 2147483647 v_ArrVal_2132)))) is different from false [2024-10-28 22:47:32,992 INFO L349 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2024-10-28 22:47:32,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 772 treesize of output 439 [2024-10-28 22:47:33,077 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-10-28 22:47:33,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 478 treesize of output 456 [2024-10-28 22:47:33,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 219 treesize of output 195 [2024-10-28 22:47:33,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:47:33,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 241 [2024-10-28 22:47:33,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-28 22:47:33,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-28 22:47:33,265 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:47:33,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2024-10-28 22:47:33,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:47:33,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:47:33,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 196 treesize of output 210 [2024-10-28 22:47:33,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:47:33,824 INFO L378 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 246 treesize of output 218 [2024-10-28 22:47:34,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:47:34,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 80 [2024-10-28 22:47:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 149 proven. 155 refuted. 10 times theorem prover too weak. 320 trivial. 38 not checked. [2024-10-28 22:47:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498472811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:47:35,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:47:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 15, 16] total 66 [2024-10-28 22:47:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482177253] [2024-10-28 22:47:35,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:47:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-28 22:47:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:47:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-28 22:47:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=3681, Unknown=5, NotChecked=384, Total=4556 [2024-10-28 22:47:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:47:35,594 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:47:35,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.791044776119403) internal successors, (455), 67 states have internal predecessors, (455), 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) [2024-10-28 22:47:35,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:35,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-28 22:47:35,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:47:51,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse8 (let ((.cse10 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse3 (select .cse8 .cse1)) (.cse4 (select .cse6 .cse1))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse4) (= 800 .cse3) (< (select (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1792) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse15 (let ((.cse17 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse14 (let ((.cse16 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse11 (select .cse15 .cse1)) (.cse12 (select .cse14 .cse1))) (or (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse12) (= 800 .cse11) (< (select (let ((.cse13 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_1792) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse20 (let ((.cse21 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse18 (select .cse20 .cse1))) (or (= .cse18 800) (< (select (let ((.cse19 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse20 .cse7 v_ArrVal_1792) .cse1 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647))))))) is different from false [2024-10-28 22:47:51,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse8 (let ((.cse10 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse3 (select .cse8 .cse1)) (.cse4 (select .cse6 .cse1))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse4) (= 800 .cse3) (< (select (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1792) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 7) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse15 (let ((.cse17 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse14 (let ((.cse16 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse11 (select .cse15 .cse1)) (.cse12 (select .cse14 .cse1))) (or (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse12) (= 800 .cse11) (< (select (let ((.cse13 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_1792) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse20 (let ((.cse21 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse18 (select .cse20 .cse1))) (or (= .cse18 800) (< (select (let ((.cse19 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse20 .cse7 v_ArrVal_1792) .cse1 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647))))))) is different from false [2024-10-28 22:47:51,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse6 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse2 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse5 (select .cse6 .cse1)) (.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1792) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647) (= 800 .cse5) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse4)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse11 (let ((.cse12 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse9 (select .cse11 .cse1))) (or (= 800 .cse9) (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_1792) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse17 (let ((.cse19 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse16 (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse17 .cse3 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse14 (select .cse17 .cse1)) (.cse13 (select .cse16 .cse1))) (or (= 800 .cse13) (= .cse14 800) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse3 v_ArrVal_1792) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)))))) (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse24 (let ((.cse26 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse21 (let ((.cse25 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse24 .cse3 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse22 (select .cse21 .cse1)) (.cse23 (select .cse24 .cse1))) (or (< (select (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse3 v_ArrVal_1792) .cse1 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647) (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse22) (= 800 .cse23)))))) (forall ((v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse27 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse32 (let ((.cse34 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse34 (+ (* 4 (select .cse34 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse31 (let ((.cse33 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse32 .cse3 v_ArrVal_1783) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse28 (select .cse32 .cse1)) (.cse29 (select .cse31 .cse1))) (or (< .cse28 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse28) (= 800 .cse29) (< (select (let ((.cse30 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse31 .cse3 v_ArrVal_1792) .cse1 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse1) 2147483647)))))))) is different from false [2024-10-28 22:47:53,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse31 (select .cse10 .cse12))) (let ((.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ .cse31 1)) (.cse14 (= 800 .cse31)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1766 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1766) .cse12 .cse13)))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) .cse14) (or (forall ((v_ArrVal_1759 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1759) .cse12 .cse13)))) (let ((.cse20 (let ((.cse22 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse19 (let ((.cse21 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse16 (select .cse19 .cse3)) (.cse15 (select .cse20 .cse3))) (or (= 800 .cse15) (= .cse16 800) (< (select (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1792) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1751) .cse12 .cse13)))) (let ((.cse28 (let ((.cse30 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse26 (let ((.cse29 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse28 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse27 (select .cse26 .cse3)) (.cse23 (select .cse28 .cse3))) (or (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_1792) .cse3 (+ 1 .cse27))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= 800 .cse27) (= .cse23 800))))))) .cse14) (or (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1774 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse34 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1774) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse37 (let ((.cse39 (select (store .cse34 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* (select .cse39 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse35 (let ((.cse38 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse37 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse32 (select .cse35 .cse3)) (.cse36 (select .cse37 .cse3))) (or (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse32 800) (< (select (let ((.cse33 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_1792) .cse3 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse36 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse36))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse41 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1783) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse42 (let ((.cse44 (select (store .cse41 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse44 (+ (* (select .cse44 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse43 (select .cse42 .cse3))) (or (< (select (let ((.cse40 (select (store (store .cse41 |c_~#queue~0.base| (store (store .cse42 .cse6 v_ArrVal_1792) .cse3 (+ .cse43 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= .cse43 800) (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) .cse14) (or (forall ((v_ArrVal_1792 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse45 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1792) .cse12 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)) .cse14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse50 (let ((.cse52 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse52 (+ (* (select .cse52 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse49 (let ((.cse51 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse50 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse51 (+ (* (select .cse51 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse46 (select .cse50 .cse3)) (.cse47 (select .cse49 .cse3))) (or (= .cse46 800) (< .cse46 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse47 800) (< (select (let ((.cse48 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse49 .cse6 v_ArrVal_1792) .cse3 (+ .cse47 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse48 (+ |c_~#queue~0.offset| (* (select .cse48 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)))))) (< .cse31 2147483647))))) is different from false [2024-10-28 22:47:55,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse31 (select .cse10 .cse12))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ .cse31 1)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse14 (= 800 .cse31))) (and (or (forall ((v_ArrVal_1769 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (v_ArrVal_1766 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1766) .cse12 .cse13)))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1769) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3))) (or (= .cse0 800) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1792) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647))))))) .cse14) (or (forall ((v_ArrVal_1759 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1759) .cse12 .cse13)))) (let ((.cse20 (let ((.cse22 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse19 (let ((.cse21 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse16 (select .cse19 .cse3)) (.cse15 (select .cse20 .cse3))) (or (= 800 .cse15) (= .cse16 800) (< (select (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1792) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1751 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1751) .cse12 .cse13)))) (let ((.cse28 (let ((.cse30 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_1753) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse26 (let ((.cse29 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse28 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse27 (select .cse26 .cse3)) (.cse23 (select .cse28 .cse3))) (or (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_1792) .cse3 (+ 1 .cse27))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse24 (+ (* 4 (select .cse24 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= 800 .cse27) (= .cse23 800))))))) .cse14) (or (forall ((v_ArrVal_1777 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1774 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse34 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1774) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126| 1))))) (let ((.cse37 (let ((.cse39 (select (store .cse34 |c_~#stored_elements~0.base| v_ArrVal_1777) |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* (select .cse39 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse35 (let ((.cse38 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse37 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse32 (select .cse35 .cse3)) (.cse36 (select .cse37 .cse3))) (or (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_126|) (= .cse32 800) (< (select (let ((.cse33 (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_1792) .cse3 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse36 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse36))))))) .cse14) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (let ((.cse41 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1783) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))))) (let ((.cse42 (let ((.cse44 (select (store .cse41 |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse44 (+ (* (select .cse44 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse43 (select .cse42 .cse3))) (or (< (select (let ((.cse40 (select (store (store .cse41 |c_~#queue~0.base| (store (store .cse42 .cse6 v_ArrVal_1792) .cse3 (+ .cse43 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (= .cse43 800) (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|)))))) .cse14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1792 Int) (v_ArrVal_1786 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1783 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1779 Int)) (let ((.cse46 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_1779)))) (let ((.cse50 (let ((.cse52 (select .cse46 |c_~#queue~0.base|))) (store .cse52 (+ (* (select .cse52 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)))) (let ((.cse47 (let ((.cse51 (select (store (store .cse46 |c_~#queue~0.base| (store (store .cse50 .cse6 v_ArrVal_1783) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| 1))) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (store .cse51 (+ (* (select .cse51 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse48 (select .cse47 .cse3)) (.cse49 (select .cse50 .cse3))) (or (< (select (let ((.cse45 (select (store (store .cse46 |c_~#queue~0.base| (store (store .cse47 .cse6 v_ArrVal_1792) .cse3 (+ .cse48 1))) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647) (< .cse49 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|) (= 800 .cse48) (= .cse49 800))))))) (or (forall ((v_ArrVal_1792 Int) (v_ArrVal_1794 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int)) (< (select (let ((.cse53 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1792) .cse12 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1794) |c_~#queue~0.base|))) (store .cse53 (+ (* (select .cse53 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)) .cse3) 2147483647)) .cse14) (< .cse31 2147483647))))) is different from false [2024-10-28 22:47:58,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:48:02,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:48:05,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:48:08,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 22:48:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:48:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-28 22:48:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-28 22:48:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-10-28 22:48:09,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-28 22:48:09,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:48:09,747 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:48:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:48:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 625204696, now seen corresponding path program 3 times [2024-10-28 22:48:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:48:09,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403577007] [2024-10-28 22:48:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:48:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:48:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:48:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 64 proven. 251 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-10-28 22:48:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:48:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403577007] [2024-10-28 22:48:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403577007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:48:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246758212] [2024-10-28 22:48:13,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 22:48:13,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:48:13,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:48:13,783 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) [2024-10-28 22:48:13,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-28 22:48:15,542 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 22:48:15,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 22:48:15,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 3592 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-28 22:48:15,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:48:16,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-28 22:48:16,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:48:16,793 INFO L378 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 18 treesize of output 13 [2024-10-28 22:48:16,885 INFO L378 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 25 treesize of output 13 [2024-10-28 22:48:16,909 INFO L378 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 25 treesize of output 13 [2024-10-28 22:48:16,976 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-10-28 22:48:16,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2024-10-28 22:48:17,015 INFO L378 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 25 treesize of output 13 [2024-10-28 22:48:17,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-28 22:48:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 64 proven. 216 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2024-10-28 22:48:17,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:48:17,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:48:17,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2024-10-28 22:48:17,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:48:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 68 [2024-10-28 22:48:17,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-28 22:48:17,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2024-10-28 22:48:17,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:48:17,533 INFO L378 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 52 treesize of output 44 [2024-10-28 22:48:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 40 proven. 216 refuted. 24 times theorem prover too weak. 872 trivial. 0 not checked. [2024-10-28 22:48:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246758212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 22:48:19,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 22:48:19,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 27 [2024-10-28 22:48:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343863591] [2024-10-28 22:48:19,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 22:48:19,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-28 22:48:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 22:48:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-28 22:48:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=682, Unknown=5, NotChecked=0, Total=812 [2024-10-28 22:48:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:48:19,944 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 22:48:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 9.178571428571429) internal successors, (257), 28 states have internal predecessors, (257), 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) [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:19,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:48:19,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-10-28 22:48:19,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-10-28 22:48:19,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2024-10-28 22:48:19,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 22:48:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-28 22:48:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 22:48:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-10-28 22:48:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 22:48:24,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-28 22:48:24,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-28 22:48:24,474 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-28 22:48:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 22:48:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -550304994, now seen corresponding path program 1 times [2024-10-28 22:48:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 22:48:24,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886011155] [2024-10-28 22:48:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:48:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 22:48:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:49:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4716 backedges. 2493 proven. 1143 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2024-10-28 22:49:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 22:49:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886011155] [2024-10-28 22:49:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886011155] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 22:49:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095894746] [2024-10-28 22:49:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 22:49:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 22:49:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 22:49:03,504 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) [2024-10-28 22:49:03,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-28 22:49:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 22:49:04,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 6087 conjuncts, 301 conjuncts are in the unsatisfiable core [2024-10-28 22:49:04,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 22:49:04,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-10-28 22:49:04,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:04,564 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-10-28 22:49:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-10-28 22:49:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:04,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:04,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:04,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:04,632 INFO L378 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 47 treesize of output 43 [2024-10-28 22:49:04,743 INFO L378 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 38 treesize of output 16 [2024-10-28 22:49:04,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:04,791 INFO L378 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 27 treesize of output 20 [2024-10-28 22:49:04,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:04,895 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-28 22:49:04,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-10-28 22:49:04,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:04,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:04,992 INFO L378 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 38 treesize of output 25 [2024-10-28 22:49:05,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:49:05,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-10-28 22:49:05,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:05,178 INFO L378 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 27 treesize of output 20 [2024-10-28 22:49:05,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:05,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:05,290 INFO L378 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 38 treesize of output 25 [2024-10-28 22:49:05,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 22:49:05,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-10-28 22:49:05,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:05,406 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:05,461 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:05,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:05,584 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:05,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:05,677 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:05,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:05,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:05,752 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:05,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:05,810 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:05,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:05,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:05,933 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:06,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:06,028 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:06,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:06,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:06,107 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:06,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:06,160 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:06,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:06,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:06,290 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:06,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:06,409 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:06,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:06,479 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:06,488 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:06,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:06,549 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:06,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:06,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:06,704 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:06,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:06,804 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:06,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:06,871 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:06,880 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:06,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:06,944 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:07,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:07,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:07,115 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:07,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:07,213 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:07,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:07,286 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:07,295 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:07,353 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:07,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:07,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:07,486 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:07,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:07,587 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:07,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:07,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:07,667 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:07,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:07,726 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:07,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:07,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:07,865 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:07,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:07,969 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:07,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:08,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:08,043 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:08,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:08,111 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:08,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-10-28 22:49:08,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:08,243 INFO L378 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 18 treesize of output 13 [2024-10-28 22:49:08,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 22:49:08,360 INFO L378 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 29 treesize of output 13 [2024-10-28 22:49:08,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-28 22:49:08,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 22:49:08,418 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-28 22:49:08,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-10-28 22:49:08,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-28 22:49:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4716 backedges. 2493 proven. 1143 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2024-10-28 22:49:08,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 22:49:09,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1)) 800)) is different from false [2024-10-28 22:49:09,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1)) 800) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|)))) is different from false [2024-10-28 22:49:09,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3395 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3395) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1)) 800) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|)))) is different from false [2024-10-28 22:49:10,639 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3389 (Array Int Int)) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|)))))) is different from false [2024-10-28 22:49:10,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3389 (Array Int Int)) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|)))))) is different from false [2024-10-28 22:49:16,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int)) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_3387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_3395) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse3) 800) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|))))))) is different from false [2024-10-28 22:49:16,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3378 Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))))) (let ((.cse4 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800))))))) is different from false [2024-10-28 22:49:27,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse2 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|))))))) is different from false [2024-10-28 22:49:27,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))))) (let ((.cse8 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|)))))))) is different from false [2024-10-28 22:49:27,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3370) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))))) (let ((.cse7 (let ((.cse11 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse3 (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|)))))))) is different from false [2024-10-28 22:50:03,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse0 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse3 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|)))))))) is different from false [2024-10-28 22:50:03,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse7 (let ((.cse11 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse5 (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|)))))))) is different from false [2024-10-28 22:50:03,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))))) (let ((.cse8 (let ((.cse13 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse12 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse9 (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse3 (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|))))))))) is different from false [2024-10-28 22:50:03,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3387 Int) (v_ArrVal_3395 Int) (v_ArrVal_3363 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3389 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3363) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))))) (let ((.cse9 (let ((.cse13 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|))) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse12 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_3370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse4 (let ((.cse11 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse8 v_ArrVal_3378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse7 (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_3387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_3395) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse3) 800) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|))))))))) is different from false [2024-10-28 22:51:12,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3387 Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3360) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3 v_ArrVal_3363) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse9 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse7 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse2 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select (store (store (store .cse4 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 v_ArrVal_3360) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|))))))))) is different from false [2024-10-28 22:51:12,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3387 Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| 1))))) (let ((.cse0 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse16 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 v_ArrVal_3360) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1 v_ArrVal_3363) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse9 (let ((.cse15 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse12 .cse1 v_ArrVal_3370) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse5 (let ((.cse14 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_3378) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse8 (let ((.cse13 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_3387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_3360) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_3395) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse4) 800) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse10 .cse11) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257|) (< (select .cse12 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|))))))))))) is different from false [2024-10-28 22:51:13,051 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3387 Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3355 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3355) .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| 1))))) (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3200 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1)))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse16 (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse7 .cse8 v_ArrVal_3360) .cse9 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3363) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse0 (let ((.cse15 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse6 (let ((.cse14 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse4 (let ((.cse13 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 v_ArrVal_3360) .cse9 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse10 .cse11) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|))))))))))) is different from false [2024-10-28 22:52:53,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3387 Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3355 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (v_ArrVal_3352 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147| Int) (v_ArrVal_3349 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3349) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse10 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse9 .cse2 v_ArrVal_3352) .cse10 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse1 v_ArrVal_3355) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| 1))) |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|))) (let ((.cse3 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 v_ArrVal_3360) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1 v_ArrVal_3363) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse8 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_3370) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse11 (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_3378) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse7 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse1 v_ArrVal_3387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147|)) .cse2 v_ArrVal_3360) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_3395) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse4) 800) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select (store (store (store .cse9 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_3352) .cse10 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select .cse11 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|))))))))))) is different from false [2024-10-28 22:52:53,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3387 Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3355 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (v_ArrVal_3352 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147| Int) (v_ArrVal_3349 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse11 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3349) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3200 |c_~#queue~0.offset|)) (.cse12 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse11 .cse9 v_ArrVal_3352) .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse5 v_ArrVal_3355) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| 1))) |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|))) (let ((.cse10 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse16 (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse8 .cse9 v_ArrVal_3360) .cse10 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3363) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse0 (let ((.cse15 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse7 (let ((.cse14 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse4 (let ((.cse13 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select (store (store (store .cse8 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147|)) .cse9 v_ArrVal_3360) .cse10 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select (store (store (store .cse11 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse9 v_ArrVal_3352) .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257|)))))))))))) is different from false [2024-10-28 22:52:53,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_260| Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3355 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (v_ArrVal_3352 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147| Int) (v_ArrVal_3349 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_260| 1))))) (let ((.cse12 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_3349) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ 3200 |c_~#queue~0.offset|)) (.cse13 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse12 .cse6 v_ArrVal_3352) .cse13 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse5 v_ArrVal_3355) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| 1))) |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (let ((.cse10 (let ((.cse18 (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse4 .cse6 v_ArrVal_3360) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3363) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse18 (+ (* 4 (select .cse18 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse14 (let ((.cse17 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_3370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse11 (let ((.cse16 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_3378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse2 (let ((.cse15 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_3387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_260|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select (store (store (store .cse4 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147|)) .cse6 v_ArrVal_3360) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_3395) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse3) 800) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (store (store (store .cse12 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 v_ArrVal_3352) .cse13 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257|) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|))))))))))))) is different from false [2024-10-28 22:52:54,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_129| Int) (v_ArrVal_3347 Int) (v_ArrVal_3387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_260| Int) (v_ArrVal_3363 Int) (v_ArrVal_3360 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| Int) (v_ArrVal_3373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| Int) (v_ArrVal_3397 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| Int) (v_ArrVal_3357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3355 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_137| Int) (v_ArrVal_3378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_135| Int) (v_ArrVal_3395 Int) (v_ArrVal_3352 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_133| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| Int) (v_ArrVal_3381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_131| Int) (v_ArrVal_3370 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3389 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147| Int) (v_ArrVal_3349 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3347) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_260| 1))))) (let ((.cse9 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_3349) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse10 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse14 |c_~#queue~0.base| (store (store (store (store .cse9 .cse4 v_ArrVal_3352) .cse10 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse3 v_ArrVal_3355) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257| 1))) |c_~#stored_elements~0.base| v_ArrVal_3357) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse18 (select (store (store .cse14 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 v_ArrVal_3360) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3 v_ArrVal_3363) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254| 1))) |c_~#stored_elements~0.base| v_ArrVal_3365) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_137|)))) (let ((.cse11 (let ((.cse17 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse3 v_ArrVal_3370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251| 1))) |c_~#stored_elements~0.base| v_ArrVal_3373) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_135|)))) (let ((.cse0 (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_3378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248| 1))) |c_~#stored_elements~0.base| v_ArrVal_3381) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_133|)))) (let ((.cse8 (let ((.cse15 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_3387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245| 1))) |c_~#stored_elements~0.base| v_ArrVal_3389) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_131|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_245|) (< (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_147|)) .cse4 v_ArrVal_3360) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_254|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_260|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242|) (< (select (store (store (store .cse9 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_3352) .cse10 |v_t1Thread1of1ForFork0_enqueue_~x#1_141|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_257|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_248|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_251|) (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_3395) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_242| 1))) |c_~#stored_elements~0.base| v_ArrVal_3397) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_129|)) .cse1) 800))))))))))))) is different from false Killed by 15