/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:22:23,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:22:23,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:22:23,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:22:23,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:22:23,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:22:23,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:22:23,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:22:23,841 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:22:23,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:22:23,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:22:23,842 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:22:23,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:22:23,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:22:24,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:22:24,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:22:24,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:22:24,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:22:24,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:22:24,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2025-03-15 01:22:25,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e46d26c/1d27574291d843b1b3f480c02be7e45f/FLAG006a637e9 [2025-03-15 01:22:25,701 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:22:25,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2025-03-15 01:22:25,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e46d26c/1d27574291d843b1b3f480c02be7e45f/FLAG006a637e9 [2025-03-15 01:22:26,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e46d26c/1d27574291d843b1b3f480c02be7e45f [2025-03-15 01:22:26,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:22:26,036 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:22:26,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:22:26,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:22:26,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:22:26,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8811ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26, skipping insertion in model container [2025-03-15 01:22:26,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:22:26,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:22:26,468 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:22:26,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:22:26,626 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:22:26,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26 WrapperNode [2025-03-15 01:22:26,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:22:26,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:22:26,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:22:26,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:22:26,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,685 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 307 [2025-03-15 01:22:26,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:22:26,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:22:26,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:22:26,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:22:26,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:22:26,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:22:26,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:22:26,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:22:26,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (1/1) ... [2025-03-15 01:22:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:22:26,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:22:26,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:22:26,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:22:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:22:26,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:22:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:22:26,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:22:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:22:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:22:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:22:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:22:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:22:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:22:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:22:26,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:22:26,824 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:22:26,945 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:22:26,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:22:27,363 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:22:27,363 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:22:27,396 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:22:27,397 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:22:27,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:22:27 BoogieIcfgContainer [2025-03-15 01:22:27,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:22:27,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:22:27,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:22:27,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:22:27,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:22:26" (1/3) ... [2025-03-15 01:22:27,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9509f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:22:27, skipping insertion in model container [2025-03-15 01:22:27,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:22:26" (2/3) ... [2025-03-15 01:22:27,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9509f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:22:27, skipping insertion in model container [2025-03-15 01:22:27,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:22:27" (3/3) ... [2025-03-15 01:22:27,405 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-15 01:22:27,419 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:22:27,420 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 342 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-15 01:22:27,420 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:22:27,539 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:22:27,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:22:27,601 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@31bb29d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:22:27,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-15 01:22:27,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:22:27,668 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2025-03-15 01:22:27,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:22:27,670 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:27,671 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:27,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:27,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2045219038, now seen corresponding path program 1 times [2025-03-15 01:22:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:27,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234431407] [2025-03-15 01:22:27,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:28,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:28,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234431407] [2025-03-15 01:22:28,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234431407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:28,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:28,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:22:28,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473325671] [2025-03-15 01:22:28,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:28,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:22:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:28,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:22:28,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:22:28,178 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2025-03-15 01:22:28,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 357 transitions, 728 flow. Second operand has 4 states, 4 states have (on average 327.25) internal successors, (1309), 4 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:28,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:28,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2025-03-15 01:22:28,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:28,546 INFO L124 PetriNetUnfolderBase]: 163/1430 cut-off events. [2025-03-15 01:22:28,546 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-15 01:22:28,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 1430 events. 163/1430 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8657 event pairs, 69 based on Foata normal form. 40/1286 useless extension candidates. Maximal degree in co-relation 1437. Up to 166 conditions per place. [2025-03-15 01:22:28,567 INFO L140 encePairwiseOnDemand]: 345/357 looper letters, 41 selfloop transitions, 4 changer transitions 5/363 dead transitions. [2025-03-15 01:22:28,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 363 transitions, 839 flow [2025-03-15 01:22:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:22:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:22:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1687 transitions. [2025-03-15 01:22:28,586 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9450980392156862 [2025-03-15 01:22:28,590 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, -8 predicate places. [2025-03-15 01:22:28,590 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 363 transitions, 839 flow [2025-03-15 01:22:28,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 327.25) internal successors, (1309), 4 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:28,591 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:28,591 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:28,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:22:28,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:28,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 520968124, now seen corresponding path program 1 times [2025-03-15 01:22:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:28,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469508959] [2025-03-15 01:22:28,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469508959] [2025-03-15 01:22:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469508959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 01:22:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311557749] [2025-03-15 01:22:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:22:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:29,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:22:29,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:22:29,825 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 357 [2025-03-15 01:22:29,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 363 transitions, 839 flow. Second operand has 12 states, 12 states have (on average 230.91666666666666) internal successors, (2771), 12 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:29,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:29,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 357 [2025-03-15 01:22:29,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:30,954 INFO L124 PetriNetUnfolderBase]: 1045/5168 cut-off events. [2025-03-15 01:22:30,954 INFO L125 PetriNetUnfolderBase]: For 683/778 co-relation queries the response was YES. [2025-03-15 01:22:30,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7652 conditions, 5168 events. 1045/5168 cut-off events. For 683/778 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 45280 event pairs, 319 based on Foata normal form. 32/4547 useless extension candidates. Maximal degree in co-relation 7199. Up to 1544 conditions per place. [2025-03-15 01:22:30,989 INFO L140 encePairwiseOnDemand]: 340/357 looper letters, 138 selfloop transitions, 16 changer transitions 5/376 dead transitions. [2025-03-15 01:22:30,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 376 transitions, 1196 flow [2025-03-15 01:22:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:22:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:22:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3045 transitions. [2025-03-15 01:22:30,996 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6561085972850679 [2025-03-15 01:22:30,997 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 1 predicate places. [2025-03-15 01:22:30,997 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 376 transitions, 1196 flow [2025-03-15 01:22:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 230.91666666666666) internal successors, (2771), 12 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:30,998 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:30,999 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:30,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:22:30,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:30,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1740183172, now seen corresponding path program 1 times [2025-03-15 01:22:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:31,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784380288] [2025-03-15 01:22:31,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784380288] [2025-03-15 01:22:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784380288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:31,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:31,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 01:22:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178395978] [2025-03-15 01:22:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 01:22:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:31,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 01:22:31,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 01:22:31,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 357 [2025-03-15 01:22:31,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 376 transitions, 1196 flow. Second operand has 13 states, 13 states have (on average 214.30769230769232) internal successors, (2786), 13 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:31,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:31,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 357 [2025-03-15 01:22:31,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:33,311 INFO L124 PetriNetUnfolderBase]: 1899/7104 cut-off events. [2025-03-15 01:22:33,311 INFO L125 PetriNetUnfolderBase]: For 3193/3499 co-relation queries the response was YES. [2025-03-15 01:22:33,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14238 conditions, 7104 events. 1899/7104 cut-off events. For 3193/3499 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 65647 event pairs, 469 based on Foata normal form. 70/6360 useless extension candidates. Maximal degree in co-relation 13647. Up to 2708 conditions per place. [2025-03-15 01:22:33,355 INFO L140 encePairwiseOnDemand]: 337/357 looper letters, 278 selfloop transitions, 26 changer transitions 5/507 dead transitions. [2025-03-15 01:22:33,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 507 transitions, 2441 flow [2025-03-15 01:22:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 01:22:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 01:22:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4216 transitions. [2025-03-15 01:22:33,364 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6215538847117794 [2025-03-15 01:22:33,365 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 19 predicate places. [2025-03-15 01:22:33,365 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 507 transitions, 2441 flow [2025-03-15 01:22:33,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 214.30769230769232) internal successors, (2786), 13 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:33,367 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:33,367 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:33,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:22:33,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash -91526371, now seen corresponding path program 1 times [2025-03-15 01:22:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206750991] [2025-03-15 01:22:33,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:33,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206750991] [2025-03-15 01:22:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206750991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:33,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:22:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478394260] [2025-03-15 01:22:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:33,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:22:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:33,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:22:33,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:22:33,547 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 357 [2025-03-15 01:22:33,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 507 transitions, 2441 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:33,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:33,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 357 [2025-03-15 01:22:33,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:34,216 INFO L124 PetriNetUnfolderBase]: 1315/5962 cut-off events. [2025-03-15 01:22:34,216 INFO L125 PetriNetUnfolderBase]: For 6189/6666 co-relation queries the response was YES. [2025-03-15 01:22:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12406 conditions, 5962 events. 1315/5962 cut-off events. For 6189/6666 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 48202 event pairs, 559 based on Foata normal form. 94/5277 useless extension candidates. Maximal degree in co-relation 11415. Up to 2232 conditions per place. [2025-03-15 01:22:34,244 INFO L140 encePairwiseOnDemand]: 353/357 looper letters, 98 selfloop transitions, 3 changer transitions 6/427 dead transitions. [2025-03-15 01:22:34,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 427 transitions, 2215 flow [2025-03-15 01:22:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:22:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:22:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2025-03-15 01:22:34,246 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9514472455648926 [2025-03-15 01:22:34,246 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 18 predicate places. [2025-03-15 01:22:34,246 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 427 transitions, 2215 flow [2025-03-15 01:22:34,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:34,247 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:34,247 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:34,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:22:34,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:34,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1290377282, now seen corresponding path program 1 times [2025-03-15 01:22:34,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:34,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785278254] [2025-03-15 01:22:34,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785278254] [2025-03-15 01:22:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785278254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:22:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446417929] [2025-03-15 01:22:34,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:34,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:22:34,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:22:34,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:22:34,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 01:22:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:34,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:22:34,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:22:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:34,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:22:34,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446417929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:34,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:22:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:22:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833110635] [2025-03-15 01:22:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:34,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:22:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:34,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:22:34,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:22:34,543 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2025-03-15 01:22:34,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 427 transitions, 2215 flow. Second operand has 5 states, 5 states have (on average 328.4) internal successors, (1642), 5 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:34,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:34,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2025-03-15 01:22:34,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:35,588 INFO L124 PetriNetUnfolderBase]: 1310/5856 cut-off events. [2025-03-15 01:22:35,588 INFO L125 PetriNetUnfolderBase]: For 13019/16387 co-relation queries the response was YES. [2025-03-15 01:22:35,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13186 conditions, 5856 events. 1310/5856 cut-off events. For 13019/16387 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 47911 event pairs, 491 based on Foata normal form. 460/5556 useless extension candidates. Maximal degree in co-relation 12097. Up to 2202 conditions per place. [2025-03-15 01:22:35,623 INFO L140 encePairwiseOnDemand]: 353/357 looper letters, 122 selfloop transitions, 5 changer transitions 6/442 dead transitions. [2025-03-15 01:22:35,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 442 transitions, 2641 flow [2025-03-15 01:22:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:22:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:22:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1332 transitions. [2025-03-15 01:22:35,626 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9327731092436975 [2025-03-15 01:22:35,627 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 20 predicate places. [2025-03-15 01:22:35,627 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 442 transitions, 2641 flow [2025-03-15 01:22:35,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 328.4) internal successors, (1642), 5 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:35,628 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:35,628 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:35,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:22:35,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:22:35,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1346991083, now seen corresponding path program 1 times [2025-03-15 01:22:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692813393] [2025-03-15 01:22:35,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:22:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692813393] [2025-03-15 01:22:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692813393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:22:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765060984] [2025-03-15 01:22:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:35,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:22:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:35,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:22:35,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:22:35,898 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2025-03-15 01:22:35,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 442 transitions, 2641 flow. Second operand has 4 states, 4 states have (on average 329.5) internal successors, (1318), 4 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:35,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:35,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2025-03-15 01:22:35,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:36,496 INFO L124 PetriNetUnfolderBase]: 1302/5839 cut-off events. [2025-03-15 01:22:36,497 INFO L125 PetriNetUnfolderBase]: For 17094/24247 co-relation queries the response was YES. [2025-03-15 01:22:36,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14054 conditions, 5839 events. 1302/5839 cut-off events. For 17094/24247 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 47724 event pairs, 491 based on Foata normal form. 820/5922 useless extension candidates. Maximal degree in co-relation 12871. Up to 2195 conditions per place. [2025-03-15 01:22:36,528 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 126 selfloop transitions, 8 changer transitions 14/457 dead transitions. [2025-03-15 01:22:36,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 457 transitions, 3127 flow [2025-03-15 01:22:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:22:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:22:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1662 transitions. [2025-03-15 01:22:36,532 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9310924369747899 [2025-03-15 01:22:36,532 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 23 predicate places. [2025-03-15 01:22:36,532 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 457 transitions, 3127 flow [2025-03-15 01:22:36,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 329.5) internal successors, (1318), 4 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:36,533 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:36,533 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:22:36,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -551756819, now seen corresponding path program 1 times [2025-03-15 01:22:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140913865] [2025-03-15 01:22:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140913865] [2025-03-15 01:22:37,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140913865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:37,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:37,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:22:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260437816] [2025-03-15 01:22:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:37,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:22:37,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:37,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:22:37,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:22:37,105 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 357 [2025-03-15 01:22:37,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 457 transitions, 3127 flow. Second operand has 14 states, 14 states have (on average 212.28571428571428) internal successors, (2972), 14 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:37,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:37,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 357 [2025-03-15 01:22:37,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:38,468 INFO L124 PetriNetUnfolderBase]: 1554/6581 cut-off events. [2025-03-15 01:22:38,468 INFO L125 PetriNetUnfolderBase]: For 25047/28266 co-relation queries the response was YES. [2025-03-15 01:22:38,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18353 conditions, 6581 events. 1554/6581 cut-off events. For 25047/28266 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 54997 event pairs, 599 based on Foata normal form. 197/5953 useless extension candidates. Maximal degree in co-relation 16994. Up to 2419 conditions per place. [2025-03-15 01:22:38,514 INFO L140 encePairwiseOnDemand]: 335/357 looper letters, 252 selfloop transitions, 20 changer transitions 14/480 dead transitions. [2025-03-15 01:22:38,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 480 transitions, 4052 flow [2025-03-15 01:22:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 01:22:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 01:22:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3255 transitions. [2025-03-15 01:22:38,520 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-15 01:22:38,520 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 35 predicate places. [2025-03-15 01:22:38,520 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 480 transitions, 4052 flow [2025-03-15 01:22:38,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 212.28571428571428) internal successors, (2972), 14 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:38,522 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:38,522 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:38,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:22:38,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:38,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash 436066555, now seen corresponding path program 1 times [2025-03-15 01:22:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:38,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347488912] [2025-03-15 01:22:38,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347488912] [2025-03-15 01:22:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347488912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:38,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:38,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:22:38,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21086074] [2025-03-15 01:22:38,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:38,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:22:38,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:38,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:22:38,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:22:38,582 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 357 [2025-03-15 01:22:38,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 480 transitions, 4052 flow. Second operand has 4 states, 4 states have (on average 323.5) internal successors, (1294), 4 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:38,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:38,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 357 [2025-03-15 01:22:38,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:39,746 INFO L124 PetriNetUnfolderBase]: 2100/7684 cut-off events. [2025-03-15 01:22:39,747 INFO L125 PetriNetUnfolderBase]: For 60280/65977 co-relation queries the response was YES. [2025-03-15 01:22:39,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25809 conditions, 7684 events. 2100/7684 cut-off events. For 60280/65977 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 65983 event pairs, 631 based on Foata normal form. 383/7105 useless extension candidates. Maximal degree in co-relation 24198. Up to 3079 conditions per place. [2025-03-15 01:22:39,792 INFO L140 encePairwiseOnDemand]: 348/357 looper letters, 217 selfloop transitions, 4 changer transitions 14/543 dead transitions. [2025-03-15 01:22:39,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 543 transitions, 5420 flow [2025-03-15 01:22:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:22:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:22:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1656 transitions. [2025-03-15 01:22:39,795 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9277310924369748 [2025-03-15 01:22:39,795 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 39 predicate places. [2025-03-15 01:22:39,795 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 543 transitions, 5420 flow [2025-03-15 01:22:39,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 323.5) internal successors, (1294), 4 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:39,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:39,796 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:39,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:22:39,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1666370504, now seen corresponding path program 1 times [2025-03-15 01:22:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512560445] [2025-03-15 01:22:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512560445] [2025-03-15 01:22:39,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512560445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:22:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699010288] [2025-03-15 01:22:39,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:39,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:22:39,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:22:39,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:22:39,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:22:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:40,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:22:40,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:22:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:40,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:22:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699010288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:22:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:22:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909874950] [2025-03-15 01:22:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:40,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:22:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:40,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:22:40,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:22:40,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 357 [2025-03-15 01:22:40,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 543 transitions, 5420 flow. Second operand has 5 states, 5 states have (on average 324.6) internal successors, (1623), 5 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:40,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:40,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 357 [2025-03-15 01:22:40,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:41,108 INFO L124 PetriNetUnfolderBase]: 2072/7604 cut-off events. [2025-03-15 01:22:41,108 INFO L125 PetriNetUnfolderBase]: For 74470/81591 co-relation queries the response was YES. [2025-03-15 01:22:41,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27300 conditions, 7604 events. 2072/7604 cut-off events. For 74470/81591 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 65137 event pairs, 632 based on Foata normal form. 373/7075 useless extension candidates. Maximal degree in co-relation 25590. Up to 3051 conditions per place. [2025-03-15 01:22:41,158 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 229 selfloop transitions, 5 changer transitions 14/556 dead transitions. [2025-03-15 01:22:41,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 556 transitions, 6179 flow [2025-03-15 01:22:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:22:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:22:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1316 transitions. [2025-03-15 01:22:41,160 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2025-03-15 01:22:41,161 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 40 predicate places. [2025-03-15 01:22:41,161 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 556 transitions, 6179 flow [2025-03-15 01:22:41,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 324.6) internal successors, (1623), 5 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:41,161 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:41,162 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:41,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 01:22:41,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-15 01:22:41,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 945407732, now seen corresponding path program 1 times [2025-03-15 01:22:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662129477] [2025-03-15 01:22:41,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:42,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662129477] [2025-03-15 01:22:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662129477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:42,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:42,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 01:22:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399316381] [2025-03-15 01:22:42,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:42,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:22:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:42,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:22:42,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:22:42,243 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 357 [2025-03-15 01:22:42,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 556 transitions, 6179 flow. Second operand has 14 states, 14 states have (on average 219.35714285714286) internal successors, (3071), 14 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:42,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:42,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 357 [2025-03-15 01:22:42,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:44,231 INFO L124 PetriNetUnfolderBase]: 2240/8096 cut-off events. [2025-03-15 01:22:44,231 INFO L125 PetriNetUnfolderBase]: For 99512/106348 co-relation queries the response was YES. [2025-03-15 01:22:44,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32095 conditions, 8096 events. 2240/8096 cut-off events. For 99512/106348 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 70457 event pairs, 704 based on Foata normal form. 341/7479 useless extension candidates. Maximal degree in co-relation 30192. Up to 3211 conditions per place. [2025-03-15 01:22:44,313 INFO L140 encePairwiseOnDemand]: 339/357 looper letters, 323 selfloop transitions, 17 changer transitions 14/558 dead transitions. [2025-03-15 01:22:44,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 558 transitions, 6970 flow [2025-03-15 01:22:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 01:22:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 01:22:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2692 transitions. [2025-03-15 01:22:44,317 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6283846872082166 [2025-03-15 01:22:44,318 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 49 predicate places. [2025-03-15 01:22:44,318 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 558 transitions, 6970 flow [2025-03-15 01:22:44,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 219.35714285714286) internal successors, (3071), 14 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:44,318 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:44,319 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:44,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:22:44,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:44,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1934684349, now seen corresponding path program 1 times [2025-03-15 01:22:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665066594] [2025-03-15 01:22:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:45,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:45,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665066594] [2025-03-15 01:22:45,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665066594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:45,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-15 01:22:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839928571] [2025-03-15 01:22:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-15 01:22:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:45,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-15 01:22:45,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-03-15 01:22:45,589 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 357 [2025-03-15 01:22:45,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 558 transitions, 6970 flow. Second operand has 26 states, 26 states have (on average 195.42307692307693) internal successors, (5081), 26 states have internal predecessors, (5081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:45,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:45,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 357 [2025-03-15 01:22:45,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:48,792 INFO L124 PetriNetUnfolderBase]: 2326/6524 cut-off events. [2025-03-15 01:22:48,793 INFO L125 PetriNetUnfolderBase]: For 129252/138036 co-relation queries the response was YES. [2025-03-15 01:22:48,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36187 conditions, 6524 events. 2326/6524 cut-off events. For 129252/138036 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 52948 event pairs, 686 based on Foata normal form. 447/6263 useless extension candidates. Maximal degree in co-relation 33803. Up to 3365 conditions per place. [2025-03-15 01:22:48,844 INFO L140 encePairwiseOnDemand]: 316/357 looper letters, 514 selfloop transitions, 41 changer transitions 22/762 dead transitions. [2025-03-15 01:22:48,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 762 transitions, 12171 flow [2025-03-15 01:22:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-15 01:22:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-15 01:22:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6956 transitions. [2025-03-15 01:22:48,851 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5567026810724289 [2025-03-15 01:22:48,851 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 83 predicate places. [2025-03-15 01:22:48,851 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 762 transitions, 12171 flow [2025-03-15 01:22:48,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 195.42307692307693) internal successors, (5081), 26 states have internal predecessors, (5081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:48,853 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:48,853 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:48,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:22:48,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:48,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 484926919, now seen corresponding path program 1 times [2025-03-15 01:22:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144157251] [2025-03-15 01:22:48,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:22:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144157251] [2025-03-15 01:22:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144157251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:22:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216928100] [2025-03-15 01:22:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:48,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:22:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:48,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:22:48,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:22:48,902 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 357 [2025-03-15 01:22:48,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 762 transitions, 12171 flow. Second operand has 4 states, 4 states have (on average 325.75) internal successors, (1303), 4 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:48,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:48,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 357 [2025-03-15 01:22:48,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:49,887 INFO L124 PetriNetUnfolderBase]: 2297/6428 cut-off events. [2025-03-15 01:22:49,888 INFO L125 PetriNetUnfolderBase]: For 150993/161484 co-relation queries the response was YES. [2025-03-15 01:22:49,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37665 conditions, 6428 events. 2297/6428 cut-off events. For 150993/161484 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 51993 event pairs, 685 based on Foata normal form. 673/6473 useless extension candidates. Maximal degree in co-relation 35164. Up to 3336 conditions per place. [2025-03-15 01:22:49,939 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 413 selfloop transitions, 8 changer transitions 22/786 dead transitions. [2025-03-15 01:22:49,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 786 transitions, 13673 flow [2025-03-15 01:22:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:22:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:22:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1639 transitions. [2025-03-15 01:22:49,941 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9182072829131652 [2025-03-15 01:22:49,942 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 85 predicate places. [2025-03-15 01:22:49,942 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 786 transitions, 13673 flow [2025-03-15 01:22:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 325.75) internal successors, (1303), 4 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:49,942 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:49,942 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:49,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:22:49,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:49,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash -154326374, now seen corresponding path program 1 times [2025-03-15 01:22:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783974933] [2025-03-15 01:22:49,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:51,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:51,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783974933] [2025-03-15 01:22:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783974933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-15 01:22:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495057100] [2025-03-15 01:22:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:51,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-15 01:22:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:51,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-15 01:22:51,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-03-15 01:22:51,195 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 357 [2025-03-15 01:22:51,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 786 transitions, 13673 flow. Second operand has 26 states, 26 states have (on average 195.46153846153845) internal successors, (5082), 26 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:51,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:51,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 357 [2025-03-15 01:22:51,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:53,850 INFO L124 PetriNetUnfolderBase]: 2287/6406 cut-off events. [2025-03-15 01:22:53,851 INFO L125 PetriNetUnfolderBase]: For 163780/172746 co-relation queries the response was YES. [2025-03-15 01:22:53,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41350 conditions, 6406 events. 2287/6406 cut-off events. For 163780/172746 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 51734 event pairs, 667 based on Foata normal form. 441/6231 useless extension candidates. Maximal degree in co-relation 38641. Up to 3314 conditions per place. [2025-03-15 01:22:53,904 INFO L140 encePairwiseOnDemand]: 317/357 looper letters, 580 selfloop transitions, 39 changer transitions 22/824 dead transitions. [2025-03-15 01:22:53,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 824 transitions, 15828 flow [2025-03-15 01:22:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-15 01:22:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-15 01:22:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6748 transitions. [2025-03-15 01:22:53,907 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5559400230680508 [2025-03-15 01:22:53,908 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 118 predicate places. [2025-03-15 01:22:53,908 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 824 transitions, 15828 flow [2025-03-15 01:22:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 195.46153846153845) internal successors, (5082), 26 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:53,910 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:53,910 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:53,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:22:53,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 710557414, now seen corresponding path program 1 times [2025-03-15 01:22:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907226012] [2025-03-15 01:22:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:55,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907226012] [2025-03-15 01:22:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907226012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:55,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:55,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-15 01:22:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297443978] [2025-03-15 01:22:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 01:22:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:55,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 01:22:55,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-03-15 01:22:55,120 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 357 [2025-03-15 01:22:55,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 824 transitions, 15828 flow. Second operand has 23 states, 23 states have (on average 209.91304347826087) internal successors, (4828), 23 states have internal predecessors, (4828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:55,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:55,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 357 [2025-03-15 01:22:55,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:22:58,324 INFO L124 PetriNetUnfolderBase]: 3208/10356 cut-off events. [2025-03-15 01:22:58,325 INFO L125 PetriNetUnfolderBase]: For 246619/258905 co-relation queries the response was YES. [2025-03-15 01:22:58,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63787 conditions, 10356 events. 3208/10356 cut-off events. For 246619/258905 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 95977 event pairs, 450 based on Foata normal form. 505/9810 useless extension candidates. Maximal degree in co-relation 60028. Up to 4722 conditions per place. [2025-03-15 01:22:58,424 INFO L140 encePairwiseOnDemand]: 321/357 looper letters, 849 selfloop transitions, 60 changer transitions 23/1132 dead transitions. [2025-03-15 01:22:58,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 1132 transitions, 24923 flow [2025-03-15 01:22:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-15 01:22:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-15 01:22:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6042 transitions. [2025-03-15 01:22:58,431 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6044417767106842 [2025-03-15 01:22:58,432 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 145 predicate places. [2025-03-15 01:22:58,432 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 1132 transitions, 24923 flow [2025-03-15 01:22:58,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 209.91304347826087) internal successors, (4828), 23 states have internal predecessors, (4828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:58,433 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:22:58,433 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:22:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:22:58,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:22:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:22:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash 552444323, now seen corresponding path program 1 times [2025-03-15 01:22:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:22:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292238919] [2025-03-15 01:22:58,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:22:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:22:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:22:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:22:59,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:22:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292238919] [2025-03-15 01:22:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292238919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:22:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:22:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-15 01:22:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282249363] [2025-03-15 01:22:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:22:59,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 01:22:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:22:59,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 01:22:59,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-15 01:22:59,321 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 357 [2025-03-15 01:22:59,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1132 transitions, 24923 flow. Second operand has 23 states, 23 states have (on average 209.95652173913044) internal successors, (4829), 23 states have internal predecessors, (4829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:22:59,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:22:59,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 357 [2025-03-15 01:22:59,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:02,820 INFO L124 PetriNetUnfolderBase]: 3168/10206 cut-off events. [2025-03-15 01:23:02,820 INFO L125 PetriNetUnfolderBase]: For 277932/290542 co-relation queries the response was YES. [2025-03-15 01:23:02,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67913 conditions, 10206 events. 3168/10206 cut-off events. For 277932/290542 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 94183 event pairs, 434 based on Foata normal form. 498/9714 useless extension candidates. Maximal degree in co-relation 63894. Up to 4684 conditions per place. [2025-03-15 01:23:02,921 INFO L140 encePairwiseOnDemand]: 320/357 looper letters, 888 selfloop transitions, 56 changer transitions 23/1167 dead transitions. [2025-03-15 01:23:02,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1167 transitions, 27681 flow [2025-03-15 01:23:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 01:23:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 01:23:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5404 transitions. [2025-03-15 01:23:02,925 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6054901960784314 [2025-03-15 01:23:02,925 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 169 predicate places. [2025-03-15 01:23:02,925 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 1167 transitions, 27681 flow [2025-03-15 01:23:02,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 209.95652173913044) internal successors, (4829), 23 states have internal predecessors, (4829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:02,926 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:02,926 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:02,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:23:02,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1212729268, now seen corresponding path program 1 times [2025-03-15 01:23:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:02,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826132556] [2025-03-15 01:23:02,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826132556] [2025-03-15 01:23:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826132556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:23:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084439938] [2025-03-15 01:23:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:23:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:03,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:23:03,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:23:03,010 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 357 [2025-03-15 01:23:03,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 1167 transitions, 27681 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:03,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:03,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 357 [2025-03-15 01:23:03,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:03,737 INFO L124 PetriNetUnfolderBase]: 830/3601 cut-off events. [2025-03-15 01:23:03,737 INFO L125 PetriNetUnfolderBase]: For 233540/243107 co-relation queries the response was YES. [2025-03-15 01:23:03,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25177 conditions, 3601 events. 830/3601 cut-off events. For 233540/243107 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 28128 event pairs, 50 based on Foata normal form. 921/4164 useless extension candidates. Maximal degree in co-relation 21371. Up to 1409 conditions per place. [2025-03-15 01:23:03,765 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 132 selfloop transitions, 223 changer transitions 26/751 dead transitions. [2025-03-15 01:23:03,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 751 transitions, 16819 flow [2025-03-15 01:23:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:23:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:23:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:23:03,766 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9449112978524743 [2025-03-15 01:23:03,766 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 168 predicate places. [2025-03-15 01:23:03,766 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 751 transitions, 16819 flow [2025-03-15 01:23:03,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:03,767 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:03,767 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:03,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:23:03,767 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:03,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -949211893, now seen corresponding path program 1 times [2025-03-15 01:23:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235881091] [2025-03-15 01:23:03,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235881091] [2025-03-15 01:23:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235881091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:23:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113201103] [2025-03-15 01:23:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:03,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:23:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:03,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:23:03,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:23:03,823 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 357 [2025-03-15 01:23:03,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 751 transitions, 16819 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:03,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:03,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 357 [2025-03-15 01:23:03,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:04,386 INFO L124 PetriNetUnfolderBase]: 752/3027 cut-off events. [2025-03-15 01:23:04,386 INFO L125 PetriNetUnfolderBase]: For 139831/143550 co-relation queries the response was YES. [2025-03-15 01:23:04,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22672 conditions, 3027 events. 752/3027 cut-off events. For 139831/143550 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21721 event pairs, 47 based on Foata normal form. 94/2811 useless extension candidates. Maximal degree in co-relation 18763. Up to 1137 conditions per place. [2025-03-15 01:23:04,413 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 339 selfloop transitions, 4 changer transitions 29/723 dead transitions. [2025-03-15 01:23:04,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 723 transitions, 16918 flow [2025-03-15 01:23:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:23:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:23:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-03-15 01:23:04,414 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9505135387488328 [2025-03-15 01:23:04,414 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 170 predicate places. [2025-03-15 01:23:04,414 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 723 transitions, 16918 flow [2025-03-15 01:23:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:04,415 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:04,415 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:04,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:23:04,415 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:04,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2053503064, now seen corresponding path program 1 times [2025-03-15 01:23:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924515486] [2025-03-15 01:23:04,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:05,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924515486] [2025-03-15 01:23:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924515486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:05,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-15 01:23:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616950011] [2025-03-15 01:23:05,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-15 01:23:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:05,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-15 01:23:05,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-15 01:23:05,613 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 357 [2025-03-15 01:23:05,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 723 transitions, 16918 flow. Second operand has 22 states, 22 states have (on average 202.6818181818182) internal successors, (4459), 22 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:05,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:05,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 357 [2025-03-15 01:23:05,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:06,944 INFO L124 PetriNetUnfolderBase]: 573/2384 cut-off events. [2025-03-15 01:23:06,945 INFO L125 PetriNetUnfolderBase]: For 118719/121485 co-relation queries the response was YES. [2025-03-15 01:23:06,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18987 conditions, 2384 events. 573/2384 cut-off events. For 118719/121485 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 15115 event pairs, 33 based on Foata normal form. 68/2225 useless extension candidates. Maximal degree in co-relation 15797. Up to 906 conditions per place. [2025-03-15 01:23:06,966 INFO L140 encePairwiseOnDemand]: 325/357 looper letters, 384 selfloop transitions, 31 changer transitions 28/637 dead transitions. [2025-03-15 01:23:06,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 637 transitions, 14730 flow [2025-03-15 01:23:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 01:23:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 01:23:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4520 transitions. [2025-03-15 01:23:06,969 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5755029284441049 [2025-03-15 01:23:06,969 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 190 predicate places. [2025-03-15 01:23:06,969 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 637 transitions, 14730 flow [2025-03-15 01:23:06,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 202.6818181818182) internal successors, (4459), 22 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:06,974 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:06,974 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:23:06,975 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1846952352, now seen corresponding path program 1 times [2025-03-15 01:23:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159782793] [2025-03-15 01:23:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:08,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159782793] [2025-03-15 01:23:08,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159782793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-15 01:23:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454971823] [2025-03-15 01:23:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:08,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-15 01:23:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:08,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-15 01:23:08,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2025-03-15 01:23:08,648 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 357 [2025-03-15 01:23:08,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 637 transitions, 14730 flow. Second operand has 33 states, 33 states have (on average 184.27272727272728) internal successors, (6081), 33 states have internal predecessors, (6081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:08,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:08,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 357 [2025-03-15 01:23:08,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:10,928 INFO L124 PetriNetUnfolderBase]: 676/2749 cut-off events. [2025-03-15 01:23:10,928 INFO L125 PetriNetUnfolderBase]: For 158649/162263 co-relation queries the response was YES. [2025-03-15 01:23:10,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23125 conditions, 2749 events. 676/2749 cut-off events. For 158649/162263 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 17648 event pairs, 46 based on Foata normal form. 91/2576 useless extension candidates. Maximal degree in co-relation 18506. Up to 1032 conditions per place. [2025-03-15 01:23:10,951 INFO L140 encePairwiseOnDemand]: 309/357 looper letters, 446 selfloop transitions, 47 changer transitions 29/696 dead transitions. [2025-03-15 01:23:10,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 696 transitions, 17664 flow [2025-03-15 01:23:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-15 01:23:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-15 01:23:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 7806 transitions. [2025-03-15 01:23:10,956 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5206082432973189 [2025-03-15 01:23:10,956 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 231 predicate places. [2025-03-15 01:23:10,956 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 696 transitions, 17664 flow [2025-03-15 01:23:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 184.27272727272728) internal successors, (6081), 33 states have internal predecessors, (6081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:10,958 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:10,958 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:10,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:23:10,958 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:10,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:10,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1420949082, now seen corresponding path program 1 times [2025-03-15 01:23:10,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:10,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97428648] [2025-03-15 01:23:10,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97428648] [2025-03-15 01:23:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97428648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:11,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-15 01:23:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421430628] [2025-03-15 01:23:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 01:23:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:11,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 01:23:11,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-15 01:23:11,696 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 357 [2025-03-15 01:23:11,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 696 transitions, 17664 flow. Second operand has 16 states, 16 states have (on average 209.75) internal successors, (3356), 16 states have internal predecessors, (3356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:11,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:11,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 357 [2025-03-15 01:23:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:13,015 INFO L124 PetriNetUnfolderBase]: 681/2654 cut-off events. [2025-03-15 01:23:13,015 INFO L125 PetriNetUnfolderBase]: For 174912/178630 co-relation queries the response was YES. [2025-03-15 01:23:13,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24111 conditions, 2654 events. 681/2654 cut-off events. For 174912/178630 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 16547 event pairs, 46 based on Foata normal form. 110/2519 useless extension candidates. Maximal degree in co-relation 19120. Up to 1017 conditions per place. [2025-03-15 01:23:13,043 INFO L140 encePairwiseOnDemand]: 324/357 looper letters, 428 selfloop transitions, 46 changer transitions 31/706 dead transitions. [2025-03-15 01:23:13,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 706 transitions, 19174 flow [2025-03-15 01:23:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 01:23:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 01:23:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3586 transitions. [2025-03-15 01:23:13,046 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.590871642774757 [2025-03-15 01:23:13,046 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 246 predicate places. [2025-03-15 01:23:13,046 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 706 transitions, 19174 flow [2025-03-15 01:23:13,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 209.75) internal successors, (3356), 16 states have internal predecessors, (3356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:13,047 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:13,047 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:13,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:23:13,049 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -319010327, now seen corresponding path program 1 times [2025-03-15 01:23:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920960644] [2025-03-15 01:23:13,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:15,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920960644] [2025-03-15 01:23:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920960644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2025-03-15 01:23:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34122296] [2025-03-15 01:23:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 01:23:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 01:23:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2025-03-15 01:23:15,008 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 357 [2025-03-15 01:23:15,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 706 transitions, 19174 flow. Second operand has 31 states, 31 states have (on average 192.58064516129033) internal successors, (5970), 31 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:15,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:15,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 357 [2025-03-15 01:23:15,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:16,952 INFO L124 PetriNetUnfolderBase]: 752/3024 cut-off events. [2025-03-15 01:23:16,952 INFO L125 PetriNetUnfolderBase]: For 221251/225323 co-relation queries the response was YES. [2025-03-15 01:23:16,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28175 conditions, 3024 events. 752/3024 cut-off events. For 221251/225323 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19027 event pairs, 67 based on Foata normal form. 107/2855 useless extension candidates. Maximal degree in co-relation 22117. Up to 1130 conditions per place. [2025-03-15 01:23:16,986 INFO L140 encePairwiseOnDemand]: 318/357 looper letters, 503 selfloop transitions, 40 changer transitions 40/772 dead transitions. [2025-03-15 01:23:16,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 772 transitions, 22331 flow [2025-03-15 01:23:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:23:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:23:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6453 transitions. [2025-03-15 01:23:16,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5477463712757831 [2025-03-15 01:23:16,990 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 278 predicate places. [2025-03-15 01:23:16,990 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 772 transitions, 22331 flow [2025-03-15 01:23:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 192.58064516129033) internal successors, (5970), 31 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:16,992 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:16,992 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:16,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:23:16,992 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1769096347, now seen corresponding path program 1 times [2025-03-15 01:23:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360738739] [2025-03-15 01:23:16,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:18,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360738739] [2025-03-15 01:23:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360738739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2025-03-15 01:23:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122364095] [2025-03-15 01:23:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 01:23:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:18,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 01:23:18,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-03-15 01:23:18,774 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 357 [2025-03-15 01:23:18,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 772 transitions, 22331 flow. Second operand has 31 states, 31 states have (on average 190.58064516129033) internal successors, (5908), 31 states have internal predecessors, (5908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:18,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:18,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 357 [2025-03-15 01:23:18,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:21,093 INFO L124 PetriNetUnfolderBase]: 760/3087 cut-off events. [2025-03-15 01:23:21,093 INFO L125 PetriNetUnfolderBase]: For 240490/244891 co-relation queries the response was YES. [2025-03-15 01:23:21,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30312 conditions, 3087 events. 760/3087 cut-off events. For 240490/244891 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19369 event pairs, 57 based on Foata normal form. 95/2888 useless extension candidates. Maximal degree in co-relation 23967. Up to 1183 conditions per place. [2025-03-15 01:23:21,199 INFO L140 encePairwiseOnDemand]: 313/357 looper letters, 460 selfloop transitions, 43 changer transitions 72/775 dead transitions. [2025-03-15 01:23:21,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 775 transitions, 23657 flow [2025-03-15 01:23:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-15 01:23:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-15 01:23:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 6177 transitions. [2025-03-15 01:23:21,203 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.540703781512605 [2025-03-15 01:23:21,204 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 309 predicate places. [2025-03-15 01:23:21,204 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 775 transitions, 23657 flow [2025-03-15 01:23:21,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 190.58064516129033) internal successors, (5908), 31 states have internal predecessors, (5908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:21,205 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:21,205 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:21,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:23:21,205 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1132475376, now seen corresponding path program 1 times [2025-03-15 01:23:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913924768] [2025-03-15 01:23:21,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913924768] [2025-03-15 01:23:24,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913924768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:24,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:24,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2025-03-15 01:23:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703734558] [2025-03-15 01:23:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-15 01:23:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:24,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-15 01:23:24,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1561, Unknown=0, NotChecked=0, Total=1722 [2025-03-15 01:23:24,223 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 357 [2025-03-15 01:23:24,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 775 transitions, 23657 flow. Second operand has 42 states, 42 states have (on average 183.83333333333334) internal successors, (7721), 42 states have internal predecessors, (7721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:24,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:24,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 357 [2025-03-15 01:23:24,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:27,788 INFO L124 PetriNetUnfolderBase]: 743/3192 cut-off events. [2025-03-15 01:23:27,789 INFO L125 PetriNetUnfolderBase]: For 255603/259347 co-relation queries the response was YES. [2025-03-15 01:23:27,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32058 conditions, 3192 events. 743/3192 cut-off events. For 255603/259347 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20167 event pairs, 56 based on Foata normal form. 97/3014 useless extension candidates. Maximal degree in co-relation 25453. Up to 1197 conditions per place. [2025-03-15 01:23:27,825 INFO L140 encePairwiseOnDemand]: 302/357 looper letters, 460 selfloop transitions, 64 changer transitions 72/783 dead transitions. [2025-03-15 01:23:27,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 783 transitions, 24979 flow [2025-03-15 01:23:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-15 01:23:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-15 01:23:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 10535 transitions. [2025-03-15 01:23:27,830 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5177158582731338 [2025-03-15 01:23:27,830 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 365 predicate places. [2025-03-15 01:23:27,831 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 783 transitions, 24979 flow [2025-03-15 01:23:27,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 183.83333333333334) internal successors, (7721), 42 states have internal predecessors, (7721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:27,832 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:27,832 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:27,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:23:27,832 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 193081815, now seen corresponding path program 1 times [2025-03-15 01:23:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218282790] [2025-03-15 01:23:27,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218282790] [2025-03-15 01:23:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218282790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:30,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:30,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2025-03-15 01:23:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973897165] [2025-03-15 01:23:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-15 01:23:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:30,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-15 01:23:30,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2025-03-15 01:23:30,166 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 357 [2025-03-15 01:23:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 783 transitions, 24979 flow. Second operand has 37 states, 37 states have (on average 184.3783783783784) internal successors, (6822), 37 states have internal predecessors, (6822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:30,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:30,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 357 [2025-03-15 01:23:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:33,393 INFO L124 PetriNetUnfolderBase]: 745/2941 cut-off events. [2025-03-15 01:23:33,393 INFO L125 PetriNetUnfolderBase]: For 278480/283221 co-relation queries the response was YES. [2025-03-15 01:23:33,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31938 conditions, 2941 events. 745/2941 cut-off events. For 278480/283221 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 18211 event pairs, 61 based on Foata normal form. 99/2778 useless extension candidates. Maximal degree in co-relation 24995. Up to 1109 conditions per place. [2025-03-15 01:23:33,426 INFO L140 encePairwiseOnDemand]: 302/357 looper letters, 460 selfloop transitions, 63 changer transitions 72/782 dead transitions. [2025-03-15 01:23:33,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 782 transitions, 26147 flow [2025-03-15 01:23:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-15 01:23:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-15 01:23:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 9812 transitions. [2025-03-15 01:23:33,431 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5185772422176418 [2025-03-15 01:23:33,431 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 417 predicate places. [2025-03-15 01:23:33,431 INFO L471 AbstractCegarLoop]: Abstraction has has 765 places, 782 transitions, 26147 flow [2025-03-15 01:23:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 184.3783783783784) internal successors, (6822), 37 states have internal predecessors, (6822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:33,432 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:33,432 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:33,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 01:23:33,432 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:33,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash -61226345, now seen corresponding path program 1 times [2025-03-15 01:23:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:33,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562899594] [2025-03-15 01:23:33,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562899594] [2025-03-15 01:23:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562899594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-15 01:23:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786456095] [2025-03-15 01:23:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:36,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-15 01:23:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:36,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-15 01:23:36,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2025-03-15 01:23:36,061 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 357 [2025-03-15 01:23:36,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 782 transitions, 26147 flow. Second operand has 32 states, 32 states have (on average 184.125) internal successors, (5892), 32 states have internal predecessors, (5892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:36,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:36,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 357 [2025-03-15 01:23:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:38,183 INFO L124 PetriNetUnfolderBase]: 741/2950 cut-off events. [2025-03-15 01:23:38,184 INFO L125 PetriNetUnfolderBase]: For 306172/311064 co-relation queries the response was YES. [2025-03-15 01:23:38,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33721 conditions, 2950 events. 741/2950 cut-off events. For 306172/311064 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 18268 event pairs, 57 based on Foata normal form. 96/2780 useless extension candidates. Maximal degree in co-relation 26572. Up to 1135 conditions per place. [2025-03-15 01:23:38,219 INFO L140 encePairwiseOnDemand]: 312/357 looper letters, 466 selfloop transitions, 44 changer transitions 72/782 dead transitions. [2025-03-15 01:23:38,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 782 transitions, 27261 flow [2025-03-15 01:23:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:23:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:23:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6134 transitions. [2025-03-15 01:23:38,222 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5206688736100501 [2025-03-15 01:23:38,222 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 449 predicate places. [2025-03-15 01:23:38,222 INFO L471 AbstractCegarLoop]: Abstraction has has 797 places, 782 transitions, 27261 flow [2025-03-15 01:23:38,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 184.125) internal successors, (5892), 32 states have internal predecessors, (5892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:38,223 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:38,223 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:38,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:23:38,223 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:38,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1734117423, now seen corresponding path program 1 times [2025-03-15 01:23:38,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:38,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215867605] [2025-03-15 01:23:38,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215867605] [2025-03-15 01:23:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215867605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-15 01:23:39,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528914324] [2025-03-15 01:23:39,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:39,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:23:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:39,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:23:39,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:23:39,252 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 357 [2025-03-15 01:23:39,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 782 transitions, 27261 flow. Second operand has 20 states, 20 states have (on average 208.75) internal successors, (4175), 20 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:39,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:39,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 357 [2025-03-15 01:23:39,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:41,020 INFO L124 PetriNetUnfolderBase]: 753/3040 cut-off events. [2025-03-15 01:23:41,020 INFO L125 PetriNetUnfolderBase]: For 333956/339082 co-relation queries the response was YES. [2025-03-15 01:23:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36170 conditions, 3040 events. 753/3040 cut-off events. For 333956/339082 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19048 event pairs, 52 based on Foata normal form. 140/2924 useless extension candidates. Maximal degree in co-relation 28720. Up to 1186 conditions per place. [2025-03-15 01:23:41,061 INFO L140 encePairwiseOnDemand]: 329/357 looper letters, 452 selfloop transitions, 47 changer transitions 72/782 dead transitions. [2025-03-15 01:23:41,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 782 transitions, 28424 flow [2025-03-15 01:23:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 01:23:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 01:23:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4389 transitions. [2025-03-15 01:23:41,063 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5854341736694678 [2025-03-15 01:23:41,063 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 468 predicate places. [2025-03-15 01:23:41,063 INFO L471 AbstractCegarLoop]: Abstraction has has 816 places, 782 transitions, 28424 flow [2025-03-15 01:23:41,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 208.75) internal successors, (4175), 20 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:41,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:41,064 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:41,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 01:23:41,064 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1136286206, now seen corresponding path program 1 times [2025-03-15 01:23:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767971568] [2025-03-15 01:23:41,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:43,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:43,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767971568] [2025-03-15 01:23:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767971568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:43,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-15 01:23:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444331825] [2025-03-15 01:23:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 01:23:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:43,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 01:23:43,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-03-15 01:23:43,445 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 357 [2025-03-15 01:23:43,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 816 places, 782 transitions, 28424 flow. Second operand has 30 states, 30 states have (on average 206.03333333333333) internal successors, (6181), 30 states have internal predecessors, (6181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:43,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:43,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 357 [2025-03-15 01:23:43,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:45,612 INFO L124 PetriNetUnfolderBase]: 899/3620 cut-off events. [2025-03-15 01:23:45,612 INFO L125 PetriNetUnfolderBase]: For 429971/435931 co-relation queries the response was YES. [2025-03-15 01:23:45,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43846 conditions, 3620 events. 899/3620 cut-off events. For 429971/435931 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 23540 event pairs, 81 based on Foata normal form. 106/3390 useless extension candidates. Maximal degree in co-relation 36034. Up to 1389 conditions per place. [2025-03-15 01:23:45,658 INFO L140 encePairwiseOnDemand]: 319/357 looper letters, 519 selfloop transitions, 56 changer transitions 80/876 dead transitions. [2025-03-15 01:23:45,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 849 places, 876 transitions, 34144 flow [2025-03-15 01:23:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-15 01:23:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-15 01:23:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 7063 transitions. [2025-03-15 01:23:45,661 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5818915801614764 [2025-03-15 01:23:45,661 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 501 predicate places. [2025-03-15 01:23:45,661 INFO L471 AbstractCegarLoop]: Abstraction has has 849 places, 876 transitions, 34144 flow [2025-03-15 01:23:45,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 206.03333333333333) internal successors, (6181), 30 states have internal predecessors, (6181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:45,662 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:45,662 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:45,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 01:23:45,662 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 737079096, now seen corresponding path program 1 times [2025-03-15 01:23:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691774856] [2025-03-15 01:23:45,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691774856] [2025-03-15 01:23:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691774856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:47,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-03-15 01:23:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514959272] [2025-03-15 01:23:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:47,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 01:23:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:47,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 01:23:47,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2025-03-15 01:23:47,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 357 [2025-03-15 01:23:47,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 876 transitions, 34144 flow. Second operand has 31 states, 31 states have (on average 198.32258064516128) internal successors, (6148), 31 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:47,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:47,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 357 [2025-03-15 01:23:47,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:50,082 INFO L124 PetriNetUnfolderBase]: 757/3254 cut-off events. [2025-03-15 01:23:50,082 INFO L125 PetriNetUnfolderBase]: For 384247/388083 co-relation queries the response was YES. [2025-03-15 01:23:50,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40344 conditions, 3254 events. 757/3254 cut-off events. For 384247/388083 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20392 event pairs, 74 based on Foata normal form. 91/3090 useless extension candidates. Maximal degree in co-relation 32296. Up to 1227 conditions per place. [2025-03-15 01:23:50,130 INFO L140 encePairwiseOnDemand]: 315/357 looper letters, 459 selfloop transitions, 48 changer transitions 72/792 dead transitions. [2025-03-15 01:23:50,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 792 transitions, 30968 flow [2025-03-15 01:23:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:23:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:23:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6606 transitions. [2025-03-15 01:23:50,133 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5607333842627961 [2025-03-15 01:23:50,133 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 533 predicate places. [2025-03-15 01:23:50,133 INFO L471 AbstractCegarLoop]: Abstraction has has 881 places, 792 transitions, 30968 flow [2025-03-15 01:23:50,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 198.32258064516128) internal successors, (6148), 31 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:50,134 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:50,134 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:50,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 01:23:50,134 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1483849782, now seen corresponding path program 1 times [2025-03-15 01:23:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011766703] [2025-03-15 01:23:50,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:23:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:23:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:23:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011766703] [2025-03-15 01:23:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011766703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:23:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:23:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2025-03-15 01:23:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941362637] [2025-03-15 01:23:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:23:53,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-15 01:23:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:23:53,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-15 01:23:53,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2234, Unknown=0, NotChecked=0, Total=2450 [2025-03-15 01:23:53,921 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 357 [2025-03-15 01:23:53,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 881 places, 792 transitions, 30968 flow. Second operand has 50 states, 50 states have (on average 179.82) internal successors, (8991), 50 states have internal predecessors, (8991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:53,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:23:53,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 357 [2025-03-15 01:23:53,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:23:58,425 INFO L124 PetriNetUnfolderBase]: 813/3307 cut-off events. [2025-03-15 01:23:58,426 INFO L125 PetriNetUnfolderBase]: For 436549/442188 co-relation queries the response was YES. [2025-03-15 01:23:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43027 conditions, 3307 events. 813/3307 cut-off events. For 436549/442188 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20317 event pairs, 71 based on Foata normal form. 95/3115 useless extension candidates. Maximal degree in co-relation 33465. Up to 1241 conditions per place. [2025-03-15 01:23:58,460 INFO L140 encePairwiseOnDemand]: 299/357 looper letters, 502 selfloop transitions, 74 changer transitions 73/836 dead transitions. [2025-03-15 01:23:58,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 836 transitions, 34350 flow [2025-03-15 01:23:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-15 01:23:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-03-15 01:23:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 12104 transitions. [2025-03-15 01:23:58,466 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5060412224591329 [2025-03-15 01:23:58,467 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 599 predicate places. [2025-03-15 01:23:58,467 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 836 transitions, 34350 flow [2025-03-15 01:23:58,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 179.82) internal successors, (8991), 50 states have internal predecessors, (8991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:23:58,468 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:23:58,468 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:23:58,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 01:23:58,468 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:23:58,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:23:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1626913703, now seen corresponding path program 1 times [2025-03-15 01:23:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:23:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170953606] [2025-03-15 01:23:58,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:23:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:23:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170953606] [2025-03-15 01:24:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170953606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:02,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:02,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2025-03-15 01:24:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432296142] [2025-03-15 01:24:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:02,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-15 01:24:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:02,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-15 01:24:02,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2025-03-15 01:24:02,841 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 357 [2025-03-15 01:24:02,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 836 transitions, 34350 flow. Second operand has 43 states, 43 states have (on average 190.1860465116279) internal successors, (8178), 43 states have internal predecessors, (8178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:02,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:02,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 357 [2025-03-15 01:24:02,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:06,205 INFO L124 PetriNetUnfolderBase]: 881/3301 cut-off events. [2025-03-15 01:24:06,206 INFO L125 PetriNetUnfolderBase]: For 518146/525171 co-relation queries the response was YES. [2025-03-15 01:24:06,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46228 conditions, 3301 events. 881/3301 cut-off events. For 518146/525171 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20367 event pairs, 58 based on Foata normal form. 128/3111 useless extension candidates. Maximal degree in co-relation 37490. Up to 1302 conditions per place. [2025-03-15 01:24:06,265 INFO L140 encePairwiseOnDemand]: 308/357 looper letters, 507 selfloop transitions, 60 changer transitions 100/881 dead transitions. [2025-03-15 01:24:06,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 881 transitions, 37967 flow [2025-03-15 01:24:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-15 01:24:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-15 01:24:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 9216 transitions. [2025-03-15 01:24:06,270 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5378151260504201 [2025-03-15 01:24:06,270 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 646 predicate places. [2025-03-15 01:24:06,270 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 881 transitions, 37967 flow [2025-03-15 01:24:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 190.1860465116279) internal successors, (8178), 43 states have internal predecessors, (8178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:06,272 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:06,272 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:06,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 01:24:06,272 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:24:06,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1931038144, now seen corresponding path program 1 times [2025-03-15 01:24:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805867850] [2025-03-15 01:24:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805867850] [2025-03-15 01:24:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805867850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:24:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723931960] [2025-03-15 01:24:11,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:11,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:24:11,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:11,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:24:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 01:24:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:11,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-15 01:24:11,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:24:11,932 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 19 treesize of output 1 [2025-03-15 01:24:12,029 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 31 treesize of output 15 [2025-03-15 01:24:12,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:12,097 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 20 treesize of output 15 [2025-03-15 01:24:12,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:12,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 17 [2025-03-15 01:24:12,398 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 31 treesize of output 15 [2025-03-15 01:24:12,667 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2025-03-15 01:24:12,667 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 1 case distinctions, treesize of input 35 treesize of output 19 [2025-03-15 01:24:12,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:12,768 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 34 treesize of output 22 [2025-03-15 01:24:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:12,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:24:14,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:14,619 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 2 case distinctions, treesize of input 76 treesize of output 66 [2025-03-15 01:24:14,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:14,626 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 104 treesize of output 106 [2025-03-15 01:24:14,630 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 38 treesize of output 34 [2025-03-15 01:24:14,640 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 9 treesize of output 5 [2025-03-15 01:24:14,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:14,648 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 51 treesize of output 51 [2025-03-15 01:24:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723931960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:24:15,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:24:15,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 23, 23] total 98 [2025-03-15 01:24:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209485876] [2025-03-15 01:24:15,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:24:15,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2025-03-15 01:24:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:15,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2025-03-15 01:24:15,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=8987, Unknown=21, NotChecked=0, Total=9702 [2025-03-15 01:24:15,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 357 [2025-03-15 01:24:15,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 881 transitions, 37967 flow. Second operand has 99 states, 99 states have (on average 178.3939393939394) internal successors, (17661), 99 states have internal predecessors, (17661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:15,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:15,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 357 [2025-03-15 01:24:15,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:26,369 INFO L124 PetriNetUnfolderBase]: 1055/3964 cut-off events. [2025-03-15 01:24:26,370 INFO L125 PetriNetUnfolderBase]: For 671332/681356 co-relation queries the response was YES. [2025-03-15 01:24:26,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56758 conditions, 3964 events. 1055/3964 cut-off events. For 671332/681356 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 24801 event pairs, 80 based on Foata normal form. 190/3772 useless extension candidates. Maximal degree in co-relation 44763. Up to 1563 conditions per place. [2025-03-15 01:24:26,420 INFO L140 encePairwiseOnDemand]: 294/357 looper letters, 590 selfloop transitions, 147 changer transitions 119/1032 dead transitions. [2025-03-15 01:24:26,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1114 places, 1032 transitions, 46958 flow [2025-03-15 01:24:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-15 01:24:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2025-03-15 01:24:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 21428 transitions. [2025-03-15 01:24:26,428 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49198695871791337 [2025-03-15 01:24:26,429 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 766 predicate places. [2025-03-15 01:24:26,429 INFO L471 AbstractCegarLoop]: Abstraction has has 1114 places, 1032 transitions, 46958 flow [2025-03-15 01:24:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 178.3939393939394) internal successors, (17661), 99 states have internal predecessors, (17661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:26,431 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:26,431 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:26,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 01:24:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:24:26,632 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:24:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -832569735, now seen corresponding path program 1 times [2025-03-15 01:24:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300448484] [2025-03-15 01:24:26,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300448484] [2025-03-15 01:24:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300448484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2025-03-15 01:24:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285967339] [2025-03-15 01:24:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:30,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-15 01:24:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:30,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-15 01:24:30,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2025-03-15 01:24:30,965 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 357 [2025-03-15 01:24:30,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1114 places, 1032 transitions, 46958 flow. Second operand has 37 states, 37 states have (on average 197.05405405405406) internal successors, (7291), 37 states have internal predecessors, (7291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:30,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:30,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 357 [2025-03-15 01:24:30,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:34,361 INFO L124 PetriNetUnfolderBase]: 988/3910 cut-off events. [2025-03-15 01:24:34,362 INFO L125 PetriNetUnfolderBase]: For 659280/667099 co-relation queries the response was YES. [2025-03-15 01:24:34,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56588 conditions, 3910 events. 988/3910 cut-off events. For 659280/667099 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 24482 event pairs, 72 based on Foata normal form. 107/3657 useless extension candidates. Maximal degree in co-relation 47150. Up to 1494 conditions per place. [2025-03-15 01:24:34,439 INFO L140 encePairwiseOnDemand]: 307/357 looper letters, 592 selfloop transitions, 63 changer transitions 113/1007 dead transitions. [2025-03-15 01:24:34,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1162 places, 1007 transitions, 46878 flow [2025-03-15 01:24:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-15 01:24:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-15 01:24:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 9690 transitions. [2025-03-15 01:24:34,445 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5539358600583091 [2025-03-15 01:24:34,446 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 814 predicate places. [2025-03-15 01:24:34,446 INFO L471 AbstractCegarLoop]: Abstraction has has 1162 places, 1007 transitions, 46878 flow [2025-03-15 01:24:34,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 197.05405405405406) internal successors, (7291), 37 states have internal predecessors, (7291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:34,447 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:34,447 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:34,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 01:24:34,447 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:24:34,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1785551293, now seen corresponding path program 1 times [2025-03-15 01:24:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:34,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061228544] [2025-03-15 01:24:34,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061228544] [2025-03-15 01:24:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061228544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:24:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821178095] [2025-03-15 01:24:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:24:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:38,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:24:38,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 01:24:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:38,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-15 01:24:38,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:24:39,362 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 19 treesize of output 1 [2025-03-15 01:24:39,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:39,616 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 41 treesize of output 28 [2025-03-15 01:24:39,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:39,688 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 28 treesize of output 21 [2025-03-15 01:24:39,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:39,996 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:39,997 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2025-03-15 01:24:40,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:40,115 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 39 treesize of output 26 [2025-03-15 01:24:40,471 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:40,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:40,493 INFO L349 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2025-03-15 01:24:40,493 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 55 treesize of output 54 [2025-03-15 01:24:40,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:40,784 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:40,786 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 38 [2025-03-15 01:24:41,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:41,145 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 51 treesize of output 32 [2025-03-15 01:24:41,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:41,239 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 38 treesize of output 29 [2025-03-15 01:24:41,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:41,622 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:41,622 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 32 [2025-03-15 01:24:41,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:41,738 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 49 treesize of output 30 [2025-03-15 01:24:42,046 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-15 01:24:42,046 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 52 [2025-03-15 01:24:42,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:42,068 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 39 treesize of output 15 [2025-03-15 01:24:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:42,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:24:44,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1320 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647)))) is different from false [2025-03-15 01:24:44,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1320 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) v_ArrVal_1320) .cse1) 2147483647)))) is different from false [2025-03-15 01:24:44,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1320 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647)))) is different from false [2025-03-15 01:24:45,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select .cse3 .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1312) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647) (= .cse2 20) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< 2147483647 v_ArrVal_1312) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1312)))))) is different from false [2025-03-15 01:24:45,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1310)))) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse2 .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1312) .cse5 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1312) (< 2147483647 v_ArrVal_1312) (= .cse4 20))))))) is different from false [2025-03-15 01:24:45,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1310)))) (let ((.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select .cse3 .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1312) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_1320) .cse1) 2147483647) (< 2147483647 v_ArrVal_1312) (= .cse2 20) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1312))))))) is different from false [2025-03-15 01:24:45,797 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1310)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse0 .cse3))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1312) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1312) (< (select (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< 2147483647 v_ArrVal_1312) (= .cse4 20))))))) is different from false [2025-03-15 01:24:46,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_1310)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse0 .cse3))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1312) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1312) (< 2147483647 v_ArrVal_1312) (< (select (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1320) .cse1) 2147483647) (= .cse4 20) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|))))))) is different from false [2025-03-15 01:24:46,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |c_t2Thread1of1ForFork1_dequeue_#t~post45#1|)) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1310)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1312) .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< 2147483647 v_ArrVal_1312) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1312) (= .cse4 20))))))) is different from false [2025-03-15 01:24:55,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse5 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|)) (.cse6 (+ 88 |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base| (store (store .cse5 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) (+ |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| 80) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1310)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1312) .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) (+ |c_~#queue~0.offset| 80) (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse2))) v_ArrVal_1320) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1312) (< 2147483647 v_ArrVal_1312) (= .cse4 20) (< (select .cse5 .cse6) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)))))))) is different from false [2025-03-15 01:24:55,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse3 .cse7) .cse8 v_ArrVal_1310))) (let ((.cse6 (select .cse5 .cse4))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 .cse7) .cse8 v_ArrVal_1310) .cse1 v_ArrVal_1312) .cse4 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|) (< (select (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* (select .cse2 .cse4) 4)) v_ArrVal_1320) .cse1) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1312) (< 2147483647 v_ArrVal_1312) (= 20 .cse6) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)))))))) is different from false [2025-03-15 01:24:56,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1307) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse6 (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse3 .cse7) .cse8 v_ArrVal_1310))) (let ((.cse5 (select .cse6 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse7) .cse8 v_ArrVal_1310) .cse1 v_ArrVal_1312) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< 2147483647 v_ArrVal_1312) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ (* 4 (select .cse0 .cse4)) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647) (= 20 .cse5) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1312)))))))) is different from false [2025-03-15 01:24:56,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse6 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1307) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse4))))) (let ((.cse0 (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse3 .cse8) .cse9 v_ArrVal_1310))) (let ((.cse5 (select .cse0 .cse4))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse6 .cse3 .cse8) .cse9 v_ArrVal_1310) .cse1 v_ArrVal_1312) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1312) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (select (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1320) .cse1) 2147483647) (< 2147483647 v_ArrVal_1312) (= 20 .cse5) (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|))))))))) is different from false [2025-03-15 01:24:56,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1307) |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse5))))) (let ((.cse6 (store (store (store .cse3 .cse2 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse4 .cse8) .cse9 v_ArrVal_1310))) (let ((.cse0 (select .cse6 .cse5))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 .cse8) .cse9 v_ArrVal_1310) .cse2 v_ArrVal_1312) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (= 20 .cse0) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|) (< (select .cse3 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|) (< (select (store (store (store .cse1 .cse2 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse5))) v_ArrVal_1320) .cse2) 2147483647) (< 2147483647 v_ArrVal_1312) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1312))))))))) is different from false [2025-03-15 01:24:56,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse6 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1307) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse4 (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse2 .cse8) .cse9 v_ArrVal_1310))) (let ((.cse5 (select .cse4 .cse3))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse6 .cse2 .cse8) .cse9 v_ArrVal_1310) .cse1 v_ArrVal_1312) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_1320) .cse1) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1312) (= .cse5 20) (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|) (< 2147483647 v_ArrVal_1312) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|))))))))) is different from false [2025-03-15 01:24:56,532 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1307 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse6 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1307) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse4 (store (store (store .cse6 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse2 .cse8) .cse9 v_ArrVal_1310))) (let ((.cse5 (select .cse4 .cse3))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse6 .cse2 .cse8) .cse9 v_ArrVal_1310) .cse1 v_ArrVal_1312) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_1320) .cse1) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1312) (= .cse5 20) (< (select .cse6 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|) (< 2147483647 v_ArrVal_1312) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2025-03-15 01:24:56,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse12))) (or (= .cse0 20) (forall ((v_ArrVal_1307 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1320 Int) (v_ArrVal_1312 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse0 1))))) (let ((.cse7 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1307) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse10 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store .cse7 .cse2 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|)) .cse3 .cse9) .cse10 v_ArrVal_1310))) (let ((.cse6 (select .cse5 .cse4))) (let ((.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse7 .cse3 .cse9) .cse10 v_ArrVal_1310) .cse2 v_ArrVal_1312) .cse4 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1316) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse1 .cse2 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)) .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_29| 1)) (+ |c_~#queue~0.offset| (* (select .cse1 .cse4) 4)) v_ArrVal_1320) .cse2) 2147483647) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1312) (= .cse6 20) (< (select .cse7 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_36|) (< 2147483647 v_ArrVal_1312) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_32|)))))))))))) is different from false [2025-03-15 01:24:56,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:56,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 868 treesize of output 424 [2025-03-15 01:24:56,804 INFO L349 Elim1Store]: treesize reduction 69, result has 55.2 percent of original size [2025-03-15 01:24:56,804 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 653 treesize of output 513 [2025-03-15 01:24:56,818 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2025-03-15 01:24:56,829 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2025-03-15 01:24:56,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:56,872 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 468 treesize of output 434 [2025-03-15 01:24:56,889 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 42 treesize of output 30 [2025-03-15 01:24:56,908 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 106 treesize of output 82 [2025-03-15 01:24:56,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:56,953 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 17 treesize of output 9 [2025-03-15 01:24:57,394 INFO L349 Elim1Store]: treesize reduction 672, result has 19.3 percent of original size [2025-03-15 01:24:57,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 312 treesize of output 354 [2025-03-15 01:24:57,417 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:57,419 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 241 [2025-03-15 01:24:57,918 INFO L349 Elim1Store]: treesize reduction 30, result has 72.0 percent of original size [2025-03-15 01:24:57,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 18427 treesize of output 12223 [2025-03-15 01:24:58,432 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:58,437 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-15 01:24:58,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 99 treesize of output 1 [2025-03-15 01:24:58,451 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:24:58,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 127 treesize of output 113 [2025-03-15 01:24:58,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:58,473 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 17 treesize of output 9 [2025-03-15 01:24:58,574 INFO L349 Elim1Store]: treesize reduction 134, result has 39.4 percent of original size [2025-03-15 01:24:58,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 111 [2025-03-15 01:24:58,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:24:58,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 122 [2025-03-15 01:25:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2025-03-15 01:25:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821178095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:02,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 45] total 125 [2025-03-15 01:25:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278487121] [2025-03-15 01:25:02,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:02,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2025-03-15 01:25:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:02,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2025-03-15 01:25:02,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=795, Invalid=10956, Unknown=89, NotChecked=3910, Total=15750 [2025-03-15 01:25:02,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 357 [2025-03-15 01:25:02,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1162 places, 1007 transitions, 46878 flow. Second operand has 126 states, 126 states have (on average 176.83333333333334) internal successors, (22281), 126 states have internal predecessors, (22281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:02,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:02,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 357 [2025-03-15 01:25:02,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:26,851 INFO L124 PetriNetUnfolderBase]: 1251/5263 cut-off events. [2025-03-15 01:25:26,851 INFO L125 PetriNetUnfolderBase]: For 882597/894039 co-relation queries the response was YES. [2025-03-15 01:25:26,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76481 conditions, 5263 events. 1251/5263 cut-off events. For 882597/894039 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 30767 event pairs, 116 based on Foata normal form. 152/4937 useless extension candidates. Maximal degree in co-relation 66566. Up to 1987 conditions per place. [2025-03-15 01:25:26,932 INFO L140 encePairwiseOnDemand]: 293/357 looper letters, 683 selfloop transitions, 211 changer transitions 137/1222 dead transitions. [2025-03-15 01:25:26,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1270 places, 1222 transitions, 60493 flow [2025-03-15 01:25:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-15 01:25:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2025-03-15 01:25:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 21413 transitions. [2025-03-15 01:25:26,940 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49164255866280937 [2025-03-15 01:25:26,941 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 922 predicate places. [2025-03-15 01:25:26,941 INFO L471 AbstractCegarLoop]: Abstraction has has 1270 places, 1222 transitions, 60493 flow [2025-03-15 01:25:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 176.83333333333334) internal successors, (22281), 126 states have internal predecessors, (22281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:26,943 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:26,944 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:26,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 01:25:27,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:27,144 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:25:27,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1519524212, now seen corresponding path program 2 times [2025-03-15 01:25:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71724134] [2025-03-15 01:25:27,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:27,182 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:27,182 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-15 01:25:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71724134] [2025-03-15 01:25:29,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71724134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698244852] [2025-03-15 01:25:29,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:29,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:29,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:29,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 01:25:29,636 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:29,637 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:29,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-15 01:25:29,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:30,437 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 19 treesize of output 1 [2025-03-15 01:25:30,539 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 31 treesize of output 15 [2025-03-15 01:25:30,862 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-03-15 01:25:30,863 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 1 case distinctions, treesize of input 35 treesize of output 25 [2025-03-15 01:25:31,083 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:25:31,100 INFO L349 Elim1Store]: treesize reduction 22, result has 52.2 percent of original size [2025-03-15 01:25:31,100 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2025-03-15 01:25:31,229 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 31 treesize of output 15 [2025-03-15 01:25:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:25:31,294 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 20 treesize of output 15 [2025-03-15 01:25:31,426 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 21 treesize of output 9 [2025-03-15 01:25:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-15 01:25:31,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:31,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int))) (< 0 (+ 2147483648 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|))))) is different from false [2025-03-15 01:25:31,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1473 Int) (v_ArrVal_1475 Int) (v_ArrVal_1477 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1473) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1475)) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483648)) (< v_ArrVal_1473 (+ (select .cse0 .cse1) 1))))) is different from false [2025-03-15 01:25:43,781 INFO L349 Elim1Store]: treesize reduction 220, result has 42.7 percent of original size [2025-03-15 01:25:43,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 210 [2025-03-15 01:25:43,795 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:25:43,796 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 191 treesize of output 175 [2025-03-15 01:25:43,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:43,807 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 87 treesize of output 89 [2025-03-15 01:25:43,820 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 32 treesize of output 28 [2025-03-15 01:25:43,835 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 23 treesize of output 15 [2025-03-15 01:25:43,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:43,873 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 118 treesize of output 124 [2025-03-15 01:25:44,025 INFO L349 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2025-03-15 01:25:44,026 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 139 treesize of output 121 [2025-03-15 01:25:44,108 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 9 treesize of output 5 [2025-03-15 01:25:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-15 01:25:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698244852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:58,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 23] total 70 [2025-03-15 01:25:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881838252] [2025-03-15 01:25:58,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:58,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-15 01:25:58,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:58,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-15 01:25:58,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=4277, Unknown=41, NotChecked=270, Total=4970 [2025-03-15 01:25:58,765 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 357 [2025-03-15 01:25:58,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1270 places, 1222 transitions, 60493 flow. Second operand has 71 states, 71 states have (on average 200.1267605633803) internal successors, (14209), 71 states have internal predecessors, (14209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:58,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:58,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 357 [2025-03-15 01:25:58,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:07,053 INFO L124 PetriNetUnfolderBase]: 1242/4772 cut-off events. [2025-03-15 01:26:07,053 INFO L125 PetriNetUnfolderBase]: For 927605/940123 co-relation queries the response was YES. [2025-03-15 01:26:07,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74961 conditions, 4772 events. 1242/4772 cut-off events. For 927605/940123 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27091 event pairs, 103 based on Foata normal form. 195/4489 useless extension candidates. Maximal degree in co-relation 61617. Up to 1894 conditions per place. [2025-03-15 01:26:07,118 INFO L140 encePairwiseOnDemand]: 323/357 looper letters, 716 selfloop transitions, 134 changer transitions 139/1220 dead transitions. [2025-03-15 01:26:07,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1306 places, 1220 transitions, 62541 flow [2025-03-15 01:26:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 01:26:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 01:26:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 7529 transitions. [2025-03-15 01:26:07,121 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5549904172195194 [2025-03-15 01:26:07,121 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 958 predicate places. [2025-03-15 01:26:07,121 INFO L471 AbstractCegarLoop]: Abstraction has has 1306 places, 1220 transitions, 62541 flow [2025-03-15 01:26:07,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 200.1267605633803) internal successors, (14209), 71 states have internal predecessors, (14209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:07,123 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:07,124 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:07,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 01:26:07,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-15 01:26:07,324 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:26:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2032224709, now seen corresponding path program 2 times [2025-03-15 01:26:07,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:07,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809186438] [2025-03-15 01:26:07,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:07,382 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:07,382 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:09,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:09,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809186438] [2025-03-15 01:26:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809186438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935455249] [2025-03-15 01:26:09,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:09,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:09,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:09,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:26:09,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:26:10,360 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:10,360 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:10,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-15 01:26:10,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:11,698 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 [2025-03-15 01:26:12,112 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-15 01:26:12,113 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 37 treesize of output 46 [2025-03-15 01:26:12,223 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 33 treesize of output 24 [2025-03-15 01:26:12,481 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 17 [2025-03-15 01:26:12,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:12,537 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 [2025-03-15 01:26:12,691 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 [2025-03-15 01:26:12,714 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 [2025-03-15 01:26:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:12,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:14,047 INFO L349 Elim1Store]: treesize reduction 277, result has 43.6 percent of original size [2025-03-15 01:26:14,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 233 treesize of output 367 [2025-03-15 01:26:14,060 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:14,061 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2025-03-15 01:26:14,099 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:26:14,099 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 309 treesize of output 293 [2025-03-15 01:26:14,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:14,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 140 treesize of output 185 [2025-03-15 01:26:14,195 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 74 treesize of output 66 [2025-03-15 01:26:14,543 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 [2025-03-15 01:26:14,883 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 28 treesize of output 20 [2025-03-15 01:26:14,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:14,955 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 108 treesize of output 102 [2025-03-15 01:26:15,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:15,403 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 268 treesize of output 264 [2025-03-15 01:26:15,438 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2025-03-15 01:26:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935455249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:16,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:16,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 20] total 64 [2025-03-15 01:26:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865904537] [2025-03-15 01:26:16,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:16,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-15 01:26:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:16,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-15 01:26:16,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=3681, Unknown=41, NotChecked=0, Total=4160 [2025-03-15 01:26:16,237 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 357 [2025-03-15 01:26:16,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1306 places, 1220 transitions, 62541 flow. Second operand has 65 states, 65 states have (on average 200.87692307692308) internal successors, (13057), 65 states have internal predecessors, (13057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:16,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:16,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 357 [2025-03-15 01:26:16,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:22,156 INFO L124 PetriNetUnfolderBase]: 1252/5063 cut-off events. [2025-03-15 01:26:22,156 INFO L125 PetriNetUnfolderBase]: For 977829/989492 co-relation queries the response was YES. [2025-03-15 01:26:22,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79883 conditions, 5063 events. 1252/5063 cut-off events. For 977829/989492 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 29235 event pairs, 105 based on Foata normal form. 190/4798 useless extension candidates. Maximal degree in co-relation 69345. Up to 1957 conditions per place. [2025-03-15 01:26:22,246 INFO L140 encePairwiseOnDemand]: 310/357 looper letters, 684 selfloop transitions, 156 changer transitions 139/1233 dead transitions. [2025-03-15 01:26:22,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1338 places, 1233 transitions, 65503 flow [2025-03-15 01:26:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-15 01:26:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-15 01:26:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6716 transitions. [2025-03-15 01:26:22,249 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5533036744109409 [2025-03-15 01:26:22,249 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 990 predicate places. [2025-03-15 01:26:22,249 INFO L471 AbstractCegarLoop]: Abstraction has has 1338 places, 1233 transitions, 65503 flow [2025-03-15 01:26:22,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 200.87692307692308) internal successors, (13057), 65 states have internal predecessors, (13057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:22,251 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:22,251 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:22,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 01:26:22,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:22,452 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:26:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -85357489, now seen corresponding path program 1 times [2025-03-15 01:26:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973066505] [2025-03-15 01:26:22,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973066505] [2025-03-15 01:26:28,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973066505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130865468] [2025-03-15 01:26:28,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:28,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:26:28,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 01:26:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:29,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-15 01:26:29,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:29,416 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 13 treesize of output 9 [2025-03-15 01:26:29,460 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 [2025-03-15 01:26:29,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:29,501 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 25 [2025-03-15 01:26:29,886 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:26:29,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:29,900 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-15 01:26:29,900 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:26:29,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:29,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:29,964 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 [2025-03-15 01:26:30,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:30,192 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 [2025-03-15 01:26:30,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:30,281 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 [2025-03-15 01:26:30,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:26:30,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:30,643 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-15 01:26:30,643 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:26:30,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:30,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:30,694 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 [2025-03-15 01:26:30,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:30,866 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 [2025-03-15 01:26:30,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:30,966 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 [2025-03-15 01:26:31,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:31,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:31,235 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 [2025-03-15 01:26:31,438 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 [2025-03-15 01:26:31,804 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:26:31,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:31,818 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-15 01:26:31,819 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:26:31,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:31,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:31,880 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 [2025-03-15 01:26:32,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:32,108 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 40 treesize of output 27 [2025-03-15 01:26:32,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:32,188 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 [2025-03-15 01:26:32,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:32,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:32,449 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 [2025-03-15 01:26:32,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:32,632 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 [2025-03-15 01:26:32,966 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:26:32,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:32,980 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-15 01:26:32,980 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 [2025-03-15 01:26:33,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:33,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:33,028 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 [2025-03-15 01:26:33,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:26:33,159 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 [2025-03-15 01:26:33,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:26:33,229 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 [2025-03-15 01:26:33,386 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 [2025-03-15 01:26:33,401 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 [2025-03-15 01:26:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:33,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:33,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 2147483647)) is different from false [2025-03-15 01:26:51,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1822 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4)))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= 20 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse6))))))) is different from false [2025-03-15 01:26:51,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1822 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse6)))) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (= 20 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse6)) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|)))))) is different from false [2025-03-15 01:26:51,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1822 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= 20 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse6))))))) is different from false [2025-03-15 01:26:51,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1822 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse9 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= 20 (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse6))))))) (= .cse9 20)))) is different from false [2025-03-15 01:26:51,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1811) .cse8 (+ .cse9 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse6) 4)))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (= (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse3) .cse4 v_ArrVal_1819) .cse6) 20)))))) (= .cse9 20)))) is different from false [2025-03-15 01:26:51,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1810)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse9))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1811) .cse9 (+ .cse0 1))))) (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse7))))) (or (= 20 .cse0) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse4) .cse5 v_ArrVal_1819) .cse6 v_ArrVal_1821) .cse7 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (= (select (store (store (store .cse1 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse4) .cse5 v_ArrVal_1819) .cse7) 20)))))))) is different from false [2025-03-15 01:26:51,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1810))) (let ((.cse6 (select .cse8 .cse9))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1811) .cse9 (+ .cse6 1))))) (let ((.cse0 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4))) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (= 20 (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5)) (= 20 .cse6) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|)))))))) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))) is different from false [2025-03-15 01:26:51,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1810)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse10 .cse9))) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1811) .cse9 (+ .cse0 1))))) (let ((.cse2 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse7))))) (or (= 20 .cse0) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_ArrVal_1819) .cse6 v_ArrVal_1821) .cse7 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= 20 (select (store (store (store .cse2 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_ArrVal_1819) .cse7)) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))))) is different from false [2025-03-15 01:26:51,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1810)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse8 .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1811) .cse5 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse5)))) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5) 20) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= .cse7 20) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647)))))))) is different from false [2025-03-15 01:26:52,606 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1810)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse9 .cse1))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1811) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse6 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4))) (.cse4 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (= 20 (select (store (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 v_ArrVal_1819) .cse1)) (= .cse7 20) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 .cse5) .cse6 v_ArrVal_1819) .cse3 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse4) 2147483647) (< (select .cse2 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|))))))))) is different from false [2025-03-15 01:26:52,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int)) (or (< |c_t2Thread1of1ForFork1_dequeue_#t~mem47#1| |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1))))) (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1810)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse9 .cse6))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1811) .cse6 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (= .cse7 20) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (= (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse3) .cse4 v_ArrVal_1819) .cse6) 20))))))))))) is different from false [2025-03-15 01:26:52,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse9 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (let ((.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse8 .cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1))))) (let ((.cse10 (select .cse2 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1810)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse11 .cse6))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1811) .cse6 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (= .cse7 20) (< (select .cse8 .cse9) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse10 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (= (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse3) .cse4 v_ArrVal_1819) .cse6) 20)))))))))) is different from false [2025-03-15 01:26:52,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse9 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (let ((.cse7 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse8 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1))))) (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1810)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse11 .cse5))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse11 .cse1 v_ArrVal_1811) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5) 20) (= .cse6 20) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse8 .cse9) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse10 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))))) is different from false [2025-03-15 01:26:53,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|)) (.cse8 (+ |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| 80))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1))))) (let ((.cse10 (select .cse0 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1810)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse11 .cse6))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1811) .cse6 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse7 .cse8) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (= .cse9 20) (= 20 (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse6)) (< (select .cse10 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))))) is different from false [2025-03-15 01:26:53,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse6 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 v_ArrVal_1810) .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse6 .cse2 .cse8) .cse9 v_ArrVal_1810) .cse1 v_ArrVal_1811) .cse5 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (or (= 20 (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5)) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse6 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (= 20 .cse7))))))) is different from false [2025-03-15 01:26:53,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse8) .cse9 v_ArrVal_1810) .cse1))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 .cse8) .cse9 v_ArrVal_1810) .cse6 v_ArrVal_1811) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse5 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_ArrVal_1819) .cse6 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse3) 2147483647) (= 20 (select (store (store (store .cse2 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse3 .cse4) .cse5 v_ArrVal_1819) .cse1)) (= .cse7 20))))))) is different from false [2025-03-15 01:26:53,960 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1805)))) (let ((.cse7 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse7 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse9) .cse10 v_ArrVal_1810) .cse5))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse7 .cse2 .cse9) .cse10 v_ArrVal_1810) .cse1 v_ArrVal_1811) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* 4 (select .cse0 .cse5)) |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5) 20) (= .cse6 20) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1805) (< (select .cse7 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))) is different from false [2025-03-15 01:26:54,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1805)))) (let ((.cse7 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse7 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse9) .cse10 v_ArrVal_1810) .cse5))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse7 .cse2 .cse9) .cse10 v_ArrVal_1810) .cse1 v_ArrVal_1811) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* 4 (select .cse0 .cse5)) |c_~#queue~0.offset|))) (or (= (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5) 20) (= .cse6 20) (< (select .cse7 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1805) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))) is different from false [2025-03-15 01:26:54,102 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1805)))) (let ((.cse9 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store (store .cse9 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse11) .cse12 v_ArrVal_1810) .cse7))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store (store (store .cse9 .cse4 .cse11) .cse12 v_ArrVal_1810) .cse3 v_ArrVal_1811) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse6 (+ (* 4 (select .cse2 .cse7)) |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1805) (= (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse4 .cse5) .cse6 v_ArrVal_1819) .cse7) 20) (= .cse8 20) (< (select .cse9 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 .cse5) .cse6 v_ArrVal_1819) .cse3 v_ArrVal_1821) .cse7 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse4) 2147483647) (< (select .cse2 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse9 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))))) is different from false [2025-03-15 01:26:54,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1802) .cse3 v_ArrVal_1805)))) (let ((.cse4 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse9 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store (store .cse4 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 v_ArrVal_1810) .cse9))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store (store (store .cse4 .cse1 .cse11) .cse12 v_ArrVal_1810) .cse6 v_ArrVal_1811) .cse9 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse7 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse8 (+ (* (select .cse0 .cse9) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1805) (< (select .cse4 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (= .cse5 20) (= (select (store (store (store .cse0 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse1 .cse7) .cse8 v_ArrVal_1819) .cse9) 20) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse7) .cse8 v_ArrVal_1819) .cse6 v_ArrVal_1821) .cse9 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse4 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))))) is different from false [2025-03-15 01:26:54,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1800)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1802) .cse5 v_ArrVal_1805)))) (let ((.cse0 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store (store .cse0 .cse10 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse11) .cse12 v_ArrVal_1810) .cse6))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse11) .cse12 v_ArrVal_1810) .cse10 v_ArrVal_1811) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse8 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse9 (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= .cse3 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1805) (< (select .cse0 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse2 .cse1 .cse8) .cse9 v_ArrVal_1819) .cse10 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (= (select (store (store (store .cse2 .cse10 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse1 .cse8) .cse9 v_ArrVal_1819) .cse6) 20))))))))) is different from false [2025-03-15 01:26:54,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1800))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1802) .cse1 v_ArrVal_1805)))) (let ((.cse4 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse12 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (select (store (store (store .cse4 .cse10 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse12) .cse13 v_ArrVal_1810) .cse6))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse4 .cse3 .cse12) .cse13 v_ArrVal_1810) .cse10 v_ArrVal_1811) .cse6 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse8 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse9 (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse4 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1805) (< (select .cse4 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse8) .cse9 v_ArrVal_1819) .cse10 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse3) 2147483647) (= (select (store (store (store .cse2 .cse10 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse3 .cse8) .cse9 v_ArrVal_1819) .cse6) 20) (= 20 .cse11)))))))))))) is different from false [2025-03-15 01:26:54,721 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse11 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1800)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1802) .cse10 v_ArrVal_1805)))) (let ((.cse0 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse12 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse0 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse12) .cse13 v_ArrVal_1810) .cse2))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse12) .cse13 v_ArrVal_1810) .cse4 v_ArrVal_1811) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse6 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (= 20 (select (store (store (store .cse3 .cse4 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse1 .cse5) .cse6 v_ArrVal_1819) .cse2)) (< (select .cse3 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= .cse7 20) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse3 .cse1 .cse5) .cse6 v_ArrVal_1819) .cse4 v_ArrVal_1821) .cse2 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse11 .cse10) 1) v_ArrVal_1805)))))))))) is different from false [2025-03-15 01:26:54,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1802) .cse5 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store (store .cse7 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse10) .cse11 v_ArrVal_1810) .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse7 .cse2 .cse10) .cse11 v_ArrVal_1810) .cse1 v_ArrVal_1811) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (or (= 20 (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5)) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1805) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select .cse7 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (= .cse9 20))))))))) is different from false [2025-03-15 01:26:56,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (v_ArrVal_1819 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1802) .cse5 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store (store .cse7 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse10) .cse11 v_ArrVal_1810) .cse5))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse7 .cse2 .cse10) .cse11 v_ArrVal_1810) .cse1 v_ArrVal_1811) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (or (= 20 (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse3) .cse4 v_ArrVal_1819) .cse5)) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1805) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select .cse7 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_1819) .cse1 v_ArrVal_1821) .cse5 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (= .cse9 20))))))))) is different from false [2025-03-15 01:26:56,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_1802) .cse3 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse10 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse10) .cse11 v_ArrVal_1810) .cse3))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse10) .cse11 v_ArrVal_1810) .cse5 v_ArrVal_1811) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse7 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (= (select (store (store (store .cse4 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse1 .cse6) .cse7 v_ArrVal_1819) .cse3) 20) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1805) (= .cse9 20) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse4 .cse1 .cse6) .cse7 v_ArrVal_1819) .cse5 v_ArrVal_1821) .cse3 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse4 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|))))))))) is different from false [2025-03-15 01:26:56,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_1802) .cse1 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse10 (select (store (store (store .cse8 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse11) .cse12 v_ArrVal_1810) .cse1))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse8 .cse4 .cse11) .cse12 v_ArrVal_1810) .cse7 v_ArrVal_1811) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse6 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1805) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_ArrVal_1819) .cse7 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse4) 2147483647) (= (select (store (store (store .cse3 .cse7 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse4 .cse5) .cse6 v_ArrVal_1819) .cse1) 20) (< (select .cse8 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (= 20 .cse10)))))))))) is different from false [2025-03-15 01:26:56,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int)) (or (< |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))))) (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_1802) .cse1 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse11 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse11) .cse12 v_ArrVal_1810) .cse1))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse11) .cse12 v_ArrVal_1810) .cse6 v_ArrVal_1811) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse7 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse8 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1805) (= .cse4 20) (= 20 (select (store (store (store .cse5 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse2 .cse7) .cse8 v_ArrVal_1819) .cse1)) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse5 .cse2 .cse7) .cse8 v_ArrVal_1819) .cse6 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse5 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|)))))))))))) is different from false [2025-03-15 01:26:56,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))))) (let ((.cse12 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse5 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_1802) .cse1 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse13 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store (store .cse0 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse13) .cse14 v_ArrVal_1810) .cse1))) (let ((.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse0 .cse4 .cse13) .cse14 v_ArrVal_1810) .cse8 v_ArrVal_1811) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse10 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse0 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1805) (= .cse6 20) (= 20 (select (store (store (store .cse7 .cse8 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse4 .cse9) .cse10 v_ArrVal_1819) .cse1)) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse7 .cse4 .cse9) .cse10 v_ArrVal_1819) .cse8 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse4) 2147483647) (< (select .cse7 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|))))))))))) is different from false [2025-03-15 01:26:57,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))))) (let ((.cse12 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse7 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1802) .cse6 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse13 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse5 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse13) .cse14 v_ArrVal_1810) .cse6))) (let ((.cse3 (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse5 .cse4 .cse13) .cse14 v_ArrVal_1810) .cse8 v_ArrVal_1811) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse10 (+ (* 4 (select .cse3 .cse6)) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (= 20 .cse2) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse7 .cse6) 1) v_ArrVal_1805) (= (select (store (store (store .cse3 .cse8 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse4 .cse9) .cse10 v_ArrVal_1819) .cse6) 20) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 .cse9) .cse10 v_ArrVal_1819) .cse8 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse4) 2147483647) (< (select .cse12 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select .cse5 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|))))))))))) is different from false [2025-03-15 01:26:57,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))))) (let ((.cse8 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_1802) .cse6 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse13 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store (store .cse4 .cse9 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse13) .cse14 v_ArrVal_1810) .cse6))) (let ((.cse2 (select (store (store .cse12 |c_~#queue~0.base| (store (store (store (store .cse4 .cse3 .cse13) .cse14 v_ArrVal_1810) .cse9 v_ArrVal_1811) .cse6 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse10 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse11 (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse4 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1805) (= 20 .cse7) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (= (select (store (store (store .cse2 .cse9 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse3 .cse10) .cse11 v_ArrVal_1819) .cse6) 20) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 .cse10) .cse11 v_ArrVal_1819) .cse9 v_ArrVal_1821) .cse6 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse3) 2147483647) (< (select .cse4 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|))))))))))) is different from false [2025-03-15 01:26:57,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|) (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))))) (let ((.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse13 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse13 .cse11 v_ArrVal_1802) .cse3 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| 80)) (.cse14 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse12 (select (store (store (store .cse2 .cse11 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 .cse14) .cse15 v_ArrVal_1810) .cse3))) (let ((.cse7 (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse2 .cse8 .cse14) .cse15 v_ArrVal_1810) .cse11 v_ArrVal_1811) .cse3 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse10 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse7 .cse8 .cse9) .cse10 v_ArrVal_1819) .cse11 v_ArrVal_1821) .cse3 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse8) 2147483647) (= (select (store (store (store .cse7 .cse11 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse8 .cse9) .cse10 v_ArrVal_1819) .cse3) 20) (< (select .cse7 .cse8) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= .cse12 20) (< (+ (select .cse13 .cse3) 1) v_ArrVal_1805) (< (select .cse2 .cse8) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|)))))))))))))) is different from false [2025-03-15 01:26:58,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse12 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))))) (let ((.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse11 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse11 .cse10 v_ArrVal_1802) .cse4 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse14 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse13 (select (store (store (store .cse0 .cse10 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse14) .cse15 v_ArrVal_1810) .cse4))) (let ((.cse7 (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse14) .cse15 v_ArrVal_1810) .cse10 v_ArrVal_1811) .cse4 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse8 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse9 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse7 .cse1 .cse8) .cse9 v_ArrVal_1819) .cse10 v_ArrVal_1821) .cse4 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (< (+ (select .cse11 .cse4) 1) v_ArrVal_1805) (= (select (store (store (store .cse7 .cse10 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse1 .cse8) .cse9 v_ArrVal_1819) .cse4) 20) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|) (< (select .cse7 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= .cse13 20)))))))))))) is different from false [2025-03-15 01:26:58,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1802) .cse1 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse12 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store (store .cse10 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse12) .cse13 v_ArrVal_1810) .cse1))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse10 .cse5 .cse12) .cse13 v_ArrVal_1810) .cse4 v_ArrVal_1811) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse7 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1805) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (= 20 (select (store (store (store .cse3 .cse4 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse5 .cse6) .cse7 v_ArrVal_1819) .cse1)) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse3 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= .cse9 20) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse3 .cse5 .cse6) .cse7 v_ArrVal_1819) .cse4 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse5) 2147483647) (< (select .cse10 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|))))))))))) is different from false [2025-03-15 01:27:01,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_1794 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1794)))) (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse11 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse12 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_1802) .cse8 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse13 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse3 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse13) .cse14 v_ArrVal_1810) .cse8))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse3 .cse1 .cse13) .cse14 v_ArrVal_1810) .cse7 v_ArrVal_1811) .cse8 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse5 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse6 (+ (* (select .cse0 .cse8) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (= 20 .cse2) (< (select .cse3 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 .cse5) .cse6 v_ArrVal_1819) .cse7 v_ArrVal_1821) .cse8 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse9 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select .cse10 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|) (< (select .cse11 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse3 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse12 .cse8) 1) v_ArrVal_1805) (= (select (store (store (store .cse0 .cse7 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse1 .cse5) .cse6 v_ArrVal_1819) .cse8) 20)))))))))))) is different from false [2025-03-15 01:27:01,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1805 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1819 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1792 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_1794 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (v_ArrVal_1800 Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1811 Int) (v_ArrVal_1822 Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 84) v_ArrVal_1792) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1794)))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1799) |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1800))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse12 .cse11 v_ArrVal_1802) .cse1 v_ArrVal_1805)) |c_~#stored_elements~0.base| v_ArrVal_1806) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse13 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56| 1)) (.cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse3 .cse11 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse13) .cse14 v_ArrVal_1810) .cse1))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse3 .cse5 .cse13) .cse14 v_ArrVal_1810) .cse11 v_ArrVal_1811) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_~#queue~0.base|))) (let ((.cse9 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53| 1)) (.cse10 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (= 20 .cse2) (< 0 v_ArrVal_1792) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115|) (< (select .cse3 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_56|) (< (select .cse6 .cse5) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_53|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse6 .cse5 .cse9) .cse10 v_ArrVal_1819) .cse11 v_ArrVal_1821) .cse1 v_ArrVal_1822)) |c_~#stored_elements~0.base| v_ArrVal_1824) |c_~#queue~0.base|) .cse5) 2147483647) (= (select (store (store (store .cse6 .cse11 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_71|)) .cse5 .cse9) .cse10 v_ArrVal_1819) .cse1) 20) (< (+ (select .cse12 .cse1) 1) v_ArrVal_1805)))))))))))) is different from false [2025-03-15 01:27:01,613 INFO L349 Elim1Store]: treesize reduction 410, result has 38.6 percent of original size [2025-03-15 01:27:01,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 2626 treesize of output 1495 [2025-03-15 01:27:01,643 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:01,647 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1156 [2025-03-15 01:27:01,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:01,675 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 1627 treesize of output 1613 [2025-03-15 01:27:01,700 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 7 treesize of output 3 [2025-03-15 01:27:01,725 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 51 treesize of output 39 [2025-03-15 01:27:01,758 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 42 treesize of output 34 [2025-03-15 01:27:01,782 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 46 treesize of output 30 [2025-03-15 01:27:02,001 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 39 treesize of output 31 [2025-03-15 01:27:02,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-15 01:27:02,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:02,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 191 [2025-03-15 01:27:02,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:02,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 335 treesize of output 335 [2025-03-15 01:27:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 66 not checked. [2025-03-15 01:27:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130865468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:06,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:06,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 48, 63] total 158 [2025-03-15 01:27:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690612743] [2025-03-15 01:27:06,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:06,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2025-03-15 01:27:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2025-03-15 01:27:06,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1730, Invalid=13052, Unknown=128, NotChecked=10212, Total=25122 [2025-03-15 01:27:06,139 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 357 [2025-03-15 01:27:06,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1338 places, 1233 transitions, 65503 flow. Second operand has 159 states, 159 states have (on average 188.03773584905662) internal successors, (29898), 159 states have internal predecessors, (29898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:06,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:06,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 357 [2025-03-15 01:27:06,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:31,099 INFO L124 PetriNetUnfolderBase]: 1494/5891 cut-off events. [2025-03-15 01:27:31,099 INFO L125 PetriNetUnfolderBase]: For 1242018/1257591 co-relation queries the response was YES. [2025-03-15 01:27:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95693 conditions, 5891 events. 1494/5891 cut-off events. For 1242018/1257591 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 35317 event pairs, 149 based on Foata normal form. 137/5472 useless extension candidates. Maximal degree in co-relation 84673. Up to 2297 conditions per place. [2025-03-15 01:27:31,179 INFO L140 encePairwiseOnDemand]: 296/357 looper letters, 853 selfloop transitions, 128 changer transitions 196/1423 dead transitions. [2025-03-15 01:27:31,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1431 places, 1423 transitions, 79742 flow [2025-03-15 01:27:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-15 01:27:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2025-03-15 01:27:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 17712 transitions. [2025-03-15 01:27:31,188 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5278026104058645 [2025-03-15 01:27:31,189 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 1083 predicate places. [2025-03-15 01:27:31,189 INFO L471 AbstractCegarLoop]: Abstraction has has 1431 places, 1423 transitions, 79742 flow [2025-03-15 01:27:31,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 159 states, 159 states have (on average 188.03773584905662) internal successors, (29898), 159 states have internal predecessors, (29898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:31,193 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:31,193 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:31,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:27:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:31,394 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:27:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -189731982, now seen corresponding path program 1 times [2025-03-15 01:27:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136228837] [2025-03-15 01:27:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:38,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136228837] [2025-03-15 01:27:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136228837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817877624] [2025-03-15 01:27:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:38,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:27:38,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 01:27:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:38,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-15 01:27:38,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:39,017 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 13 treesize of output 9 [2025-03-15 01:27:39,056 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 22 [2025-03-15 01:27:39,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:39,104 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 25 [2025-03-15 01:27:39,603 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:27:39,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:39,621 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-15 01:27:39,622 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:27:39,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:39,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:39,683 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 [2025-03-15 01:27:39,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:39,877 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 [2025-03-15 01:27:39,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:39,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 27 treesize of output 20 [2025-03-15 01:27:40,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:27:40,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:40,348 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-15 01:27:40,348 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:27:40,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:40,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:40,412 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 [2025-03-15 01:27:40,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:40,658 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 [2025-03-15 01:27:40,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:40,761 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 [2025-03-15 01:27:41,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:41,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:41,053 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 [2025-03-15 01:27:41,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:41,269 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 [2025-03-15 01:27:41,692 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:27:41,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:41,707 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-15 01:27:41,707 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 [2025-03-15 01:27:41,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:41,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:41,769 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 [2025-03-15 01:27:41,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:41,945 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 [2025-03-15 01:27:42,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:42,049 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 [2025-03-15 01:27:42,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:42,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:42,365 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 [2025-03-15 01:27:42,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:42,633 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 [2025-03-15 01:27:43,079 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:27:43,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:43,096 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-15 01:27:43,096 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:27:43,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:43,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:43,163 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 [2025-03-15 01:27:43,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:43,388 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 [2025-03-15 01:27:43,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:43,508 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 [2025-03-15 01:27:43,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:43,743 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 25 [2025-03-15 01:27:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 49 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:43,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:43,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (not (= 20 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80))))) is different from false [2025-03-15 01:27:44,038 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2025-03-15 01:28:01,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2018) .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (or (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2)) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) is different from false [2025-03-15 01:28:01,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2017)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2018) .cse8 (+ 1 (select .cse7 .cse8))))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3)) 20)))))) is different from false [2025-03-15 01:28:01,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2017)))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2018) .cse8 (+ (select .cse7 .cse8) 1))))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3)) 20)))))) is different from false [2025-03-15 01:28:01,665 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2017)))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2018) .cse8 (+ (select .cse7 .cse8) 1))))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3)) 20)))))) is different from false [2025-03-15 01:28:01,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2017)))) (store (store .cse6 .cse5 v_ArrVal_2018) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2)) 20)))))) is different from false [2025-03-15 01:28:02,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse6) 4)) v_ArrVal_2017)))) (store (store .cse7 .cse5 v_ArrVal_2018) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2)) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) is different from false [2025-03-15 01:28:02,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) (+ |c_t2Thread1of1ForFork1_dequeue_#t~mem47#1| 1))))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2017)))) (store (store .cse7 .cse6 v_ArrVal_2018) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3)) 20)))))) is different from false [2025-03-15 01:28:02,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse10 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2017)))) (store (store .cse7 .cse6 v_ArrVal_2018) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3)) 20)))))) is different from false [2025-03-15 01:28:02,163 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse10 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80))) (store (store .cse9 (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse6) 4)) v_ArrVal_2017)))) (store (store .cse7 .cse5 v_ArrVal_2018) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2)) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) is different from false [2025-03-15 01:28:02,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|)) (.cse10 (+ |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| 80))) (store (store .cse9 (+ 88 |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2017)))) (store (store .cse7 .cse6 v_ArrVal_2018) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= 20 (let ((.cse3 (+ |c_~#queue~0.offset| 80))) (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3)))))))) is different from false [2025-03-15 01:28:02,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (+ (select .cse6 .cse2) 1)) (.cse8 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse6 .cse2 .cse7) .cse8 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse6 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse7) .cse8 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)))))) is different from false [2025-03-15 01:28:02,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse7 (+ (select .cse6 .cse2) 1)) (.cse8 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse6 .cse2 .cse7) .cse8 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse6 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse7) .cse8 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)))))) is different from false [2025-03-15 01:28:02,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse7 .cse2) 1)) (.cse9 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse6 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 v_ArrVal_2017) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) is different from false [2025-03-15 01:28:02,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse7 .cse3) 1)) (.cse9 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse3 .cse8) .cse9 v_ArrVal_2017) .cse6 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse7 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse8) .cse9 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3) 20)))))) is different from false [2025-03-15 01:28:02,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse7 .cse2) 1)) (.cse9 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse6 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 v_ArrVal_2017) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) is different from false [2025-03-15 01:28:02,671 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse7 .cse2) 1)) (.cse9 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse6 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 v_ArrVal_2017) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))) is different from false [2025-03-15 01:28:02,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse12))) (or (= .cse0 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse0 1))))) (let ((.cse2 (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse8 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse8 .cse3) 1)) (.cse10 (+ (* (select .cse8 .cse7) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse8 .cse3 .cse9) .cse10 v_ArrVal_2017) .cse6 v_ArrVal_2018) .cse7 (+ (select (store (store (store .cse8 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse9) .cse10 v_ArrVal_2017) .cse7) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse2 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse7 (+ (select (store (store (store .cse2 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3) 20)) (< (select .cse2 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))) is different from false [2025-03-15 01:28:02,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2009) .cse11 (+ .cse12 1))))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse7 .cse3) 1)) (.cse9 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)))) (store (store (store (store .cse7 .cse3 .cse8) .cse9 v_ArrVal_2017) .cse6 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse7 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse8) .cse9 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3) 20)))))) (= .cse12 20)))) is different from false [2025-03-15 01:28:02,879 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2022 (Array Int Int)) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse11 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2007)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse11 .cse12))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2009) .cse12 (+ .cse7 1))))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse8 .cse2) 1)) (.cse10 (+ (* (select .cse8 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse8 .cse2 .cse9) .cse10 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse6 (+ (select (store (store (store .cse8 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse9) .cse10 v_ArrVal_2017) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (= .cse7 20))))))) is different from false [2025-03-15 01:28:03,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse13 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2007)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse9 (select .cse13 .cse8))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2009) .cse8 (+ .cse9 1))))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse10 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse3) 1)) (.cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse1))))) (store (store (store (store .cse10 .cse3 .cse11) .cse12 v_ArrVal_2017) .cse6 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse10 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse11) .cse12 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ (select .cse0 .cse3) 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_ArrVal_2026) .cse6 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse3 .cse4) .cse5 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse3) 20)) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (= 20 .cse9)))))))) is different from false [2025-03-15 01:28:03,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse11 .cse6))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2009) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse8 .cse2) 1)) (.cse10 (+ (* 4 (select .cse8 .cse6)) |c_~#queue~0.offset|))) (store (store (store (store .cse8 .cse2 .cse9) .cse10 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse6 (+ (select (store (store (store .cse8 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse9) .cse10 v_ArrVal_2017) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (= 20 .cse0) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2025-03-15 01:28:04,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse11 .cse6))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2009) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse8 .cse2) 1)) (.cse10 (+ (* (select .cse8 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse8 .cse2 .cse9) .cse10 v_ArrVal_2017) .cse5 v_ArrVal_2018) .cse6 (+ (select (store (store (store .cse8 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse9) .cse10 v_ArrVal_2017) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (= .cse0 20) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ (select .cse1 .cse2) 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_2026) .cse5 v_ArrVal_2028) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse2 .cse3) .cse4 v_ArrVal_2026) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse2) 20)) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|))))))) is different from false [2025-03-15 01:28:04,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse12 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse12 .cse2))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2009) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse10 (+ (select .cse9 .cse5) 1)) (.cse11 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse9 .cse5 .cse10) .cse11 v_ArrVal_2017) .cse8 v_ArrVal_2018) .cse2 (+ (select (store (store (store .cse9 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse10) .cse11 v_ArrVal_2017) .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (not (= 20 (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse6 (+ (select .cse4 .cse5) 1)) (.cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse4 .cse5 .cse6) .cse7 v_ArrVal_2026) .cse8 v_ArrVal_2028) .cse2 (+ (select (store (store (store .cse4 .cse8 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse5 .cse6) .cse7 v_ArrVal_2026) .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse5))) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))) is different from false [2025-03-15 01:28:04,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse12 .cse1))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2009) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse10 (+ (select .cse9 .cse5) 1)) (.cse11 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|))) (store (store (store (store .cse9 .cse5 .cse10) .cse11 v_ArrVal_2017) .cse8 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse9 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse10) .cse11 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (= .cse2 20) (not (= 20 (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse6 (+ (select .cse4 .cse5) 1)) (.cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse4 .cse5 .cse6) .cse7 v_ArrVal_2026) .cse8 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse4 .cse8 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse5 .cse6) .cse7 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse5))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))) is different from false [2025-03-15 01:28:04,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))))) (let ((.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse12 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse12 .cse1))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_2009) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse10 (+ (select .cse9 .cse4) 1)) (.cse11 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)))) (store (store (store (store .cse9 .cse4 .cse10) .cse11 v_ArrVal_2017) .cse7 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse9 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse10) .cse11 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse5 (+ (select .cse0 .cse4) 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse4 .cse5) .cse6 v_ArrVal_2026) .cse7 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse7 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse4 .cse5) .cse6 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse4) 20)) (= .cse8 20)))))))) is different from false [2025-03-15 01:28:04,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ (select .cse13 .cse14) 1)))))) (let ((.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse12 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse12 .cse1))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_2009) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse10 (+ (select .cse9 .cse4) 1)) (.cse11 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)))) (store (store (store (store .cse9 .cse4 .cse10) .cse11 v_ArrVal_2017) .cse7 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse9 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse10) .cse11 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (not (= 20 (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse5 (+ (select .cse0 .cse4) 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse4 .cse5) .cse6 v_ArrVal_2026) .cse7 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse7 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse4 .cse5) .cse6 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse4))) (= .cse8 20)))))))) is different from false [2025-03-15 01:28:05,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ (select .cse13 .cse14) 1)))))) (let ((.cse8 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse12 .cse1))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_2009) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse10 (+ (select .cse9 .cse4) 1)) (.cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse1))))) (store (store (store (store .cse9 .cse4 .cse10) .cse11 v_ArrVal_2017) .cse7 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse9 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse10) .cse11 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (= .cse2 20) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse5 (+ (select .cse0 .cse4) 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse4 .cse5) .cse6 v_ArrVal_2026) .cse7 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse7 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse4 .cse5) .cse6 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse4) 20)) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|)))))))) is different from false [2025-03-15 01:28:05,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse15 .cse1) 1)))))) (let ((.cse10 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse14 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ |c_~#queue~0.offset| 80)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse14 .cse3))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse14 .cse9 v_ArrVal_2009) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse6) 1)) (.cse13 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)))) (store (store (store (store .cse11 .cse6 .cse12) .cse13 v_ArrVal_2017) .cse9 v_ArrVal_2018) .cse3 (+ (select (store (store (store .cse11 .cse9 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse12) .cse13 v_ArrVal_2017) .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (= .cse4 20) (not (= (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse7 (+ (select .cse2 .cse6) 1)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse6 .cse7) .cse8 v_ArrVal_2026) .cse9 v_ArrVal_2028) .cse3 (+ (select (store (store (store .cse2 .cse9 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse6 .cse7) .cse8 v_ArrVal_2026) .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse6) 20)) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|))))))))))) is different from false [2025-03-15 01:28:05,273 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse15 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ (select .cse15 .cse10) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse14 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse1))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_2009) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse12 (+ (select .cse11 .cse4) 1)) (.cse13 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)))) (store (store (store (store .cse11 .cse4 .cse12) .cse13 v_ArrVal_2017) .cse7 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse11 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse12) .cse13 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse5 (+ (select .cse3 .cse4) 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_ArrVal_2026) .cse7 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse3 .cse7 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse4 .cse5) .cse6 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse4) 20)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (= 20 .cse8) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|))))))))) is different from false [2025-03-15 01:28:05,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse12 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse2 (select .cse12 .cse1))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2009) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse10 (+ (select .cse9 .cse5) 1)) (.cse11 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)))) (store (store (store (store .cse9 .cse5 .cse10) .cse11 v_ArrVal_2017) .cse8 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse9 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse10) .cse11 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (= .cse2 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (not (= 20 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (+ (select .cse0 .cse5) 1)) (.cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse5 .cse6) .cse7 v_ArrVal_2026) .cse8 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse8 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse5 .cse6) .cse7 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse5)))))))))) is different from false [2025-03-15 01:28:06,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2001 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_2001)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse14 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse13 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007))) (let ((.cse6 (+ |c_~#queue~0.offset| 80)) (.cse3 (select .cse13 .cse1))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_2009) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse6) 1)) (.cse12 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse10 .cse6 .cse11) .cse12 v_ArrVal_2017) .cse9 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse10 .cse9 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse6 .cse11) .cse12 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (= .cse3 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (not (= (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse7 (+ (select .cse0 .cse6) 1)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse6 .cse7) .cse8 v_ArrVal_2026) .cse9 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse0 .cse9 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse6 .cse7) .cse8 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse6) 20)))))))))) is different from false [2025-03-15 01:28:07,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85| Int) (v_ArrVal_2006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2013 (Array Int Int)) (v_ArrVal_2022 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_2031 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_2001 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2026 Int) (v_ArrVal_2007 Int) (v_ArrVal_2018 Int) (v_ArrVal_2017 Int) (v_ArrVal_2028 Int) (v_ArrVal_2009 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 84) 0) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_2001)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse14 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2006) |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2007))) (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse9 (select .cse13 .cse1))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse10 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2009) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2013) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse10 .cse5) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)))) (store (store (store (store .cse10 .cse5 .cse11) .cse12 v_ArrVal_2017) .cse8 v_ArrVal_2018) .cse1 (+ (select (store (store (store .cse10 .cse8 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 .cse11) .cse12 v_ArrVal_2017) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2022) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (not (= 20 (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse6 (+ 1 (select .cse2 .cse5))) (.cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 .cse6) .cse7 v_ArrVal_2026) .cse8 v_ArrVal_2028) .cse1 (+ (select (store (store (store .cse2 .cse8 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_85|)) .cse5 .cse6) .cse7 v_ArrVal_2026) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2031) |c_~#queue~0.base|) .cse5))) (= .cse9 20))))))))) is different from false [2025-03-15 01:28:07,237 INFO L349 Elim1Store]: treesize reduction 462, result has 37.0 percent of original size [2025-03-15 01:28:07,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 8962 treesize of output 2382 [2025-03-15 01:28:07,276 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:28:07,276 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 3604 treesize of output 3464 [2025-03-15 01:28:07,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:28:07,308 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 1077 treesize of output 1073 [2025-03-15 01:28:07,325 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 160 treesize of output 156 [2025-03-15 01:28:07,345 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 38 treesize of output 30 [2025-03-15 01:28:07,360 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 13 treesize of output 9 [2025-03-15 01:28:07,452 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 42 treesize of output 34 [2025-03-15 01:28:07,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:28:07,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 149 [2025-03-15 01:28:07,846 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 17 treesize of output 9 [2025-03-15 01:28:07,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:28:07,898 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 456 treesize of output 416 [2025-03-15 01:28:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 49 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 71 not checked. [2025-03-15 01:28:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817877624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:28:08,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:28:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 49, 62] total 153 [2025-03-15 01:28:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650853145] [2025-03-15 01:28:08,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:28:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 153 states [2025-03-15 01:28:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:28:08,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2025-03-15 01:28:08,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1166, Invalid=12835, Unknown=177, NotChecked=9078, Total=23256 [2025-03-15 01:28:08,907 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 357 [2025-03-15 01:28:08,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1431 places, 1423 transitions, 79742 flow. Second operand has 153 states, 153 states have (on average 186.48366013071896) internal successors, (28532), 153 states have internal predecessors, (28532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:28:08,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:28:08,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 357 [2025-03-15 01:28:08,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:28:55,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:28:57,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:28:59,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:29:08,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:29:18,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:29:29,653 INFO L124 PetriNetUnfolderBase]: 1800/6832 cut-off events. [2025-03-15 01:29:29,653 INFO L125 PetriNetUnfolderBase]: For 1557392/1579866 co-relation queries the response was YES. [2025-03-15 01:29:29,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116314 conditions, 6832 events. 1800/6832 cut-off events. For 1557392/1579866 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 43432 event pairs, 152 based on Foata normal form. 207/6332 useless extension candidates. Maximal degree in co-relation 101312. Up to 2728 conditions per place. [2025-03-15 01:29:29,763 INFO L140 encePairwiseOnDemand]: 301/357 looper letters, 1070 selfloop transitions, 167 changer transitions 226/1703 dead transitions. [2025-03-15 01:29:29,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1555 places, 1703 transitions, 100281 flow [2025-03-15 01:29:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-15 01:29:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2025-03-15 01:29:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 23663 transitions. [2025-03-15 01:29:29,777 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5219127020887095 [2025-03-15 01:29:29,777 INFO L298 CegarLoopForPetriNet]: 348 programPoint places, 1207 predicate places. [2025-03-15 01:29:29,777 INFO L471 AbstractCegarLoop]: Abstraction has has 1555 places, 1703 transitions, 100281 flow [2025-03-15 01:29:29,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 153 states, 153 states have (on average 186.48366013071896) internal successors, (28532), 153 states have internal predecessors, (28532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:29,781 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:29,781 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:29:29,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 01:29:29,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-15 01:29:29,982 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-15 01:29:29,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -127842199, now seen corresponding path program 1 times [2025-03-15 01:29:29,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:29,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757226008] [2025-03-15 01:29:29,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 01:29:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:29:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757226008] [2025-03-15 01:29:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757226008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:29:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524139840] [2025-03-15 01:29:36,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:29:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:29:36,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:29:36,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 01:29:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:37,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 164 conjuncts are in the unsatisfiable core [2025-03-15 01:29:37,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:29:37,340 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 13 treesize of output 9 [2025-03-15 01:29:37,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 [2025-03-15 01:29:37,732 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:29:37,740 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-15 01:29:37,740 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-03-15 01:29:37,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:37,795 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 [2025-03-15 01:29:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-15 01:29:38,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:38,005 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 [2025-03-15 01:29:38,246 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:29:38,256 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-15 01:29:38,257 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-03-15 01:29:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:38,306 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 [2025-03-15 01:29:38,494 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 13 [2025-03-15 01:29:38,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:38,568 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 [2025-03-15 01:29:38,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:38,787 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 [2025-03-15 01:29:38,864 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 [2025-03-15 01:29:39,143 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:29:39,150 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-15 01:29:39,150 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-03-15 01:29:39,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:39,191 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 [2025-03-15 01:29:39,355 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 13 [2025-03-15 01:29:39,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:39,434 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 [2025-03-15 01:29:39,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:39,675 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 [2025-03-15 01:29:39,750 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 [2025-03-15 01:29:40,011 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:29:40,019 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-15 01:29:40,020 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-03-15 01:29:40,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:40,072 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 [2025-03-15 01:29:40,300 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 13 [2025-03-15 01:29:40,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:40,380 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 [2025-03-15 01:29:40,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:29:40,607 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 [2025-03-15 01:29:40,672 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 [2025-03-15 01:29:40,931 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-15 01:29:40,931 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 1 case distinctions, treesize of input 33 treesize of output 13 [2025-03-15 01:29:40,949 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 [2025-03-15 01:29:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 01:29:40,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:29:44,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2260 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|)))) is different from false [2025-03-15 01:29:44,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2260 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1)))))) is different from false [2025-03-15 01:29:44,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2260 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1)))))) (= .cse4 20)))) is different from false [2025-03-15 01:29:44,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2260 Int) (v_ArrVal_2253 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2253) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|)))) (= .cse4 20)))) is different from false [2025-03-15 01:29:44,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2253 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2252)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse3 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2253) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (= .cse2 20)))))) is different from false [2025-03-15 01:29:44,702 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2253 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2252))) (let ((.cse2 (select .cse3 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2253) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (= .cse2 20) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|)))))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|)))) is different from false [2025-03-15 01:29:51,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2253) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (= .cse2 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|))))))) is different from false [2025-03-15 01:29:52,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 Int) (v_ArrVal_2244 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2244) .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse5 .cse1))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2253) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (= .cse2 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20))))))))) is different from false [2025-03-15 01:29:52,929 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2242 Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 Int) (v_ArrVal_2244 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2244) .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (let ((.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2253) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (= .cse0 20) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse2) 20)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|)))))))) (< (select .cse8 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|)))) is different from false [2025-03-15 01:29:52,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 Int) (v_ArrVal_2244 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse8 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2244) .cse4 (+ (select .cse8 .cse4) 1)))))) (let ((.cse2 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse7 .cse1))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2253) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (= .cse5 20))))))))) is different from false [2025-03-15 01:30:14,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2239 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 Int) (v_ArrVal_2244 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse7 .cse6 v_ArrVal_2244) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse3 (select .cse5 .cse1))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2253) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (= .cse3 20) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|)))))))) is different from false [2025-03-15 01:30:16,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (v_ArrVal_2239 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 Int) (v_ArrVal_2244 Int) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse8 .cse7 v_ArrVal_2244) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse3 (select .cse6 .cse1))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2253) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (= 20 .cse3) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)))))))))) is different from false [2025-03-15 01:30:27,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2233)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse10 .cse11))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2235) .cse11 (+ .cse0 1))))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse9 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse9 .cse8 v_ArrVal_2244) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse5 (select .cse7 .cse2))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2253) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse2))) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (= .cse5 20))))))))))) is different from false [2025-03-15 01:30:27,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse10 (store .cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| 4)) v_ArrVal_2233))) (let ((.cse3 (select .cse10 .cse11))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2235) .cse11 (+ .cse3 1))))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse9 .cse8 v_ArrVal_2244) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse2 (select .cse7 .cse1))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2253) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (= .cse2 20) (= .cse3 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|))))))))))) (< (select .cse12 .cse11) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140|)))) is different from false [2025-03-15 01:30:27,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse12 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| 4)) v_ArrVal_2233)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (select .cse12 .cse4))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2235) .cse4 (+ .cse6 1))))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse11 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse11 .cse10 v_ArrVal_2244) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse7 (select .cse9 .cse1))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2253) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (= 20 .cse6) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20)) (= 20 .cse7)))))))))))) is different from false [2025-03-15 01:30:30,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2232) |c_~#queue~0.base|))) (let ((.cse10 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| 4)) v_ArrVal_2233)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse3))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2235) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse9 .cse8 v_ArrVal_2244) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse1 (select .cse7 .cse3))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2253) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (= .cse0 20) (= .cse1 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse3) 20)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|))))))))))) is different from false [2025-03-15 01:30:31,331 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2232) |c_~#queue~0.base|))) (let ((.cse11 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| 4)) v_ArrVal_2233)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse11 .cse1))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_2235) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse10 .cse9 v_ArrVal_2244) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse5 (select .cse8 .cse1))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2253) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (= 20 .cse2) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (= .cse5 20) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (not (= (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse1) 20))))))))))))) is different from false [2025-03-15 01:30:35,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_144| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_144|) (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_144| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse14 .cse1) 1)))))) (let ((.cse5 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_2232) |c_~#queue~0.base|))) (let ((.cse13 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| 4)) v_ArrVal_2233)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse13 .cse3))) (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse13 .cse11 v_ArrVal_2235) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse12 .cse11 v_ArrVal_2244) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse10 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse7 (select .cse10 .cse3))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2253) .cse3 (+ 1 .cse7))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse3) 20)) (= 20 .cse4) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (= 20 .cse7) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|))))))))))))))) is different from false [2025-03-15 01:30:35,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_144| Int) (v_ArrVal_2260 Int) (v_ArrVal_2252 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| Int) (v_ArrVal_2242 Int) (v_ArrVal_2253 Int) (v_ArrVal_2233 Int) (v_ArrVal_2244 Int) (v_ArrVal_2235 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse14 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_144| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse14 .cse8) 1)))))) (let ((.cse1 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_2232) |c_~#queue~0.base|))) (let ((.cse13 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140| 4)) v_ArrVal_2233)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse13 .cse2))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse13 .cse11 v_ArrVal_2235) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2239) |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse12 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136| 4)) v_ArrVal_2242))) (store (store .cse12 .cse11 v_ArrVal_2244) .cse2 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2248) |c_~#queue~0.base|))) (let ((.cse10 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_2252))) (let ((.cse0 (select .cse10 .cse2))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2253) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_140|) (not (= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_2260) .cse2))) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_136|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_132|) (= .cse6 20) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_144|))))))))))))) is different from false [2025-03-15 01:30:49,104 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2025-03-15 01:30:49,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 3850 treesize of output 1386 [2025-03-15 01:30:49,145 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:30:49,145 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 2017 treesize of output 1947 [2025-03-15 01:30:49,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:30:49,180 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 1883 treesize of output 1881 [2025-03-15 01:30:49,204 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 172 treesize of output 164 [2025-03-15 01:30:49,220 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 38 treesize of output 30 [2025-03-15 01:30:49,236 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 38 treesize of output 30 [2025-03-15 01:30:49,252 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 13 treesize of output 9 [2025-03-15 01:30:49,363 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 43 treesize of output 35 [2025-03-15 01:30:49,548 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 21 treesize of output 13 [2025-03-15 01:30:49,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:30:49,649 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 198 treesize of output 196 [2025-03-15 01:30:49,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:30:49,902 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 484 treesize of output 452 [2025-03-15 01:30:50,386 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2025-03-15 01:30:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2025-03-15 01:30:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524139840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:30:54,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:30:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 45, 62] total 150 [2025-03-15 01:30:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122017745] [2025-03-15 01:30:54,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:30:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 150 states [2025-03-15 01:30:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:30:54,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2025-03-15 01:30:54,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1633, Invalid=15151, Unknown=322, NotChecked=5244, Total=22350 [2025-03-15 01:30:54,999 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 357 [2025-03-15 01:30:55,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1555 places, 1703 transitions, 100281 flow. Second operand has 150 states, 150 states have (on average 197.46666666666667) internal successors, (29620), 150 states have internal predecessors, (29620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:30:55,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:30:55,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 357 [2025-03-15 01:30:55,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:31:28,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:31:40,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:03,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:25,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:27,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:29,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:31,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:33,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:35,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:37,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:40,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:42,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:44,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:46,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:49,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:52,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:54,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:56,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:58,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:00,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:02,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:10,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:32,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:49,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:51,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:53,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:55,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:57,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:00,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:02,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:29,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:31,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:33,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:53,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:56,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:15,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:17,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:19,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:21,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:23,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:47,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:49,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:51,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:53,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:55,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:57,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:59,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:36:01,609 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] Received shutdown request... [2025-03-15 01:36:21,591 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:36:21,591 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:36:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-15 01:36:21,680 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2025-03-15 01:36:21,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-15 01:36:21,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-15 01:36:21,881 WARN L596 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2025-03-15 01:36:21,883 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2025-03-15 01:36:21,884 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2025-03-15 01:36:21,885 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2025-03-15 01:36:21,885 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2025-03-15 01:36:21,885 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2025-03-15 01:36:21,885 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2025-03-15 01:36:21,885 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:36:21,889 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:36:21,889 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:36:21,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:36:21 BasicIcfg [2025-03-15 01:36:21,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:36:21,894 INFO L158 Benchmark]: Toolchain (without parser) took 835856.99ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 42.6MB in the beginning and 938.2MB in the end (delta: -895.6MB). Peak memory consumption was 864.9MB. Max. memory is 8.0GB. [2025-03-15 01:36:21,894 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 71.3MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:36:21,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.54ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 36.6MB in the end (delta: 5.9MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2025-03-15 01:36:21,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.07ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 33.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:36:21,895 INFO L158 Benchmark]: Boogie Preprocessor took 56.37ms. Allocated memory is still 71.3MB. Free memory was 33.4MB in the beginning and 31.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:36:21,895 INFO L158 Benchmark]: RCFGBuilder took 653.86ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 25.7MB in the end (delta: 5.3MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2025-03-15 01:36:21,895 INFO L158 Benchmark]: TraceAbstraction took 834493.78ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 24.7MB in the beginning and 938.2MB in the end (delta: -913.5MB). Peak memory consumption was 849.1MB. Max. memory is 8.0GB. [2025-03-15 01:36:21,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 71.3MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 590.54ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 36.6MB in the end (delta: 5.9MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.07ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 33.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.37ms. Allocated memory is still 71.3MB. Free memory was 33.4MB in the beginning and 31.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 653.86ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 25.7MB in the end (delta: 5.3MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. * TraceAbstraction took 834493.78ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 24.7MB in the beginning and 938.2MB in the end (delta: -913.5MB). Peak memory consumption was 849.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-15-2-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-14-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 555 locations, 38 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 834.3s, OverallIterations: 38, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 545.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 22088 SdHoareTripleChecker+Valid, 175.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22088 mSDsluCounter, 25337 SdHoareTripleChecker+Invalid, 168.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46648 IncrementalHoareTripleChecker+Unchecked, 23619 mSDsCounter, 2119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98993 IncrementalHoareTripleChecker+Invalid, 147806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2119 mSolverCounterUnsat, 1718 mSDtfsCounter, 98993 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9188 GetRequests, 6295 SyntacticMatches, 258 SemanticMatches, 2634 ConstructedPredicates, 109 IntricatePredicates, 0 DeprecatedPredicates, 132002 ImplicationChecksByTransitivity, 457.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100281occurred in iteration=37, InterpolantAutomatonStates: 1296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 282.4s InterpolantComputationTime, 13502 NumberOfCodeBlocks, 13502 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 16572 ConstructedInterpolants, 1474 QuantifiedInterpolants, 1119619 SizeOfPredicates, 360 NumberOfNonLiveVariables, 7025 ConjunctsInSsa, 773 ConjunctsInUnsatCore, 54 InterpolantComputations, 31 PerfectInterpolantSequences, 368/1637 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown