./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_ok_longer.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 08:39:10,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 08:39:10,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-11 08:39:10,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 08:39:10,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 08:39:10,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 08:39:10,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 08:39:10,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 08:39:10,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 08:39:10,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 08:39:10,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 08:39:10,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 08:39:10,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 08:39:10,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 08:39:10,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 08:39:10,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 08:39:10,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 08:39:10,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 08:39:10,554 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-11 08:39:10,555 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-11 08:39:10,555 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-11 08:39:10,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 08:39:10,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 08:39:10,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 08:39:10,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 08:39:10,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 08:39:10,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 08:39:10,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 08:39:10,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 08:39:10,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 08:39:10,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 08:39:10,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 08:39:10,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 08:39:10,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 08:39:10,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 08:39:10,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 08:39:10,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 08:39:10,566 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 08:39:10,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 08:39:10,567 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 08:39:10,567 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 08:39:10,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2024-11-11 08:39:10,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 08:39:10,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 08:39:10,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 08:39:10,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 08:39:10,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 08:39:10,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-11 08:39:12,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 08:39:12,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 08:39:12,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-11 08:39:12,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8ea11cc9f/433d30205c0541adbd40d7a8a2d324a5/FLAG4e970eecb [2024-11-11 08:39:12,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8ea11cc9f/433d30205c0541adbd40d7a8a2d324a5 [2024-11-11 08:39:12,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 08:39:12,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 08:39:12,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 08:39:12,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 08:39:12,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 08:39:12,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:12" (1/1) ... [2024-11-11 08:39:12,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a69846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:12, skipping insertion in model container [2024-11-11 08:39:12,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:12" (1/1) ... [2024-11-11 08:39:12,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 08:39:13,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 08:39:13,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 08:39:13,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 08:39:13,378 INFO L204 MainTranslator]: Completed translation [2024-11-11 08:39:13,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13 WrapperNode [2024-11-11 08:39:13,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 08:39:13,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 08:39:13,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 08:39:13,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 08:39:13,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,516 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1001 [2024-11-11 08:39:13,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 08:39:13,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 08:39:13,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 08:39:13,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 08:39:13,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 08:39:13,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 08:39:13,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 08:39:13,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 08:39:13,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (1/1) ... [2024-11-11 08:39:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 08:39:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:13,652 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-11-11 08:39:13,656 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-11-11 08:39:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-11 08:39:13,700 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-11 08:39:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-11 08:39:13,701 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-11 08:39:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 08:39:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 08:39:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 08:39:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 08:39:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 08:39:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 08:39:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 08:39:13,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 08:39:13,704 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 08:39:13,882 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 08:39:13,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 08:39:15,196 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 08:39:15,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 08:39:21,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 08:39:21,577 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 08:39:21,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:21 BoogieIcfgContainer [2024-11-11 08:39:21,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 08:39:21,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 08:39:21,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 08:39:21,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 08:39:21,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:39:12" (1/3) ... [2024-11-11 08:39:21,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e4b9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:21, skipping insertion in model container [2024-11-11 08:39:21,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:13" (2/3) ... [2024-11-11 08:39:21,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e4b9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:21, skipping insertion in model container [2024-11-11 08:39:21,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:21" (3/3) ... [2024-11-11 08:39:21,588 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-11 08:39:21,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 08:39:21,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-11 08:39:21,607 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 08:39:21,720 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-11 08:39:21,784 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:39:21,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 08:39:21,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:21,787 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-11-11 08:39:21,789 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-11-11 08:39:21,827 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 08:39:21,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-11 08:39:21,851 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@dd417c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:39:21,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-11 08:39:22,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:22,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2092110921, now seen corresponding path program 1 times [2024-11-11 08:39:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931627779] [2024-11-11 08:39:22,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931627779] [2024-11-11 08:39:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931627779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:22,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:39:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11445745] [2024-11-11 08:39:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:39:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:39:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:39:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:22,927 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:22,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-11 08:39:22,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 08:39:23,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2092110920, now seen corresponding path program 1 times [2024-11-11 08:39:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:23,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885067695] [2024-11-11 08:39:23,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885067695] [2024-11-11 08:39:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885067695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 08:39:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632634709] [2024-11-11 08:39:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 08:39:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 08:39:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 08:39:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:25,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11-11 08:39:25,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:25,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:27,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 08:39:27,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:27,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953541, now seen corresponding path program 1 times [2024-11-11 08:39:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597836726] [2024-11-11 08:39:27,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597836726] [2024-11-11 08:39:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597836726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 08:39:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207137561] [2024-11-11 08:39:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:39:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:39:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:39:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:28,110 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:28,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-11-11 08:39:28,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:28,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:28,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:29,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 08:39:29,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953542, now seen corresponding path program 1 times [2024-11-11 08:39:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063279644] [2024-11-11 08:39:29,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063279644] [2024-11-11 08:39:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063279644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:29,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:39:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253611496] [2024-11-11 08:39:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:29,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 08:39:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 08:39:29,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 08:39:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:29,776 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:29,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-11 08:39:29,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:29,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:30,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 08:39:30,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -675303991, now seen corresponding path program 1 times [2024-11-11 08:39:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255532239] [2024-11-11 08:39:30,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255532239] [2024-11-11 08:39:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255532239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 08:39:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654664120] [2024-11-11 08:39:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:31,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 08:39:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:31,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 08:39:31,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-11 08:39:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:31,312 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:31,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:39:31,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:31,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:31,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:31,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:31,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:31,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 08:39:31,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:31,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1787894202, now seen corresponding path program 1 times [2024-11-11 08:39:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20733973] [2024-11-11 08:39:31,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:34,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:34,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20733973] [2024-11-11 08:39:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20733973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:39:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829644176] [2024-11-11 08:39:34,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:34,393 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-11-11 08:39:34,395 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-11-11 08:39:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:34,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-11 08:39:34,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:39:34,834 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-11-11 08:39:34,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 08:39:35,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:35,137 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-11-11 08:39:35,175 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-11-11 08:39:35,280 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-11-11 08:39:35,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:35,323 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-11-11 08:39:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:35,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:39:35,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_115 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_115 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2024-11-11 08:39:35,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse4) 4)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-11 08:39:35,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_110))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_110))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:39:35,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_110))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_110))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-11-11 08:39:37,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_110))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_110))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|)))))))) is different from false [2024-11-11 08:39:47,271 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-11 08:39:47,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 274 treesize of output 393 [2024-11-11 08:39:47,319 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-11 08:39:47,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 178 [2024-11-11 08:39:47,333 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 11 treesize of output 7 [2024-11-11 08:39:47,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:39:47,354 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 135 treesize of output 133 [2024-11-11 08:39:47,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-11 08:39:47,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-11 08:39:47,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:39:47,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 190 [2024-11-11 08:39:47,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:39:47,853 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 79 treesize of output 71 [2024-11-11 08:39:47,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:47,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:47,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:47,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:47,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:47,926 INFO L349 Elim1Store]: treesize reduction 62, result has 53.0 percent of original size [2024-11-11 08:39:47,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 106 [2024-11-11 08:39:47,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:47,936 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 64 treesize of output 44 [2024-11-11 08:39:47,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:47,942 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 44 treesize of output 30 [2024-11-11 08:39:47,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-11 08:39:47,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:47,956 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 23 treesize of output 15 [2024-11-11 08:39:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-11 08:39:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829644176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:39:48,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:39:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 32 [2024-11-11 08:39:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351438752] [2024-11-11 08:39:48,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:39:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 08:39:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:48,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 08:39:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=20, NotChecked=290, Total=1122 [2024-11-11 08:39:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:48,028 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:48,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 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-11-11 08:39:48,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:48,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:48,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:48,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:48,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:48,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:39:49,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 08:39:49,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 08:39:49,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:49,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1803909688, now seen corresponding path program 1 times [2024-11-11 08:39:49,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:49,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662730610] [2024-11-11 08:39:49,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662730610] [2024-11-11 08:39:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662730610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:39:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044108391] [2024-11-11 08:39:50,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:50,226 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-11-11 08:39:50,227 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-11-11 08:39:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:50,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 08:39:50,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:39:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:50,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:39:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:39:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044108391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:39:50,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:39:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-11 08:39:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071442271] [2024-11-11 08:39:50,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:39:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 08:39:50,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 08:39:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-11 08:39:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:50,987 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:50,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:39:50,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:39:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:52,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 08:39:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:52,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2058886228, now seen corresponding path program 1 times [2024-11-11 08:39:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903666956] [2024-11-11 08:39:52,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 08:39:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903666956] [2024-11-11 08:39:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903666956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:39:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31029571] [2024-11-11 08:39:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:53,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:39:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:39:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:39:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:53,322 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-11 08:39:53,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:53,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:53,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:53,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:53,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:53,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:39:53,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:53,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:53,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 08:39:53,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:53,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1397083615, now seen corresponding path program 1 times [2024-11-11 08:39:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552444923] [2024-11-11 08:39:53,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:53,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 08:39:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552444923] [2024-11-11 08:39:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552444923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:39:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769802362] [2024-11-11 08:39:54,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:54,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:54,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:54,484 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-11-11 08:39:54,486 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-11-11 08:39:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:54,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 08:39:54,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:39:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 08:39:55,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:39:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 08:39:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769802362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:39:55,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:39:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-11 08:39:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145542734] [2024-11-11 08:39:55,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:39:55,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 08:39:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 08:39:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-11 08:39:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:55,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:55,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-11-11 08:39:55,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:55,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:55,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:55,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:55,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:55,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:39:55,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:55,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:55,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:55,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:39:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:55,757 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-11-11 08:39:55,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:55,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:55,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash 521415271, now seen corresponding path program 1 times [2024-11-11 08:39:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046745197] [2024-11-11 08:39:55,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 08:39:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046745197] [2024-11-11 08:39:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046745197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:39:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543861740] [2024-11-11 08:39:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:57,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:57,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:57,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:39:57,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 08:39:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:57,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 2163 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-11 08:39:57,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:39:57,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:39:57,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:57,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-11 08:39:58,050 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-11 08:39:58,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-11 08:39:58,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 08:39:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 08:39:58,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:39:58,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52| Int) (v_ArrVal_403 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_402) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)) v_ArrVal_403) .cse1)))))) is different from false [2024-11-11 08:39:58,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:39:58,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2024-11-11 08:39:58,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:39:58,251 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 78 treesize of output 80 [2024-11-11 08:39:58,257 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 61 treesize of output 53 [2024-11-11 08:39:58,269 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-11-11 08:39:58,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:39:58,309 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 48 treesize of output 44 [2024-11-11 08:39:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2024-11-11 08:39:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543861740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:39:58,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:39:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2024-11-11 08:39:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745304156] [2024-11-11 08:39:58,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:39:58,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 08:39:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 08:39:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2024-11-11 08:39:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:58,394 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:58,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:39:58,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:58,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:58,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:39:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:58,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:59,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 08:39:59,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 08:39:59,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:59,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2113247976, now seen corresponding path program 2 times [2024-11-11 08:39:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535686120] [2024-11-11 08:39:59,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 08:40:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535686120] [2024-11-11 08:40:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535686120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537358196] [2024-11-11 08:40:02,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:40:02,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:02,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:02,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:40:02,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 08:40:03,146 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 08:40:03,146 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:40:03,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-11 08:40:03,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:40:03,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 08:40:03,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:03,408 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-11 08:40:03,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-11 08:40:03,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:03,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 08:40:03,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-11 08:40:03,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:03,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-11 08:40:03,668 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:03,678 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-11 08:40:03,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-11 08:40:03,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:03,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 08:40:03,707 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 9 treesize of output 3 [2024-11-11 08:40:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 08:40:03,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:03,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) is different from false [2024-11-11 08:40:04,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) is different from false [2024-11-11 08:40:04,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_494 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_494)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) is different from false [2024-11-11 08:40:04,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_494 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_494))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)))) is different from false [2024-11-11 08:40:04,802 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-11 08:40:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 374 treesize of output 409 [2024-11-11 08:40:04,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:04,867 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 295 treesize of output 291 [2024-11-11 08:40:04,897 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 61 treesize of output 53 [2024-11-11 08:40:04,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-11 08:40:05,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-11 08:40:05,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:05,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 196 [2024-11-11 08:40:05,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:05,515 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 135 treesize of output 119 [2024-11-11 08:40:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 4 not checked. [2024-11-11 08:40:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537358196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:05,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 39 [2024-11-11 08:40:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418136130] [2024-11-11 08:40:05,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-11 08:40:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-11 08:40:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1011, Unknown=18, NotChecked=284, Total=1560 [2024-11-11 08:40:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:05,626 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:05,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.2) internal successors, (128), 39 states have internal predecessors, (128), 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-11-11 08:40:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:40:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:40:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:40:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:40:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:07,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1)))))))) is different from false [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:40:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:40:07,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 08:40:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:07,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1061413638, now seen corresponding path program 2 times [2024-11-11 08:40:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64002029] [2024-11-11 08:40:07,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64002029] [2024-11-11 08:40:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64002029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254942041] [2024-11-11 08:40:12,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:40:12,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:12,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:12,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:40:12,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 08:40:12,685 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 08:40:12,685 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:40:12,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-11 08:40:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:12,756 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-11-11 08:40:12,792 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-11-11 08:40:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:12,967 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-11-11 08:40:12,994 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-11-11 08:40:13,076 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-11-11 08:40:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:13,124 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-11-11 08:40:13,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:13,219 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-11-11 08:40:13,248 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-11-11 08:40:13,342 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-11-11 08:40:13,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:13,389 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-11-11 08:40:13,495 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-11-11 08:40:13,529 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-11-11 08:40:13,628 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-11-11 08:40:13,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:13,672 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-11-11 08:40:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:13,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:13,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:40:13,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:40:15,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-11 08:40:17,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4))))))) is different from false [2024-11-11 08:40:17,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_585)))) (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))))) is different from false [2024-11-11 08:40:19,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2024-11-11 08:40:23,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_585)))) (store (store .cse10 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse10 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4))))))) is different from false [2024-11-11 08:40:23,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 v_ArrVal_579))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse5 .cse7) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 v_ArrVal_579))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse13 .cse7) 1)))))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_585)))) (store (store .cse11 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:40:23,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse8 .cse7)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse5 .cse7) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse13 .cse7) 1)))))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse11 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-11 08:40:25,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse5 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse7 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))))) is different from false [2024-11-11 08:40:28,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_585)))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse10 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) v_ArrVal_585)))) (store (store .cse7 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4)))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))))) is different from false [2024-11-11 08:40:28,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse10 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse10 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse8 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-11 08:40:28,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ (select .cse7 .cse9) 1))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 .cse10)))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse2 (+ v_subst_4 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse3))) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 .cse10)))) (let ((.cse15 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse14 .cse2 (+ v_subst_3 1)) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse3) 4)) v_ArrVal_585)))) (store (store .cse12 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3))))) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))))))) is different from false [2024-11-11 08:40:31,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (select .cse10 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_574))) (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse7 .cse9) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse6 .cse4 (+ v_subst_3 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_585)))) (store (store .cse3 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4)))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_574))) (store (store .cse17 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse17 .cse9) 1)))))) (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse16 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse16 .cse4 (+ v_subst_4 1)) .cse1 (+ (select .cse16 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse14 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))) is different from false [2024-11-11 08:40:33,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse8 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse7 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse6 .cse4 (+ v_subst_4 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse13 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse12 .cse4 (+ v_subst_3 1)) .cse2 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))) v_ArrVal_585)))) (store (store .cse10 .cse4 (+ v_subst_2 1)) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))))))))))) is different from false [2024-11-11 08:40:36,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse10 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse9 .cse10 v_ArrVal_571)))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse6 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse7 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse2 (+ v_subst_4 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse3)) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))))) (forall ((v_ArrVal_571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse9 .cse10 v_ArrVal_571)))) (let ((.cse17 (select .cse11 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse15 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse16 (store .cse17 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse16 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse16 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse14 .cse2 (+ v_subst_3 1)) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse3) 4)) v_ArrVal_585)))) (store (store .cse12 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3))))) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))) (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))))))) is different from false [2024-11-11 08:40:36,564 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-11 08:40:36,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1279 treesize of output 651 [2024-11-11 08:40:36,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:36,629 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 512 treesize of output 508 [2024-11-11 08:40:36,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:40:36,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-11 08:40:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-11 08:40:36,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:36,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 194 [2024-11-11 08:40:37,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:37,422 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 227 treesize of output 191 [2024-11-11 08:40:37,524 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 14 treesize of output 10 [2024-11-11 08:40:37,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:37,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,594 INFO L349 Elim1Store]: treesize reduction 62, result has 53.0 percent of original size [2024-11-11 08:40:37,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 1106 treesize of output 358 [2024-11-11 08:40:37,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:37,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2024-11-11 08:40:37,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:37,623 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 116 treesize of output 90 [2024-11-11 08:40:37,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:37,633 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 99 treesize of output 79 [2024-11-11 08:40:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 3 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-11 08:40:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254942041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:37,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:37,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 26] total 62 [2024-11-11 08:40:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194828232] [2024-11-11 08:40:37,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:37,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-11 08:40:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:37,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-11 08:40:37,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1880, Unknown=127, NotChecked=1712, Total=4032 [2024-11-11 08:40:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:37,748 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:37,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 63 states have internal predecessors, (147), 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-11-11 08:40:37,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:37,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:40:37,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:40:37,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:45,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse26 (select .cse20 .cse22))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse23 (+ .cse26 1))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse20 .cse22 .cse23))) (.cse5 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 4)) (.cse4 (select |c_#length| |c_~#queue~0.base|)) (.cse21 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse19 (* .cse26 4)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) 4) .cse4)) (<= (+ .cse5 |c_~#queue~0.offset| 4) .cse4) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) .cse4)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse7 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) 4) .cse4)) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse12 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ 1 (select .cse12 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_585)))) (store (store .cse10 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|)))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse13 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse16 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ 1 (select .cse16 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse2) 4)) v_ArrVal_585)))) (store (store .cse14 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse14 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse4))))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse17 (let ((.cse18 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse17 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))) (<= 0 (+ .cse5 |c_~#queue~0.offset|)) (<= 0 (+ .cse19 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse21 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse22 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse4)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse21 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse22 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (<= (+ .cse19 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse24 (let ((.cse25 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) v_ArrVal_585)))) (store (store .cse24 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse24 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4))))))))) is different from false [2024-11-11 08:40:45,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) 4) .cse4)) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) .cse4)) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse8 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ 1 (select .cse8 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_585)))) (store (store .cse6 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|)))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse12 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ 1 (select .cse12 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_585)))) (store (store .cse10 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse4))))) (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)) v_ArrVal_585)))) (store (store .cse13 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))))) is different from false [2024-11-11 08:40:47,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse5 .cse2))) (let ((.cse11 (* .cse6 4))) (let ((.cse10 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ .cse11 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse7 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse10)) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (<= (+ .cse11 |c_~#queue~0.offset| 4) .cse10) (<= 0 .cse12) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse5 .cse12 v_ArrVal_585))) (store (store .cse13 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)) .cse10)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse5 .cse12 v_ArrVal_585))) (store (store .cse14 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse14 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4))))))))) is different from false [2024-11-11 08:40:47,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse8 .cse7))) (let ((.cse14 (* .cse9 4))) (let ((.cse11 (+ .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse13 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse5 .cse7) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (store .cse8 .cse11 v_ArrVal_585))) (store (store .cse10 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse10 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (<= 0 .cse11) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (store .cse8 .cse11 v_ArrVal_585))) (store (store .cse12 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse12 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse13)) (<= (+ .cse14 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse18 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse18 .cse7) 1)))))) (store .cse15 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse16 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse16 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse13))))))))) is different from false [2024-11-11 08:40:47,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4))) (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse3 .cse4 v_ArrVal_579))) (store (store .cse11 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse11 .cse2) 1)))))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse10 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse5) 4)) v_ArrVal_585)))) (store (store .cse8 .cse9 (+ v_subst_1 1)) .cse5 (+ (select .cse8 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) 4) .cse6)) (<= (+ .cse12 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse3 .cse4 v_ArrVal_579))) (store (store .cse16 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse16 .cse2) 1)))))) (store .cse13 |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse5) 4)) v_ArrVal_585)))) (store (store .cse14 .cse9 (+ v_subst_2 1)) .cse5 (+ (select .cse14 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= 0 .cse4) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse17 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))) is different from false [2024-11-11 08:40:47,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) .cse9)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_585)))) (store (store .cse11 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4))))))) is different from false [2024-11-11 08:40:47,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))))) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) .cse5)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)))) is different from false [2024-11-11 08:40:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:40:47,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 08:40:47,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 08:40:47,966 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:47,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -542862263, now seen corresponding path program 3 times [2024-11-11 08:40:47,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:47,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596459589] [2024-11-11 08:40:47,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 08:40:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:49,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596459589] [2024-11-11 08:40:49,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596459589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:49,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032312885] [2024-11-11 08:40:49,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 08:40:49,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:49,143 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:40:49,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 08:40:49,696 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 08:40:49,697 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:40:49,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-11 08:40:49,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 08:40:50,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:50,414 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-11-11 08:40:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 08:40:50,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:50,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:50,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-11 08:40:50,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:50,651 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 50 treesize of output 49 [2024-11-11 08:40:50,673 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 14 treesize of output 10 [2024-11-11 08:40:50,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:50,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-11 08:40:50,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:50,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:50,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-11 08:40:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 08:40:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032312885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:51,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-11 08:40:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158367294] [2024-11-11 08:40:51,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:51,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 08:40:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 08:40:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=314, Unknown=2, NotChecked=0, Total=380 [2024-11-11 08:40:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:51,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:51,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 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-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:40:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:51,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:51,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:40:51,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:40:51,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:40:51,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:40:51,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:40:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:40:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-11 08:40:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:40:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:52,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 08:40:52,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:52,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:52,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash -589502187, now seen corresponding path program 4 times [2024-11-11 08:40:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412741086] [2024-11-11 08:40:52,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 08:40:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412741086] [2024-11-11 08:40:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412741086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394420802] [2024-11-11 08:40:54,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 08:40:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:54,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:54,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:40:54,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 08:40:55,288 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 08:40:55,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:40:55,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 2259 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-11 08:40:55,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:55,986 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-11-11 08:40:56,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:56,046 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-11-11 08:40:56,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:56,180 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-11-11 08:40:56,223 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-11-11 08:40:56,343 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-11-11 08:40:56,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:56,397 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-11-11 08:40:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 08:40:56,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:56,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_818 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:40:56,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_818 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:40:56,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_818 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:40:57,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_814))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_814))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:40:59,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_814))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_814))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse3) 4))))))))) is different from false [2024-11-11 08:40:59,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_812 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_814))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((v_ArrVal_812 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_814))) (store (store .cse5 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-11-11 08:40:59,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:59,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 84 [2024-11-11 08:40:59,682 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-11-11 08:40:59,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 156 [2024-11-11 08:40:59,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:59,712 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 109 treesize of output 105 [2024-11-11 08:40:59,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:40:59,745 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-11-11 08:40:59,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:59,812 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 48 treesize of output 44 [2024-11-11 08:40:59,856 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 11 treesize of output 7 [2024-11-11 08:40:59,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,863 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:59,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,871 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:59,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:59,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2024-11-11 08:40:59,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:59,900 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 3 case distinctions, treesize of input 78 treesize of output 73 [2024-11-11 08:40:59,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,907 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:59,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2024-11-11 08:40:59,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:59,932 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-11 08:40:59,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:59,940 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:41:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 24 proven. 31 refuted. 0 times theorem prover too weak. 70 trivial. 48 not checked. [2024-11-11 08:41:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394420802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:41:00,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:41:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 33 [2024-11-11 08:41:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928336096] [2024-11-11 08:41:00,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:41:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 08:41:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:41:00,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 08:41:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=665, Unknown=25, NotChecked=354, Total=1190 [2024-11-11 08:41:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:41:00,506 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:41:00,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.235294117647059) internal successors, (144), 34 states have internal predecessors, (144), 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-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:41:00,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:41:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:41:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 08:41:03,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-11 08:41:03,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 08:41:03,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:41:03,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:41:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2122362731, now seen corresponding path program 5 times [2024-11-11 08:41:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:41:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781370558] [2024-11-11 08:41:03,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:41:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:41:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:41:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-11 08:41:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:41:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781370558] [2024-11-11 08:41:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781370558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:41:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593738349] [2024-11-11 08:41:10,190 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 08:41:10,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:41:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:41:10,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:41:10,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 08:41:32,997 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-11 08:41:32,997 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:41:33,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-11-11 08:41:33,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:41:33,100 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-11-11 08:41:33,159 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-11-11 08:41:33,422 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-11-11 08:41:33,456 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-11-11 08:41:33,608 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-11-11 08:41:33,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:33,674 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-11-11 08:41:33,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 23 treesize of output 11 [2024-11-11 08:41:33,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 08:41:34,016 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-11-11 08:41:34,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:34,083 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-11-11 08:41:34,236 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-11-11 08:41:34,304 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-11-11 08:41:34,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-11 08:41:34,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:34,458 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-11-11 08:41:34,596 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 08:41:34,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-11 08:41:34,641 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-11-11 08:41:34,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 08:41:34,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:34,815 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-11-11 08:41:34,981 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 08:41:34,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-11 08:41:35,006 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-11-11 08:41:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-11 08:41:35,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:41:35,408 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_992) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|)))) is different from false [2024-11-11 08:41:35,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|))))) is different from false [2024-11-11 08:41:35,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992))))) is different from false [2024-11-11 08:41:35,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992))))) is different from false [2024-11-11 08:41:35,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))) is different from false [2024-11-11 08:41:40,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_986 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_986)))) (let ((.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3) 400)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_992) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))))))) is different from false [2024-11-11 08:41:40,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_986 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_986)))) (let ((.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992) (not (= 400 (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3))) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|)))))))) is different from false [2024-11-11 08:41:40,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (* 4 (select .cse7 .cse1)))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| .cse4) v_ArrVal_983)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_992) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1) 400)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 4 .cse4)) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|))))))))) is different from false [2024-11-11 08:41:41,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (* (select .cse8 .cse1) 4))) (let ((.cse0 (store .cse8 (+ .cse2 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse2 |c_~#queue~0.offset| 4)) (not (= 400 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_992) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))))))))) is different from false [2024-11-11 08:41:41,214 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (* (select .cse8 .cse1) 4))) (let ((.cse0 (store .cse8 (+ .cse2 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse2 |c_~#queue~0.offset| 4)) (not (= 400 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_992) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|))))))))))) is different from false [2024-11-11 08:41:43,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse9 .cse10))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse11 1))))) (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (* (select .cse8 .cse2) 4))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| .cse0) v_ArrVal_983)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| .cse0 4)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_992) (not (= 400 (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_986) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))))))))) (= 400 .cse11)))) is different from false [2024-11-11 08:41:43,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_977)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse10 .cse11))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ .cse0 1))))) (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (* 4 (select .cse9 .cse2)))) (let ((.cse1 (store .cse9 (+ .cse6 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_986) (not (= 400 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (+ (select .cse5 .cse2) 1) v_ArrVal_992) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse6 |c_~#queue~0.offset| 4))))))))))))) is different from false [2024-11-11 08:41:43,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse12 (+ (* (select .cse12 .cse11) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_977)))) (let ((.cse6 (select .cse10 .cse11))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ .cse6 1))))) (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (* (select .cse9 .cse1) 4))) (let ((.cse3 (store .cse9 (+ |c_~#queue~0.offset| .cse5) v_ArrVal_983)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_992) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_986) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 4 .cse5)) (= 400 .cse6))))))))))))) is different from false [2024-11-11 08:41:44,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_977)))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse9 .cse1))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse5 (* (select .cse8 .cse1) 4))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| .cse5) v_ArrVal_983))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (= 400 .cse3) (< (+ (select .cse4 .cse1) 1) v_ArrVal_986) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| .cse5 4)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_992)))))))))))) is different from false [2024-11-11 08:41:45,294 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1)))))) (let ((.cse10 (let ((.cse11 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse10 .cse1))) (let ((.cse9 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse10 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse2 (* (select .cse9 .cse1) 4))) (let ((.cse0 (store .cse9 (+ |c_~#queue~0.offset| .cse2) v_ArrVal_983))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| .cse2 4)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (= 400 .cse4) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1) 400)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_992)))))))))))) is different from false [2024-11-11 08:41:45,402 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1)))))) (let ((.cse10 (let ((.cse11 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse10 .cse1))) (let ((.cse9 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse10 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse2 (* (select .cse9 .cse1) 4))) (let ((.cse0 (store .cse9 (+ |c_~#queue~0.offset| .cse2) v_ArrVal_983))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| .cse2 4)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (= 400 .cse4) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1) 400)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_992))))))))))))) is different from false [2024-11-11 08:41:45,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse13 .cse14))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 (+ .cse0 1))))) (let ((.cse11 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse11 .cse2))) (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse3 (* (select .cse10 .cse2) 4))) (let ((.cse1 (store .cse10 (+ |c_~#queue~0.offset| .cse3) v_ArrVal_983))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| .cse3 4)) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (= 400 .cse5) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (not (= (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2) 400)) (< (+ (select .cse7 .cse2) 1) v_ArrVal_992))))))))))))))) is different from false [2024-11-11 08:41:45,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse14 (select .cse12 .cse13))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| Int) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse13 (+ .cse14 1))))) (let ((.cse10 (let ((.cse11 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_977)))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse2))) (let ((.cse9 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse10 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| 1)) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse4 (* 4 (select .cse9 .cse2)))) (let ((.cse3 (store .cse9 (+ .cse4 |c_~#queue~0.offset|) v_ArrVal_983))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (not (= 400 (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse4 |c_~#queue~0.offset| 4)) (< (+ (select .cse5 .cse2) 1) v_ArrVal_992) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))))))))))) (= 400 .cse14)))) is different from false [2024-11-11 08:41:45,942 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| Int) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_971 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_971)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse13 .cse14))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse0 1))))) (let ((.cse11 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select .cse11 .cse3))) (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse4 (* (select .cse10 .cse3) 4))) (let ((.cse2 (store .cse10 (+ .cse4 |c_~#queue~0.offset|) v_ArrVal_983))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse3 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= 400 .cse0) (= 400 .cse1) (< (+ (select .cse2 .cse3) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse4 |c_~#queue~0.offset| 4)) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (not (= 400 (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_992) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|)))))))))))))) is different from false [2024-11-11 08:41:46,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| Int) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_971 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse13 (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse15 (+ (* (select .cse15 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_971)))) (let ((.cse0 (select .cse13 .cse14))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse0 1))))) (let ((.cse11 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse11 .cse3))) (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| 1)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse1 (* 4 (select .cse10 .cse3)))) (let ((.cse4 (store .cse10 (+ |c_~#queue~0.offset| .cse1) v_ArrVal_983))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse3 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= .cse0 400) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 4 .cse1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (+ 1 (select .cse4 .cse3)) v_ArrVal_986) (not (= (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3) 400)) (< (+ (select .cse6 .cse3) 1) v_ArrVal_992) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (= 400 .cse7))))))))))))))) is different from false [2024-11-11 08:41:57,598 INFO L349 Elim1Store]: treesize reduction 1097, result has 38.6 percent of original size [2024-11-11 08:41:57,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 95160 treesize of output 27035 [2024-11-11 08:41:58,000 INFO L224 Elim1Store]: Index analysis took 126 ms [2024-11-11 08:41:58,093 INFO L349 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2024-11-11 08:41:58,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 4619 treesize of output 4579 [2024-11-11 08:41:58,805 INFO L349 Elim1Store]: treesize reduction 112, result has 22.8 percent of original size [2024-11-11 08:41:58,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 7057 treesize of output 7137 [2024-11-11 08:41:59,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:59,810 INFO L349 Elim1Store]: treesize reduction 122, result has 43.3 percent of original size [2024-11-11 08:41:59,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 5459 treesize of output 6029 [2024-11-11 08:42:00,264 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 469 treesize of output 441 [2024-11-11 08:42:00,458 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 569 treesize of output 537 [2024-11-11 08:42:00,661 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 256 treesize of output 208 [2024-11-11 08:42:00,920 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 694 treesize of output 630 [2024-11-11 08:42:01,669 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 25 treesize of output 17 [2024-11-11 08:42:01,925 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 25 treesize of output 17 [2024-11-11 08:42:02,367 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 25 treesize of output 17 [2024-11-11 08:42:09,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:42:09,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1999 treesize of output 1945 [2024-11-11 08:42:20,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:42:20,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 11421 treesize of output 11189 [2024-11-11 08:42:26,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:42:26,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:48:51,102 WARN L286 SmtUtils]: Spent 6.42m on a formula simplification. DAG size of input: 2722 DAG size of output: 2412 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-11 08:48:51,104 INFO L349 Elim1Store]: treesize reduction 1600, result has 91.3 percent of original size [2024-11-11 08:48:51,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 35 select indices, 35 select index equivalence classes, 5 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 590 case distinctions, treesize of input 10792 treesize of output 26623 Killed by 15