/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 21:40:56,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 21:40:56,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 21:40:56,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 21:40:56,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 21:40:56,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 21:40:56,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 21:40:56,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 21:40:56,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 21:40:56,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 21:40:56,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 21:40:56,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 21:40:56,656 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 21:40:56,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 21:40:56,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 21:40:56,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 21:40:56,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 21:40:56,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 21:40:56,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 21:40:56,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 21:40:56,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 21:40:56,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 21:40:56,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 21:40:56,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 21:40:56,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 21:40:56,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 21:40:56,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 21:40:56,660 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 21:40:56,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 21:40:56,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 21:40:56,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 21:40:56,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 21:40:56,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-05 21:40:56,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 21:40:56,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 21:40:56,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 21:40:56,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 21:40:56,930 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 21:40:56,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-04-05 21:40:58,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 21:40:58,297 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 21:40:58,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-04-05 21:40:58,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/43e34755d/08384ed14275441ea236aaeabf76ccdc/FLAG2ea6d6bd2 [2024-04-05 21:40:58,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/43e34755d/08384ed14275441ea236aaeabf76ccdc [2024-04-05 21:40:58,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 21:40:58,334 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 21:40:58,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 21:40:58,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 21:40:58,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 21:40:58,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c57c391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58, skipping insertion in model container [2024-04-05 21:40:58,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,382 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 21:40:58,691 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-04-05 21:40:58,696 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-04-05 21:40:58,698 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-04-05 21:40:58,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 21:40:58,714 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 21:40:58,746 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-04-05 21:40:58,749 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-04-05 21:40:58,750 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-04-05 21:40:58,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 21:40:58,810 INFO L206 MainTranslator]: Completed translation [2024-04-05 21:40:58,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58 WrapperNode [2024-04-05 21:40:58,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 21:40:58,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 21:40:58,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 21:40:58,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 21:40:58,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,878 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-04-05 21:40:58,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 21:40:58,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 21:40:58,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 21:40:58,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 21:40:58,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 21:40:58,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 21:40:58,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 21:40:58,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 21:40:58,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (1/1) ... [2024-04-05 21:40:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 21:40:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:40:58,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 21:40:59,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 21:40:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-05 21:40:59,026 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-05 21:40:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-05 21:40:59,026 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 21:40:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 21:40:59,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 21:40:59,028 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 21:40:59,187 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 21:40:59,190 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 21:40:59,551 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 21:40:59,571 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 21:40:59,571 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 21:40:59,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:40:59 BoogieIcfgContainer [2024-04-05 21:40:59,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 21:40:59,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 21:40:59,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 21:40:59,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 21:40:59,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 09:40:58" (1/3) ... [2024-04-05 21:40:59,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3300b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:40:59, skipping insertion in model container [2024-04-05 21:40:59,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:40:58" (2/3) ... [2024-04-05 21:40:59,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3300b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:40:59, skipping insertion in model container [2024-04-05 21:40:59,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:40:59" (3/3) ... [2024-04-05 21:40:59,579 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-04-05 21:40:59,585 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 21:40:59,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 21:40:59,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-04-05 21:40:59,593 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 21:40:59,680 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 21:40:59,726 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 21:40:59,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 21:40:59,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:40:59,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 21:40:59,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 21:40:59,767 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 21:40:59,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:40:59,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 21:40:59,783 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1378dd69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213 [2024-04-05 21:40:59,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 21:40:59,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:40:59,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:40:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 354382951, now seen corresponding path program 1 times [2024-04-05 21:40:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:40:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830261219] [2024-04-05 21:40:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:40:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:40:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:00,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830261219] [2024-04-05 21:41:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830261219] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:00,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 21:41:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869464745] [2024-04-05 21:41:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 21:41:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 21:41:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 21:41:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:00,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 21:41:00,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:00,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash 988144468, now seen corresponding path program 1 times [2024-04-05 21:41:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541610379] [2024-04-05 21:41:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541610379] [2024-04-05 21:41:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541610379] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-05 21:41:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492163484] [2024-04-05 21:41:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-05 21:41:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 21:41:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-05 21:41:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:00,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:00,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:00,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 21:41:00,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:00,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2145678791, now seen corresponding path program 1 times [2024-04-05 21:41:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218331136] [2024-04-05 21:41:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218331136] [2024-04-05 21:41:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218331136] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:01,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-04-05 21:41:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118015731] [2024-04-05 21:41:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:01,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-04-05 21:41:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-04-05 21:41:01,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-04-05 21:41:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:01,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:01,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:01,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:01,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:01,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:01,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 21:41:01,978 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:01,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1468984428, now seen corresponding path program 1 times [2024-04-05 21:41:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:01,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134879534] [2024-04-05 21:41:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134879534] [2024-04-05 21:41:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134879534] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-04-05 21:41:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271117274] [2024-04-05 21:41:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:03,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-04-05 21:41:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-04-05 21:41:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2024-04-05 21:41:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:03,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:03,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 27 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:03,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:03,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:03,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:03,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-05 21:41:04,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 21:41:04,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:04,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1786371939, now seen corresponding path program 1 times [2024-04-05 21:41:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126745008] [2024-04-05 21:41:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126745008] [2024-04-05 21:41:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126745008] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:04,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-05 21:41:04,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452784579] [2024-04-05 21:41:04,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:04,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-05 21:41:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:04,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 21:41:04,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-05 21:41:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:04,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:04,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:04,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:04,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:04,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:04,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-05 21:41:04,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:04,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 21:41:04,911 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:04,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1917543094, now seen corresponding path program 1 times [2024-04-05 21:41:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529054204] [2024-04-05 21:41:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529054204] [2024-04-05 21:41:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529054204] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:09,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-04-05 21:41:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094654668] [2024-04-05 21:41:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-04-05 21:41:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-04-05 21:41:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2024-04-05 21:41:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:09,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:09,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.829268292682927) internal successors, (198), 41 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:09,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:09,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:09,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:09,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:09,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:09,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:11,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 21:41:11,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:11,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1457605787, now seen corresponding path program 1 times [2024-04-05 21:41:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285569804] [2024-04-05 21:41:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285569804] [2024-04-05 21:41:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285569804] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:13,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:13,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-04-05 21:41:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176717346] [2024-04-05 21:41:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:13,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-05 21:41:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-05 21:41:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2024-04-05 21:41:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:13,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:13,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.516129032258065) internal successors, (202), 31 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:13,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:41:14,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 21:41:14,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:14,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 145069809, now seen corresponding path program 1 times [2024-04-05 21:41:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012817329] [2024-04-05 21:41:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:17,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012817329] [2024-04-05 21:41:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012817329] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:17,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-04-05 21:41:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424534239] [2024-04-05 21:41:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:17,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-04-05 21:41:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-04-05 21:41:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2024-04-05 21:41:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:17,698 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:17,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.45945945945946) internal successors, (202), 37 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:41:17,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:41:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-04-05 21:41:19,584 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:19,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 272690006, now seen corresponding path program 1 times [2024-04-05 21:41:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936705856] [2024-04-05 21:41:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936705856] [2024-04-05 21:41:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936705856] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:41:24,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:41:24,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2024-04-05 21:41:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241692922] [2024-04-05 21:41:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:41:24,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-04-05 21:41:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:24,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-04-05 21:41:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2024-04-05 21:41:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:24,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:24,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.12) internal successors, (206), 50 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:41:24,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:41:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 21:41:28,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-04-05 21:41:28,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:41:28,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:41:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash -680365112, now seen corresponding path program 1 times [2024-04-05 21:41:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:41:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841372966] [2024-04-05 21:41:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:41:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:31,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:41:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841372966] [2024-04-05 21:41:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841372966] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:41:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268411258] [2024-04-05 21:41:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:41:31,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:41:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:41:31,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:41:31,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 21:41:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:41:31,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 119 conjunts are in the unsatisfiable core [2024-04-05 21:41:31,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:41:32,002 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 21:41:32,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 21:41:32,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 21:41:32,047 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 11 treesize of output 11 [2024-04-05 21:41:32,219 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 11 treesize of output 7 [2024-04-05 21:41:32,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:32,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 21:41:32,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:41:32,912 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 11 [2024-04-05 21:41:32,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:33,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-04-05 21:41:33,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:41:33,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 21:41:33,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 21:41:33,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:33,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:33,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 19 treesize of output 11 [2024-04-05 21:41:34,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:41:34,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 21:41:34,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:34,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:34,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:41:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:41:34,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 21:41:35,250 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-05 21:41:35,292 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-05 21:41:35,298 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-05 21:41:35,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-05 21:41:35,319 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)))))) is different from false [2024-04-05 21:41:35,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_458 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse2)))))))) is different from false [2024-04-05 21:41:35,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_455) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1))))) (= 400 .cse4))))) is different from false [2024-04-05 21:41:35,470 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_455) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1)))) (= 400 .cse4)))))) is different from false [2024-04-05 21:41:35,487 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse5 .cse4) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_455) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2))))))))) is different from false [2024-04-05 21:41:35,957 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse3 (select .cse2 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1))) (= 400 .cse3)))))) is different from false [2024-04-05 21:41:36,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2)))))))) is different from false [2024-04-05 21:41:36,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse3 (let ((.cse5 (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 400 (select (let ((.cse0 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse1))) (= 400 .cse4)))))) is different from false [2024-04-05 21:41:36,042 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (not (= 400 (select (let ((.cse1 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse2)))))))) is different from false [2024-04-05 21:41:36,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_23| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))))) (let ((.cse5 (let ((.cse6 (select (store (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_452) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 400 .cse1) (not (= 400 (select (let ((.cse2 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_453) |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_455) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_458) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_23|)) .cse3))))))))))) is different from false [2024-04-05 21:41:53,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:41:53,918 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 1223 treesize of output 733 [2024-04-05 21:41:53,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:41:53,937 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 1335 treesize of output 1315 [2024-04-05 21:41:53,949 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 899 treesize of output 811 [2024-04-05 21:41:53,965 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 546 treesize of output 510 [2024-04-05 21:41:53,981 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 666 treesize of output 610 [2024-04-05 21:41:54,003 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 258 treesize of output 234 [2024-04-05 21:41:54,144 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 8 treesize of output 4 [2024-04-05 21:41:54,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:41:54,430 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 321 treesize of output 269 [2024-04-05 21:41:55,018 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-04-05 21:41:55,018 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 66 treesize of output 90 [2024-04-05 21:41:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-04-05 21:41:55,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268411258] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 21:41:55,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 21:41:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 43] total 113 [2024-04-05 21:41:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514041388] [2024-04-05 21:41:55,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 21:41:55,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2024-04-05 21:41:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:41:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2024-04-05 21:41:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=8757, Unknown=99, NotChecked=2898, Total=12656 [2024-04-05 21:41:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:55,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:41:55,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 6.424778761061947) internal successors, (726), 113 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-05 21:41:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:42:05,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:42:05,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 21:42:05,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-05 21:42:05,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 21:42:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-04-05 21:42:05,471 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:42:05,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:42:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1926876931, now seen corresponding path program 1 times [2024-04-05 21:42:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:42:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396127819] [2024-04-05 21:42:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:42:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:42:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:42:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:42:10,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:42:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396127819] [2024-04-05 21:42:10,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396127819] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:42:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541142140] [2024-04-05 21:42:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:42:10,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:42:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:42:10,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:42:10,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 21:42:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:42:10,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 126 conjunts are in the unsatisfiable core [2024-04-05 21:42:10,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:42:10,353 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 21:42:10,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 21:42:10,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 21:42:10,399 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 11 treesize of output 11 [2024-04-05 21:42:10,579 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 11 treesize of output 7 [2024-04-05 21:42:10,629 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 19 treesize of output 18 [2024-04-05 21:42:10,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:10,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:42:11,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:42:11,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:42:11,297 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 34 treesize of output 21 [2024-04-05 21:42:11,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:11,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-04-05 21:42:11,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:42:11,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:42:12,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:42:12,385 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-05 21:42:12,385 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 2 case distinctions, treesize of input 41 treesize of output 24 [2024-04-05 21:42:12,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:12,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-04-05 21:42:12,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:42:12,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:42:13,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:13,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-05 21:42:13,593 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-04-05 21:42:13,594 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 2 case distinctions, treesize of input 41 treesize of output 24 [2024-04-05 21:42:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:13,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-04-05 21:42:13,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:42:13,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 21:42:13,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-05 21:42:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:42:14,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 21:42:16,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-04-05 21:42:16,766 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))))) is different from false [2024-04-05 21:42:16,823 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 (+ (select .cse2 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5))))))))) is different from false [2024-04-05 21:42:16,879 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse3 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ (select .cse0 .cse3) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse3)))) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|)))))) is different from false [2024-04-05 21:42:16,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse2 .cse6 (+ (select .cse2 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))))))))))) is different from false [2024-04-05 21:42:16,939 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_617) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse6 (+ (select .cse0 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))))))))) is different from false [2024-04-05 21:42:21,451 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_614 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (v_ArrVal_625 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_617) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse3 v_ArrVal_625) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse2)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-04-05 21:42:21,833 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse5 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|)))))) is different from false [2024-04-05 21:42:21,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse0 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse6 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5)) 400)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-04-05 21:42:22,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse6 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|))) is different from false [2024-04-05 21:42:22,071 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse6 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse5)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|)))))))) is different from false [2024-04-05 21:42:22,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_610) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse0 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse5 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|)))))))) is different from false [2024-04-05 21:42:22,303 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_610) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (not (= 400 (let ((.cse3 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ (select .cse0 .cse3) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse4 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse3)))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-04-05 21:42:22,342 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse8 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_617) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse7 v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|))))))))))) is different from false [2024-04-05 21:42:22,411 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))))) (let ((.cse9 (select (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_617) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse7 v_ArrVal_625) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse6)))) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-04-05 21:42:28,377 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_606 Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_608))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_610) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_617) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse3 v_ArrVal_625) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse2)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-04-05 21:42:28,415 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_606 Int) (v_ArrVal_617 Int) (v_ArrVal_625 Int) (v_ArrVal_610 Int) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| Int)) (let ((.cse9 (store (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| 1604) 0) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_608))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_610) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_614)) (.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_39|))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_617) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41| 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_41|) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_35|) .cse5 v_ArrVal_625) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_628) |c_~#queue~0.base|) .cse4)))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_45|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|))))))))) is different from false [2024-04-05 21:42:28,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:42:28,434 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 3 case distinctions, treesize of input 721 treesize of output 431 [2024-04-05 21:42:28,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:42:28,455 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 2624 treesize of output 2612 [2024-04-05 21:42:28,503 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 462 treesize of output 450 [2024-04-05 21:42:28,519 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 668 treesize of output 628 [2024-04-05 21:42:28,538 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 274 treesize of output 262 [2024-04-05 21:42:28,559 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 370 treesize of output 354 [2024-04-05 21:42:28,579 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 92 treesize of output 80 [2024-04-05 21:42:28,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:42:28,745 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 [2024-04-05 21:42:29,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:42:29,270 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 453 treesize of output 465 [2024-04-05 21:42:31,182 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-04-05 21:42:31,182 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 66 treesize of output 90 [2024-04-05 21:42:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-04-05 21:42:31,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541142140] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 21:42:31,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 21:42:31,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 41, 48] total 134 [2024-04-05 21:42:31,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417991978] [2024-04-05 21:42:31,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 21:42:31,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2024-04-05 21:42:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:42:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2024-04-05 21:42:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=12220, Unknown=93, NotChecked=4182, Total=17822 [2024-04-05 21:42:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:42:31,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:42:31,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 6.059701492537314) internal successors, (812), 134 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:42:31,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:42:31,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:42:31,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:42:31,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:42:31,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:42:31,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:42:31,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:42:31,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:42:31,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-05 21:42:31,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-05 21:42:31,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:42:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-05 21:42:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-04-05 21:42:45,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 21:42:45,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:42:45,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 21:42:45,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:42:45,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1452722792, now seen corresponding path program 1 times [2024-04-05 21:42:45,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:42:45,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147364118] [2024-04-05 21:42:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:42:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:42:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:42:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:42:56,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:42:56,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147364118] [2024-04-05 21:42:56,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147364118] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:42:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479914160] [2024-04-05 21:42:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:42:56,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:42:56,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:42:56,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:42:56,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 21:42:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:42:56,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 164 conjunts are in the unsatisfiable core [2024-04-05 21:42:56,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:42:57,212 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 21:42:57,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-04-05 21:42:57,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 21:42:57,291 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 11 treesize of output 11 [2024-04-05 21:42:57,544 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 11 treesize of output 7 [2024-04-05 21:42:57,638 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 19 treesize of output 18 [2024-04-05 21:42:57,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:58,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:42:58,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:58,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-04-05 21:42:58,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-05 21:42:59,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:42:59,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:42:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-04-05 21:43:00,354 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 26 treesize of output 28 [2024-04-05 21:43:00,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-04-05 21:43:00,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-04-05 21:43:01,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:01,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2024-04-05 21:43:01,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-04-05 21:43:02,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:02,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 37 treesize of output 38 [2024-04-05 21:43:03,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:03,244 INFO L349 Elim1Store]: treesize reduction 58, result has 34.1 percent of original size [2024-04-05 21:43:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 64 [2024-04-05 21:43:03,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:03,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2024-04-05 21:43:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:03,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 21:43:04,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:04,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:04,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2024-04-05 21:43:04,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:04,758 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 34 treesize of output 23 [2024-04-05 21:43:04,760 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 20 treesize of output 14 [2024-04-05 21:43:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 21:43:04,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 21:43:05,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-04-05 21:43:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:43:05,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 21:43:05,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork0_dequeue_#t~mem43#1| 0)) (.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_795 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2024-04-05 21:44:52,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ (select .cse5 .cse3) 1))) (let ((.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse10 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse11 (store .cse5 .cse3 .cse7)) (.cse8 (+ (* (select .cse5 .cse9) 4) |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse11 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse6 v_ArrVal_790) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 0)) (= (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0) (= (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse3 .cse7) .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse11 .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse6 v_ArrVal_790) .cse9 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse12 (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork1_~value~0#1|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 1)) (= (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse3 .cse7) .cse8 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse9) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10) (not (= (let ((.cse13 (select (store .cse14 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2024-04-05 21:44:52,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ (select .cse6 .cse1) 1))) (let ((.cse5 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse4 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse12 (store .cse6 .cse1 .cse8)) (.cse9 (+ (* 4 (select .cse6 .cse10)) |c_~#queue~0.offset|)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse2 (store (store (store .cse12 .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 v_ArrVal_790) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (let ((.cse3 (store (select (store .cse11 |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse5) (= 400 (select (store (store (store .cse6 .cse7 v_ArrVal_786) .cse1 .cse8) .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse10)))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (|t1Thread1of1ForFork1_enqueue_#t~post41#1| Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_ArrVal_795 (Array Int Int)) (v_subst_2 Int)) (let ((.cse14 (store (store (store .cse12 .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse7 v_ArrVal_790) .cse10 (+ |t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (let ((.cse15 (store (select (store .cse11 |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse5) (= (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse14) |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (select .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse6 .cse7 v_ArrVal_786) .cse1 .cse8) .cse9 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse10)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 0))))))))))) is different from false [2024-04-05 21:44:53,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse12 (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)) |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (let ((.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ (select .cse3 .cse5) 1))) (let ((.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse11 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse13 (store .cse3 .cse5 .cse6)) (.cse7 (+ (* (select .cse3 .cse8) 4) |c_~#queue~0.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse10 (store (store (store .cse13 .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse4 v_ArrVal_790) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (= 400 (select (store (store (store .cse3 .cse4 v_ArrVal_786) .cse5 .cse6) .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse8)) (not (= 0 (let ((.cse9 (select (store (store .cse0 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)))))) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (v_ArrVal_795 (Array Int Int)) (v_subst_2 Int)) (let ((.cse16 (store (store (store .cse13 .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse4 v_ArrVal_790) .cse8 (+ v_subst_4 1)))) (let ((.cse14 (store (select (store .cse12 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 (select (store (store (store .cse3 .cse4 v_ArrVal_786) .cse5 .cse6) .cse7 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse8)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11) (= (let ((.cse15 (select (store (store .cse0 |c_~#queue~0.base| .cse16) |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))))) is different from false [2024-04-05 21:44:53,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse13 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse14 .cse15 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse13 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse8 (store (select (store .cse12 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (not (= (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse2))))) 0)))))))))) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (v_ArrVal_795 (Array Int Int)) (v_subst_2 Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse14 .cse15 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse13 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse16 (select .cse23 |c_~#queue~0.base|))) (let ((.cse17 (+ (select .cse16 .cse2) 1)) (.cse18 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse21 (store (store (store (store .cse16 .cse2 .cse17) .cse18 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store .cse23 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse16 .cse1 v_ArrVal_786) .cse2 .cse17) .cse18 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (= (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)))) 0) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6))))))))) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1|))))) is different from false [2024-04-05 21:44:53,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse6 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse10 (select .cse15 .cse16)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4)))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse15 .cse16 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse12 (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10) (not (= (let ((.cse11 (select (store (store .cse7 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))))) 0)))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse15 .cse16 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse17 (select .cse24 |c_~#queue~0.base|))) (let ((.cse18 (+ (select .cse17 .cse2) 1)) (.cse19 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse22 (store (store (store (store .cse17 .cse2 .cse18) .cse19 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse23 (store (select (store .cse24 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse17 .cse1 v_ArrVal_786) .cse2 .cse18) .cse19 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (= (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)))) 0) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse6) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10)))))))))))) is different from false [2024-04-05 21:44:54,527 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse9 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse12 (select .cse15 .cse17)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (not (= (select (select (store (store .cse6 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse9) (not (= (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse12))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse20 (select .cse25 |c_~#queue~0.base|))) (let ((.cse21 (+ (select .cse20 .cse2) 1)) (.cse22 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse24 (store (store (store (store .cse20 .cse2 .cse21) .cse22 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 0)) (= 400 (select (store (store (store .cse20 .cse1 v_ArrVal_786) .cse2 .cse21) .cse22 |t1Thread1of1ForFork1_enqueue_~x#1|) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse9) (= (let ((.cse23 (select (store (store .cse18 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse12)))))))))))) is different from false [2024-04-05 21:44:55,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse15 .cse17)) (.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse10 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (+ (select .cse1 .cse3) 1)) (.cse5 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse12 (store (store (store (store .cse1 .cse3 .cse4) .cse5 v_subst_7) .cse2 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (= (select (store (store (store .cse1 .cse2 v_ArrVal_786) .cse3 .cse4) .cse5 v_subst_7) .cse6) 400) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10) (= (let ((.cse11 (select (store (store .cse7 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse3))))) 0))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse20 (select .cse25 |c_~#queue~0.base|))) (let ((.cse21 (+ (select .cse20 .cse3) 1)) (.cse22 (+ (* (select .cse20 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse24 (store (store (store (store .cse20 .cse3 .cse21) .cse22 v_subst_6) .cse2 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (= 400 (select (store (store (store .cse20 .cse2 v_ArrVal_786) .cse3 .cse21) .cse22 v_subst_6) .cse6)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse10) (not (= (let ((.cse23 (select (store (store .cse18 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-04-05 21:44:55,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse26 (+ (* (select .cse26 .cse17) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse11 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse10 (select .cse15 .cse17)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse8 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse9 (store (select (store .cse13 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_7) .cse5)) (= (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (select .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse22 (select .cse25 |c_~#queue~0.base|))) (let ((.cse23 (+ (select .cse22 .cse2) 1)) (.cse24 (+ (* (select .cse22 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse21 (store (store (store (store .cse22 .cse2 .cse23) .cse24 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse10) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12) (not (= (let ((.cse20 (select (store (store .cse18 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select (store (store (store .cse22 .cse1 v_ArrVal_786) .cse2 .cse23) .cse24 v_subst_6) .cse5)))))))))))))) is different from false [2024-04-05 21:44:56,076 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse26 (+ (* (select .cse26 .cse17) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_enqueue_#in~x#1|)))) (let ((.cse0 (select .cse15 .cse17)) (.cse9 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (+ (select .cse1 .cse3) 1)) (.cse5 (+ (* 4 (select .cse1 .cse6)) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse1 .cse3 .cse4) .cse5 v_subst_7) .cse2 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse8 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (= 400 (select (store (store (store .cse1 .cse2 v_ArrVal_786) .cse3 .cse4) .cse5 v_subst_7) .cse6)) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (= (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse22 (select .cse25 |c_~#queue~0.base|))) (let ((.cse23 (+ (select .cse22 .cse3) 1)) (.cse24 (+ (* 4 (select .cse22 .cse6)) |c_~#queue~0.offset|))) (let ((.cse21 (store (store (store (store .cse22 .cse3 .cse23) .cse24 v_subst_6) .cse2 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store .cse25 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (not (= 0 (let ((.cse20 (select (store (store .cse18 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|))))) (= (select (store (store (store .cse22 .cse2 v_ArrVal_786) .cse3 .cse23) .cse24 v_subst_6) .cse6) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))))))) is different from false [2024-04-05 21:44:56,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse15 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse26 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse26 .cse17) 4)) |c_t1Thread1of1ForFork1_enqueue_#in~x#1|)))) (let ((.cse0 (select .cse15 .cse17)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse6 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse2) 1)) (.cse10 (+ (* (select .cse7 .cse11) 4) |c_~#queue~0.offset|))) (let ((.cse4 (store (store (store (store .cse7 .cse2 .cse9) .cse10 v_subst_6) .cse8 v_ArrVal_790) .cse11 (+ v_subst_5 1)))) (let ((.cse5 (store (select (store .cse13 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (not (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse6) 1)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse2 .cse9) .cse10 v_subst_6) .cse11)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse15 .cse16 v_ArrVal_782) .cse17 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store .cse22 |c_~#stored_elements~0.base| (store (select .cse22 |c_~#stored_elements~0.base|) .cse14 |c_t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse18 (select .cse25 |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse2) 1)) (.cse20 (+ (* (select .cse18 .cse11) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse18 .cse2 .cse19) .cse20 v_subst_7) .cse8 v_ArrVal_790) .cse11 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store .cse25 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| .cse0) (= 400 (select (store (store (store .cse18 .cse8 v_ArrVal_786) .cse2 .cse19) .cse20 v_subst_7) .cse11)) (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse12) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse6) 0)))))))))))))) is different from false [2024-04-05 21:44:57,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse11 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse16 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse5 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store (select .cse13 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store .cse13 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse3) 1)) (.cse10 (+ |c_~#queue~0.offset| (* (select .cse7 .cse6) 4)))) (let ((.cse4 (store (store (store (store .cse7 .cse3 .cse9) .cse10 v_subst_6) .cse8 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse3 .cse9) .cse10 v_subst_6) .cse6)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11)))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse20 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store (select .cse25 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse17 (select (store .cse25 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse18 (+ (select .cse17 .cse3) 1)) (.cse19 (+ |c_~#queue~0.offset| (* (select .cse17 .cse6) 4)))) (let ((.cse23 (store (store (store (store .cse17 .cse3 .cse18) .cse19 v_subst_7) .cse8 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse21 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (select (store (store (store .cse17 .cse8 v_ArrVal_786) .cse3 .cse18) .cse19 v_subst_7) .cse6) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse6)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse1) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse11) (= (let ((.cse22 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|))) 0))))))))))))) is different from false [2024-04-05 21:44:59,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (+ |c_~#stored_elements~0.offset| 4)) (.cse7 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse14 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse16 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store (select .cse13 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store .cse13 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse8 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_7) .cse5) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse6 .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse7) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 0)) (= (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse20 (store .cse15 .cse16 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse24 (store (select .cse25 |c_~#stored_elements~0.base|) .cse14 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse21 (select (store .cse25 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse22 (+ (select .cse21 .cse2) 1)) (.cse23 (+ |c_~#queue~0.offset| (* (select .cse21 .cse5) 4)))) (let ((.cse18 (store (store (store (store .cse21 .cse2 .cse22) .cse23 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse5)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (= 400 (select (store (store (store .cse21 .cse1 v_ArrVal_786) .cse2 .cse22) .cse23 v_subst_6) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse7))))))))))))) is different from false [2024-04-05 21:44:59,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse3 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse7 (+ 1600 |c_~#queue~0.offset|)) (.cse15 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse4 (let ((.cse16 (select .cse0 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse14 (store .cse0 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse13 (store (select .cse14 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse9 (select (store .cse14 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (let ((.cse11 (+ (select .cse9 .cse7) 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)))) (let ((.cse8 (store (store (store (store .cse9 .cse7 .cse11) .cse12 v_subst_6) .cse10 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse3) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse4 .cse5)) (not (= (let ((.cse6 (select (store (store .cse0 |c_~#queue~0.base| .cse8) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select (store (store (store .cse9 .cse10 v_ArrVal_786) .cse7 .cse11) .cse12 v_subst_6) .cse5)))))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse24 (let ((.cse27 (select .cse18 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store .cse18 |c_~#queue~0.base| (store (store .cse24 .cse10 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse25 (store (select .cse26 |c_~#stored_elements~0.base|) .cse15 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse21 (select (store .cse26 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse22 (+ (select .cse21 .cse7) 1)) (.cse23 (+ |c_~#queue~0.offset| (* (select .cse21 .cse5) 4)))) (let ((.cse19 (store (store (store (store .cse21 .cse7 .cse22) .cse23 v_subst_7) .cse10 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse20 (store (select (store (store .cse18 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| .cse19) |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse18 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 (select (store (store (store .cse21 .cse10 v_ArrVal_786) .cse7 .cse22) .cse23 v_subst_7) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| .cse3) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse24 .cse5)))))))))))))) is different from false [2024-04-05 21:45:00,775 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (v_subst_6 Int) (v_subst_5 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_3 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse9 (let ((.cse14 (select .cse0 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store .cse0 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_782) .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse12 (store (select .cse13 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse3 (select (store .cse13 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse6 (+ (select .cse3 .cse5) 1)) (.cse7 (+ (* (select .cse3 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse3 .cse5 .cse6) .cse7 v_subst_6) .cse4 v_ArrVal_790) .cse8 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (select (store (store (store .cse3 .cse4 v_ArrVal_786) .cse5 .cse6) .cse7 v_subst_6) .cse8) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse9 .cse8)) (not (= (let ((.cse10 (select (store (store .cse0 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse5) 4)))) 0)))))))))))) (forall ((v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (v_subst_4 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse22 (let ((.cse25 (select .cse15 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse8) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse24 (store .cse15 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_782) .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))))) (let ((.cse23 (store (select .cse24 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse19 (select (store .cse24 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse20 (+ (select .cse19 .cse5) 1)) (.cse21 (+ (* (select .cse19 .cse8) 4) |c_~#queue~0.offset|))) (let ((.cse18 (store (store (store (store .cse19 .cse5 .cse20) .cse21 v_subst_7) .cse4 v_ArrVal_790) .cse8 (+ v_subst_4 1)))) (let ((.cse16 (store (select (store (store .cse15 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse15 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= (let ((.cse17 (select (store (store .cse15 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse19 .cse4 v_ArrVal_786) .cse5 .cse20) .cse21 v_subst_7) .cse8)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse8)))))))))))))) is different from false [2024-04-05 21:45:03,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse9 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse9 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse7 (store (select (store (store .cse6 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_7) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse6 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse9 .cse5)) (= (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|))) 0))))))))))) (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse26 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse23 (let ((.cse27 (select .cse26 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse25 (store (store .cse23 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse24 (store (select (store .cse26 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse2) 1)) (.cse20 (+ (* (select .cse18 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse22 (store (store (store (store .cse18 .cse2 .cse19) .cse20 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse17 (store (select (store (store .cse16 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse16 |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse18 .cse1 v_ArrVal_786) .cse2 .cse19) .cse20 v_subst_6) .cse5)) (not (= (let ((.cse21 (select (store (store .cse16 |c_~#queue~0.base| .cse22) |c_~#stored_elements~0.base| .cse17) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse23 .cse5)))))))))))))) is different from false [2024-04-05 21:45:05,416 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (and (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse10 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse10 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse7 (+ (select .cse5 .cse1) 1)) (.cse8 (+ (* (select .cse5 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse3 (store (store (store (store .cse5 .cse1 .cse7) .cse8 v_subst_6) .cse6 v_ArrVal_790) .cse9 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (= 400 (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse1 .cse7) .cse8 v_subst_6) .cse9)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse10 .cse9)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)))))))))))) (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse27 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse17 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store (store .cse17 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse25 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (select (store (store .cse22 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse1) 1)) (.cse20 (+ (* (select .cse18 .cse9) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse18 .cse1 .cse19) .cse20 v_subst_7) .cse6 v_ArrVal_790) .cse9 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse17 .cse9)) (= 400 (select (store (store (store .cse18 .cse6 v_ArrVal_786) .cse1 .cse19) .cse20 v_subst_7) .cse9)) (= 0 (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|)))) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))))) is different from false [2024-04-05 21:45:05,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse6 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse5))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse6 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse10 (store (select (store (store .cse8 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_6) .cse5) 400) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse6 .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)))) 0)) (not (= (select (select (store (store .cse8 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)))))))))))) (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse27 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse20 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* 4 (select .cse28 .cse5))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store (store .cse20 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse25 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse17 (select (store (store .cse22 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse18 (+ (select .cse17 .cse2) 1)) (.cse19 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse17 .cse2 .cse18) .cse19 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= 400 (select (store (store (store .cse17 .cse1 v_ArrVal_786) .cse2 .cse18) .cse19 v_subst_7) .cse5)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse5)) (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))))) is different from false [2024-04-05 21:45:06,024 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse29 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse30 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse29 .cse30 (+ (select .cse29 .cse30) 1)))))) (and (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse0 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse0 .cse8 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse4 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse3) 1)) (.cse10 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store (store .cse7 .cse3 .cse9) .cse10 v_subst_7) .cse8 v_ArrVal_790) .cse1 (+ v_subst_4 1)))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (= (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse3 .cse9) .cse10 v_subst_7) .cse1)) (not (= (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))) (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse27 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse17 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse26 (store (store .cse17 .cse8 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse19 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse25 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse22 (select (store (store .cse19 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse23 (+ (select .cse22 .cse3) 1)) (.cse24 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse20 (store (store (store (store .cse22 .cse3 .cse23) .cse24 v_subst_6) .cse8 v_ArrVal_790) .cse1 (+ v_subst_5 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse17 .cse1)) (not (= (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (= 400 (select (store (store (store .cse22 .cse8 v_ArrVal_786) .cse3 .cse23) .cse24 v_subst_6) .cse1)))))))))))))) is different from false [2024-04-05 21:45:07,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse20 (+ (select .cse17 .cse19) 1))) (and (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_775) .cse19 .cse20)))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse11 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse9))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse11 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse10 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse7 (+ (select .cse5 .cse1) 1)) (.cse8 (+ |c_~#queue~0.offset| (* (select .cse5 .cse9) 4)))) (let ((.cse3 (store (store (store (store .cse5 .cse1 .cse7) .cse8 v_subst_6) .cse6 v_ArrVal_790) .cse9 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (= (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse1 .cse7) .cse8 v_subst_6) .cse9) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse10) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse11 .cse9))))))))))))) (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse32 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_775) .cse19 .cse20)))) (let ((.cse31 (store (store .cse32 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse28 (let ((.cse33 (select .cse31 |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* 4 (select .cse33 .cse9))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse30 (store (store .cse28 .cse6 v_ArrVal_782) .cse9 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse21 (store .cse32 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse29 (store (select (store .cse31 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base|) .cse10 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| .cse30) |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse1) 1)) (.cse25 (+ |c_~#queue~0.offset| (* (select .cse23 .cse9) 4)))) (let ((.cse27 (store (store (store (store .cse23 .cse1 .cse24) .cse25 v_subst_7) .cse6 v_ArrVal_790) .cse9 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse10) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse23 .cse6 v_ArrVal_786) .cse1 .cse24) .cse25 v_subst_7) .cse9)) (= (let ((.cse26 (select (store (store .cse21 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse28 .cse9)))))))))))))))) is different from false [2024-04-05 21:45:08,782 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse21 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse17 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_775) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse11 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse11 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse6 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)))) (let ((.cse10 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse7 (store (select (store (store .cse6 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_6) .cse5)) (not (= (select (select (store (store .cse6 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 1)) (not (= (let ((.cse9 (select (store (store .cse6 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse11 .cse5))))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse35 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse35 .cse18 v_ArrVal_775) .cse19 (+ (select .cse35 .cse19) 1)))))) (let ((.cse32 (store (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse29 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse31 (store (store .cse29 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse30 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse24 (select (store (store .cse22 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse25 (+ (select .cse24 .cse2) 1)) (.cse26 (+ |c_~#queue~0.offset| (* (select .cse24 .cse5) 4)))) (let ((.cse28 (store (store (store (store .cse24 .cse2 .cse25) .cse26 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse23 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse8) 0)) (= (select (store (store (store .cse24 .cse1 v_ArrVal_786) .cse2 .cse25) .cse26 v_subst_7) .cse5) 400) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (let ((.cse27 (select (store (store .cse22 |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse29 .cse5))))))))))))))) is different from false [2024-04-05 21:45:09,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse21 (+ (* (select .cse20 .cse19) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse17 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_775) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse0 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse0 .cse6 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse5 .cse7) 1)) (.cse9 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)))) (let ((.cse11 (store (store (store (store .cse5 .cse7 .cse8) .cse9 v_subst_6) .cse6 v_ArrVal_790) .cse1 (+ v_subst_5 1)))) (let ((.cse3 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse7 .cse8) .cse9 v_subst_6) .cse1)) (not (= (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse7) 4) |c_~#queue~0.offset|))) 0))))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse35 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse35 .cse18 v_ArrVal_775) .cse19 (+ (select .cse35 .cse19) 1)))))) (let ((.cse32 (store (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse22 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse31 (store (store .cse22 .cse6 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse30 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse27 (select (store (store .cse23 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse28 (+ (select .cse27 .cse7) 1)) (.cse29 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)))) (let ((.cse26 (store (store (store (store .cse27 .cse7 .cse28) .cse29 v_subst_7) .cse6 v_ArrVal_790) .cse1 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse1)) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse4) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse7) 4) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse27 .cse6 v_ArrVal_786) .cse7 .cse28) .cse29 v_subst_7) .cse1)))))))))))))))) is different from false [2024-04-05 21:45:10,371 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse21 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse20 .cse19) 4)))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse17 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_775) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse0 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse0 .cse3 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse8 (store .cse15 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store .cse14 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse5 (+ (select .cse2 .cse4) 1)) (.cse6 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse9 (store (store (store (store .cse2 .cse4 .cse5) .cse6 v_subst_7) .cse3 v_ArrVal_790) .cse1 (+ v_subst_4 1)))) (let ((.cse10 (store (select (store (store .cse8 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse0 .cse1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse2 .cse3 v_ArrVal_786) .cse4 .cse5) .cse6 v_subst_7) .cse1)) (= (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| .cse9) |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (select .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)))) 0) (not (= (select (select (store (store .cse8 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0))))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse35 (store .cse20 .cse21 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse35 .cse18 v_ArrVal_775) .cse19 (+ (select .cse35 .cse19) 1)))))) (let ((.cse32 (store (store .cse33 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779))) (let ((.cse22 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse31 (store (store .cse22 .cse3 v_ArrVal_782) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse23 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse30 (store (select (store .cse32 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse27 (select (store (store .cse23 |c_~#queue~0.base| .cse31) |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse28 (+ (select .cse27 .cse4) 1)) (.cse29 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|))) (let ((.cse26 (store (store (store (store .cse27 .cse4 .cse28) .cse29 v_subst_6) .cse3 v_ArrVal_790) .cse1 (+ v_subst_5 1)))) (let ((.cse24 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse1)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (not (= (let ((.cse25 (select (store (store .cse23 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse25 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select (store (store (store .cse27 .cse3 v_ArrVal_786) .cse4 .cse28) .cse29 v_subst_6) .cse1)))))))))))))))) is different from false [2024-04-05 21:45:11,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#stored_elements~0.offset| 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse6 (let ((.cse14 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store .cse16 .cse17 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse15 .cse1 v_ArrVal_775) .cse5 (+ (select .cse15 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse6 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)))) (let ((.cse11 (store (store (store (store .cse0 .cse2 .cse3) .cse4 v_subst_6) .cse1 v_ArrVal_790) .cse5 (+ v_subst_5 1)))) (let ((.cse8 (store (select (store (store .cse7 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3) .cse4 v_subst_6) .cse5)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse6 .cse5)) (not (= (select (select (store (store .cse7 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9) 1)) (not (= (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (select .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)))) 0))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse22 (let ((.cse28 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse29 (store .cse16 .cse17 |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse29 .cse1 v_ArrVal_775) .cse5 (+ (select .cse29 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse5) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse27 (store (store .cse22 .cse1 v_ArrVal_782) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse26 (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse9 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse23 (select (store (store .cse19 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (let ((.cse24 (+ (select .cse23 .cse2) 1)) (.cse25 (+ |c_~#queue~0.offset| (* (select .cse23 .cse5) 4)))) (let ((.cse20 (store (store (store (store .cse23 .cse2 .cse24) .cse25 v_subst_7) .cse1 v_ArrVal_790) .cse5 (+ v_subst_4 1)))) (let ((.cse21 (store (select (store (store .cse19 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| .cse20) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (not (= 0 (select (select (store (store .cse19 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse9))) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse22 .cse5)) (= 400 (select (store (store (store .cse23 .cse1 v_ArrVal_786) .cse2 .cse24) .cse25 v_subst_7) .cse5)))))))))))))) is different from false [2024-04-05 21:45:13,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_ArrVal_773 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse5 (let ((.cse15 (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse6)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse16 .cse8 v_ArrVal_775) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse6))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse5 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse1) 1)) (.cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse6))))) (let ((.cse3 (store (store (store (store .cse7 .cse1 .cse9) .cse10 v_subst_7) .cse8 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse1 .cse9) .cse10 v_subst_7) .cse6)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse21 (let ((.cse29 (select (store (store (store .cse28 |c_~#queue~0.base| (let ((.cse30 (let ((.cse31 (select .cse28 |c_~#queue~0.base|))) (store .cse31 (+ (* 4 (select .cse31 .cse6)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse30 .cse8 v_ArrVal_775) .cse6 (+ (select .cse30 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* 4 (select .cse29 .cse6))) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse27 (store (store .cse21 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse28 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse26 (store (select (store (store (store .cse28 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse18 (select (store (store .cse22 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (let ((.cse19 (+ (select .cse18 .cse1) 1)) (.cse20 (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse6))))) (let ((.cse25 (store (store (store (store .cse18 .cse1 .cse19) .cse20 v_subst_6) .cse8 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse23 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (= 400 (select (store (store (store .cse18 .cse8 v_ArrVal_786) .cse1 .cse19) .cse20 v_subst_6) .cse6)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse21 .cse6)) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)) (not (= 0 (let ((.cse24 (select (store (store .cse22 |c_~#queue~0.base| .cse25) |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (select .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|))))))))))))))))) is different from false [2024-04-05 21:45:18,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse19 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse3 (let ((.cse15 (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse4))) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse16 .cse6 v_ArrVal_775) .cse4 (+ (select .cse16 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse3 .cse6 v_ArrVal_782) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse0 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse5 (select (store (store .cse0 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse8 (+ (select .cse5 .cse7) 1)) (.cse9 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse11 (store (store (store (store .cse5 .cse7 .cse8) .cse9 v_subst_6) .cse6 v_ArrVal_790) .cse4 (+ v_subst_5 1)))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 1)) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse3 .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= 400 (select (store (store (store .cse5 .cse6 v_ArrVal_786) .cse7 .cse8) .cse9 v_subst_6) .cse4)) (not (= (let ((.cse10 (select (store (store .cse0 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (select .cse10 (+ (* (select .cse10 .cse7) 4) |c_~#queue~0.offset|))) 0)))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_ArrVal_773 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse20 (let ((.cse31 (select (store (store (store .cse30 |c_~#queue~0.base| (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* 4 (select .cse33 .cse4))) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse32 .cse6 v_ArrVal_775) .cse4 (+ (select .cse32 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse4) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse29 (store (store .cse20 .cse6 v_ArrVal_782) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse22 (store .cse30 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse28 (store (select (store (store (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (select (store (store .cse22 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse7) 1)) (.cse27 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse23 (store (store (store (store .cse25 .cse7 .cse26) .cse27 v_subst_7) .cse6 v_ArrVal_790) .cse4 (+ v_subst_4 1)))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|))) 0) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 (select (store (store (store .cse25 .cse6 v_ArrVal_786) .cse7 .cse26) .cse27 v_subst_7) .cse4)))))))))))))) is different from false [2024-04-05 21:45:19,472 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse18 (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0)) (.cse19 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse5 (let ((.cse15 (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse16 .cse8 v_ArrVal_775) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse13 (store (store .cse5 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse2 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse12 (store (select (store (store (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| .cse13) |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (let ((.cse9 (+ (select .cse7 .cse1) 1)) (.cse10 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse3 (store (store (store (store .cse7 .cse1 .cse9) .cse10 v_subst_6) .cse8 v_ArrVal_790) .cse6 (+ v_subst_5 1)))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_3))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse5 .cse6)) (= 400 (select (store (store (store .cse7 .cse8 v_ArrVal_786) .cse1 .cse9) .cse10 v_subst_6) .cse6)) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 1)))))))))))) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_subst_4 Int) (v_ArrVal_773 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_775 Int) (v_ArrVal_786 Int) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_782 Int) (v_subst_7 Int) (v_ArrVal_790 Int) (|v_t1Thread1of1ForFork1_~i~0#1_48| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|t1Thread1of1ForFork1_~value~0#1| Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse18 .cse19 v_ArrVal_772)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_773))) (let ((.cse20 (let ((.cse31 (select (store (store (store .cse30 |c_~#queue~0.base| (let ((.cse32 (let ((.cse33 (select .cse30 |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (store (store .cse32 .cse8 v_ArrVal_775) .cse6 (+ (select .cse32 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse6) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_~value~0#1|)))) (let ((.cse29 (store (store .cse20 .cse8 v_ArrVal_782) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1)))) (let ((.cse21 (store .cse30 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779)) (.cse28 (store (select (store (store (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_778) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_779) |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base|) .cse11 |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse25 (select (store (store .cse21 |c_~#queue~0.base| .cse29) |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse26 (+ (select .cse25 .cse1) 1)) (.cse27 (+ (* (select .cse25 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse24 (store (store (store (store .cse25 .cse1 .cse26) .cse27 v_subst_7) .cse8 v_ArrVal_790) .cse6 (+ v_subst_4 1)))) (let ((.cse22 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_48| 4) |c_~#stored_elements~0.offset| 4) v_subst_2))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_48| 1) (< |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| (select .cse20 .cse6)) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_795) |c_~#stored_elements~0.base|) .cse11) 0)) (= (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|))) 0) (= 400 (select (store (store (store .cse25 .cse8 v_ArrVal_786) .cse1 .cse26) .cse27 v_subst_7) .cse6)))))))))))))) is different from false [2024-04-05 21:45:19,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:45:19,704 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 3 case distinctions, treesize of input 16561 treesize of output 7691 [2024-04-05 21:45:19,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:45:19,952 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 79589 treesize of output 77985 [2024-04-05 21:45:21,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 21:45:21,745 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 1019406146 treesize of output 883889260 Received shutdown request... [2024-04-05 21:54:55,786 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 21:54:55,786 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-04-05 21:54:55,786 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 21:54:55,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-04-05 21:54:55,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 21:54:56,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:54:56,001 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-4-2-4-3-4-4-4-4-8-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. [2024-04-05 21:54:56,003 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-05 21:54:56,003 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-04-05 21:54:56,003 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-04-05 21:54:56,005 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-05 21:54:56,005 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-05 21:54:56,005 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-05 21:54:56,008 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 21:54:56,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 21:54:56,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 21:54:56,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 09:54:56 BasicIcfg [2024-04-05 21:54:56,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 21:54:56,016 INFO L158 Benchmark]: Toolchain (without parser) took 837682.12ms. Allocated memory was 346.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 275.7MB in the beginning and 1.0GB in the end (delta: -772.7MB). Peak memory consumption was 878.9MB. Max. memory is 8.0GB. [2024-04-05 21:54:56,016 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 21:54:56,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.06ms. Allocated memory is still 346.0MB. Free memory was 275.2MB in the beginning and 244.3MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-04-05 21:54:56,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.03ms. Allocated memory is still 346.0MB. Free memory was 244.3MB in the beginning and 241.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 21:54:56,017 INFO L158 Benchmark]: Boogie Preprocessor took 48.04ms. Allocated memory is still 346.0MB. Free memory was 241.2MB in the beginning and 239.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 21:54:56,017 INFO L158 Benchmark]: RCFGBuilder took 645.16ms. Allocated memory is still 346.0MB. Free memory was 239.1MB in the beginning and 212.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-04-05 21:54:56,017 INFO L158 Benchmark]: TraceAbstraction took 836441.29ms. Allocated memory was 346.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 211.8MB in the beginning and 1.0GB in the end (delta: -836.5MB). Peak memory consumption was 815.0MB. Max. memory is 8.0GB. [2024-04-05 21:54:56,018 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.09ms. Allocated memory is still 182.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 476.06ms. Allocated memory is still 346.0MB. Free memory was 275.2MB in the beginning and 244.3MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.03ms. Allocated memory is still 346.0MB. Free memory was 244.3MB in the beginning and 241.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.04ms. Allocated memory is still 346.0MB. Free memory was 241.2MB in the beginning and 239.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 645.16ms. Allocated memory is still 346.0MB. Free memory was 239.1MB in the beginning and 212.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 836441.29ms. Allocated memory was 346.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 211.8MB in the beginning and 1.0GB in the end (delta: -836.5MB). Peak memory consumption was 815.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8005, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 1561, dependent conditional: 1553, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 6380, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 2004, independent unconditional: 4440, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 340, independent: 340, independent conditional: 10, independent unconditional: 330, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 340, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6444, independent: 6104, independent conditional: 694, independent unconditional: 5410, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 340, unknown conditional: 10, unknown unconditional: 330] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 10, Positive unconditional cache size: 330, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1300, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 2004, independent unconditional: 4440, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6444, independent: 6444, independent conditional: 704, independent unconditional: 5740, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 340, independent: 340, independent conditional: 10, independent unconditional: 330, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 340, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6444, independent: 6104, independent conditional: 694, independent unconditional: 5410, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 340, unknown conditional: 10, unknown unconditional: 330] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 10, Positive unconditional cache size: 330, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1300 ], Independence queries for same thread: 1561 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-4-2-4-3-4-4-4-4-8-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-4-2-4-3-4-4-4-4-8-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-4-2-4-3-4-4-4-4-8-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-4-2-4-3-4-4-4-4-8-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 293 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-25-2-2-2-2-2-2-2-2-3-3-3-3-2-3-4-4-4-4-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-4-4-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-4-2-4-3-4-4-4-4-8-4-9-4-9-4-9-4-7-3-5-3-5-3-3-3-3-3-3-3-3-2-3-3-3-2-3-4-4-2-3-4-4-2-3-4-4-2-2-2-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 433 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 836.3s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 35.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 341, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 68.9s InterpolantComputationTime, 2430 NumberOfCodeBlocks, 2430 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2987 ConstructedInterpolants, 424 QuantifiedInterpolants, 130952 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1273 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 147/408 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown