./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 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/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-dev-9a849f6-m [2024-10-26 06:24:14,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 06:24:14,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-10-26 06:24:14,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 06:24:14,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 06:24:14,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 06:24:14,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 06:24:14,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 06:24:14,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 06:24:14,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 06:24:14,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 06:24:14,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 06:24:14,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 06:24:14,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 06:24:14,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 06:24:14,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 06:24:14,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 06:24:14,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 06:24:14,796 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 06:24:14,797 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 06:24:14,797 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 06:24:14,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 06:24:14,800 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 06:24:14,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 06:24:14,800 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 06:24:14,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 06:24:14,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 06:24:14,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 06:24:14,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 06:24:14,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 06:24:14,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 06:24:14,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 06:24:14,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 06:24:14,802 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 06:24:14,803 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 06:24:14,804 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-10-26 06:24:15,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 06:24:15,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 06:24:15,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 06:24:15,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 06:24:15,087 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 06:24:15,088 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-10-26 06:24:16,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 06:24:16,770 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 06:24:16,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-10-26 06:24:16,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b352dde72/6dc25f23f839401689070a95b1a36309/FLAGf82ac6921 [2024-10-26 06:24:17,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b352dde72/6dc25f23f839401689070a95b1a36309 [2024-10-26 06:24:17,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 06:24:17,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 06:24:17,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 06:24:17,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 06:24:17,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 06:24:17,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e398f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17, skipping insertion in model container [2024-10-26 06:24:17,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 06:24:17,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 06:24:17,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 06:24:17,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 06:24:17,713 INFO L204 MainTranslator]: Completed translation [2024-10-26 06:24:17,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17 WrapperNode [2024-10-26 06:24:17,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 06:24:17,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 06:24:17,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 06:24:17,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 06:24:17,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,819 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1001 [2024-10-26 06:24:17,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 06:24:17,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 06:24:17,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 06:24:17,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 06:24:17,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 06:24:17,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 06:24:17,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 06:24:17,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 06:24:17,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (1/1) ... [2024-10-26 06:24:17,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 06:24:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:17,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-26 06:24:17,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-26 06:24:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-26 06:24:17,994 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-26 06:24:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-26 06:24:17,994 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-26 06:24:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 06:24:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 06:24:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 06:24:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 06:24:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 06:24:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 06:24:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 06:24:17,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 06:24:17,996 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 06:24:18,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 06:24:18,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 06:24:19,203 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 06:24:19,204 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 06:24:25,131 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 06:24:25,131 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-26 06:24:25,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:24:25 BoogieIcfgContainer [2024-10-26 06:24:25,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 06:24:25,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 06:24:25,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 06:24:25,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 06:24:25,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 06:24:17" (1/3) ... [2024-10-26 06:24:25,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8ce0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:24:25, skipping insertion in model container [2024-10-26 06:24:25,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:24:17" (2/3) ... [2024-10-26 06:24:25,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8ce0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:24:25, skipping insertion in model container [2024-10-26 06:24:25,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:24:25" (3/3) ... [2024-10-26 06:24:25,138 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-10-26 06:24:25,154 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 06:24:25,155 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-10-26 06:24:25,155 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 06:24:25,239 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 06:24:25,283 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 06:24:25,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 06:24:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:25,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 06:24:25,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-26 06:24:25,325 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 06:24:25,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-10-26 06:24:25,340 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;@60bc3224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 06:24:25,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-26 06:24:25,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:25,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2092110921, now seen corresponding path program 1 times [2024-10-26 06:24:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:25,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075092195] [2024-10-26 06:24:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:26,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:26,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075092195] [2024-10-26 06:24:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075092195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:24:26,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:24:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 06:24:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686703352] [2024-10-26 06:24:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:24:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:24:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:26,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:24:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:24:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:26,261 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:26,262 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-10-26 06:24:26,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:26,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 06:24:26,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:26,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2092110920, now seen corresponding path program 1 times [2024-10-26 06:24:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490937689] [2024-10-26 06:24:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:28,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490937689] [2024-10-26 06:24:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490937689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:24:28,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:24:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 06:24:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351875527] [2024-10-26 06:24:28,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:24:28,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-26 06:24:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-26 06:24:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-26 06:24:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:28,793 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:28,793 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-10-26 06:24:28,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:28,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 06:24:30,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953541, now seen corresponding path program 1 times [2024-10-26 06:24:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026584964] [2024-10-26 06:24:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026584964] [2024-10-26 06:24:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026584964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:24:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:24:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-26 06:24:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692216530] [2024-10-26 06:24:30,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:24:30,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:24:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:24:30,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:24:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:30,954 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:30,954 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-10-26 06:24:30,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:30,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:30,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:32,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-26 06:24:32,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:32,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953542, now seen corresponding path program 1 times [2024-10-26 06:24:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038558243] [2024-10-26 06:24:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:32,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:32,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038558243] [2024-10-26 06:24:32,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038558243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:24:32,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:24:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 06:24:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079116288] [2024-10-26 06:24:32,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:24:32,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 06:24:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:32,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 06:24:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-26 06:24:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:32,546 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:32,546 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-10-26 06:24:32,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:32,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:32,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:32,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-26 06:24:32,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:32,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash -675303991, now seen corresponding path program 1 times [2024-10-26 06:24:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:32,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031117457] [2024-10-26 06:24:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:33,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031117457] [2024-10-26 06:24:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031117457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:24:33,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:24:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-26 06:24:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098456047] [2024-10-26 06:24:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:24:33,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-26 06:24:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:33,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-26 06:24:33,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-26 06:24:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:33,939 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:33,939 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-10-26 06:24:33,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:33,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:33,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:33,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:33,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:34,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 06:24:34,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:34,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1787894202, now seen corresponding path program 1 times [2024-10-26 06:24:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844580343] [2024-10-26 06:24:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844580343] [2024-10-26 06:24:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844580343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:24:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382362478] [2024-10-26 06:24:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:24:36,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:36,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:24:36,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 06:24:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:37,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-26 06:24:37,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:24:37,309 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-10-26 06:24:37,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:24:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:37,623 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-10-26 06:24:37,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:24:37,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-26 06:24:37,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:37,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:24:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:37,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:24:37,973 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-10-26 06:24:38,157 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-10-26 06:24:38,191 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-10-26 06:24:38,229 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-10-26 06:24:40,281 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-10-26 06:24:45,941 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-10-26 06:24:45,942 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-10-26 06:24:45,992 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-10-26 06:24:45,993 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-10-26 06:24:46,011 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-10-26 06:24:46,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:24:46,033 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-10-26 06:24:46,097 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-10-26 06:24:46,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-26 06:24:46,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:24:46,286 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-10-26 06:24:46,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:24:46,593 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-10-26 06:24:46,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:46,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:46,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:24:46,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:46,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:46,786 INFO L349 Elim1Store]: treesize reduction 62, result has 53.0 percent of original size [2024-10-26 06:24:46,787 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-10-26 06:24:46,796 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:24:46,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:46,800 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-10-26 06:24:46,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:24:46,812 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-10-26 06:24:46,817 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-10-26 06:24:46,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:24:46,826 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-10-26 06:24:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-26 06:24:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382362478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:24:46,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:24:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 32 [2024-10-26 06:24:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816841478] [2024-10-26 06:24:46,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:24:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-26 06:24:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-26 06:24:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=688, Unknown=21, NotChecked=290, Total=1122 [2024-10-26 06:24:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:46,892 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:46,892 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-10-26 06:24:46,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:46,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:46,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:46,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:46,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:46,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:24:48,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 06:24:48,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-26 06:24:48,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1803909688, now seen corresponding path program 1 times [2024-10-26 06:24:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839433243] [2024-10-26 06:24:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:48,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839433243] [2024-10-26 06:24:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839433243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:24:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848241046] [2024-10-26 06:24:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:48,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:24:48,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:48,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:24:48,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 06:24:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:49,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-26 06:24:49,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:24:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:49,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:24:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:24:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848241046] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:24:49,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:24:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-10-26 06:24:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563844207] [2024-10-26 06:24:49,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:24:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-26 06:24:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:49,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-26 06:24:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-26 06:24:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:49,651 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:49,651 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-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:24:49,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:24:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:51,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-26 06:24:51,564 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-10-26 06:24:51,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2058886228, now seen corresponding path program 1 times [2024-10-26 06:24:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220551494] [2024-10-26 06:24:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-26 06:24:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220551494] [2024-10-26 06:24:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220551494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:24:51,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:24:51,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:24:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001329404] [2024-10-26 06:24:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:24:51,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:24:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:24:51,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:24:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:51,969 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:51,969 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-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:51,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:24:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 06:24:52,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:52,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1397083615, now seen corresponding path program 1 times [2024-10-26 06:24:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188899477] [2024-10-26 06:24:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-26 06:24:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188899477] [2024-10-26 06:24:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188899477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:24:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323835521] [2024-10-26 06:24:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:53,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:24:53,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:53,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:24:53,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-26 06:24:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:53,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 06:24:53,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:24:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-26 06:24:54,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:24:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-26 06:24:54,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323835521] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:24:54,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:24:54,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-10-26 06:24:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980132575] [2024-10-26 06:24:54,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:24:54,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-26 06:24:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-26 06:24:54,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-26 06:24:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:54,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:54,364 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-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:54,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:24:54,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-26 06:24:54,793 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-10-26 06:24:54,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:54,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 521415271, now seen corresponding path program 1 times [2024-10-26 06:24:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:54,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887549203] [2024-10-26 06:24:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-26 06:24:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887549203] [2024-10-26 06:24:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887549203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:24:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309822075] [2024-10-26 06:24:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:24:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:55,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:24:55,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-26 06:24:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:56,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 2163 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-26 06:24:56,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:24:56,173 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-10-26 06:24:56,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:24:56,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-26 06:24:56,237 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-26 06:24:56,238 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-10-26 06:24:56,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-26 06:24:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-26 06:24:56,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:24:56,369 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-10-26 06:24:56,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:24:56,381 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-10-26 06:24:56,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:24:56,389 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-10-26 06:24:56,393 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-10-26 06:24:56,407 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-10-26 06:24:56,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:24:56,449 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-10-26 06:24:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2024-10-26 06:24:56,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309822075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:24:56,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:24:56,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2024-10-26 06:24:56,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071918109] [2024-10-26 06:24:56,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:24:56,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-26 06:24:56,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:24:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-26 06:24:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2024-10-26 06:24:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:56,519 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:24:56,520 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-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:24:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:24:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:24:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:24:57,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 06:24:57,745 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-10-26 06:24:57,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:24:57,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:24:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2113247976, now seen corresponding path program 2 times [2024-10-26 06:24:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:24:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175424189] [2024-10-26 06:24:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:24:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:24:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:24:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 06:24:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:24:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175424189] [2024-10-26 06:24:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175424189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:24:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435894778] [2024-10-26 06:24:59,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 06:24:59,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:24:59,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:24:59,569 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:24:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-26 06:25:00,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 06:25:00,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:25:00,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-26 06:25:00,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:25:00,071 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-10-26 06:25:00,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-26 06:25:00,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:25:00,205 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-10-26 06:25:00,205 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-10-26 06:25:00,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:00,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 29 treesize of output 13 [2024-10-26 06:25:00,281 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-10-26 06:25:00,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:00,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-26 06:25:00,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:25:00,394 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-10-26 06:25:00,394 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-10-26 06:25:00,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:00,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-26 06:25:00,418 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-10-26 06:25:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-26 06:25:00,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:25:00,757 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-10-26 06:25:00,786 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-10-26 06:25:00,805 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-10-26 06:25:02,229 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-10-26 06:25:02,230 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-10-26 06:25:02,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:25:02,267 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-10-26 06:25:02,283 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-10-26 06:25:02,339 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-10-26 06:25:02,379 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-10-26 06:25:02,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:25:02,472 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-10-26 06:25:02,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:25:02,798 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-10-26 06:25:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 4 not checked. [2024-10-26 06:25:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435894778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:25:02,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:25:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 39 [2024-10-26 06:25:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965899795] [2024-10-26 06:25:02,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:25:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-26 06:25:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:25:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-26 06:25:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1079, Unknown=15, NotChecked=216, Total=1560 [2024-10-26 06:25:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:25:02,863 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:25:02,863 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-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:25:02,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:25:02,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:25:02,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:25:02,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:25:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:25:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:25:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:25:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:25:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:25:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:25:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:25:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:25:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:25:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:25:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 06:25:04,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-26 06:25:04,683 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-10-26 06:25:04,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:25:04,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:25:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1061413638, now seen corresponding path program 2 times [2024-10-26 06:25:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:25:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143169109] [2024-10-26 06:25:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:25:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:25:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:25:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:25:07,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:25:07,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143169109] [2024-10-26 06:25:07,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143169109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:25:07,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324810148] [2024-10-26 06:25:07,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 06:25:07,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:25:07,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:25:07,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:25:07,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-26 06:25:08,208 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 06:25:08,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:25:08,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-10-26 06:25:08,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:25:08,274 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-10-26 06:25:08,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:25:08,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:08,475 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-10-26 06:25:08,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:25:08,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-26 06:25:08,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:08,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:25:08,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:08,702 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-10-26 06:25:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:25:08,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-26 06:25:08,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:08,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:25:08,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:25:08,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:25:09,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 19 treesize of output 11 [2024-10-26 06:25:09,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:25:09,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:25:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:25:09,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:25:09,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (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|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (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|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2024-10-26 06:25:09,339 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-10-26 06:25:09,349 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-10-26 06:25:09,816 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_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) (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 (+ (* (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|))))) is different from false [2024-10-26 06:25:38,529 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-10-26 06:25:38,564 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-10-26 06:25:38,585 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 ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 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-10-26 06:25:38,637 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-10-26 06:25:38,692 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-10-26 06:25:38,731 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-10-26 06:26:00,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse0 (select (store |c_#memory_int| |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_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_585)))) (store (store .cse2 .cse3 (+ v_subst_2 1)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse6 .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 |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ 1 (select .cse9 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_585)))) (store (store .cse7 .cse3 (+ v_subst_1 1)) .cse1 (+ (select .cse7 .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|)))))))) is different from false [2024-10-26 06:26:00,782 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-10-26 06:26:00,825 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-10-26 06:26:29,832 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-10-26 06:26:32,288 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-10-26 06:26:32,493 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-10-26 06:26:32,493 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-10-26 06:26:32,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:26:32,538 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-10-26 06:26:32,558 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-10-26 06:26:32,584 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-10-26 06:26:32,658 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-10-26 06:26:32,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:26:32,810 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-10-26 06:26:33,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:26:33,333 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-10-26 06:26:33,417 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-10-26 06:26:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:33,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:33,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:26:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:33,466 INFO L349 Elim1Store]: treesize reduction 62, result has 53.0 percent of original size [2024-10-26 06:26:33,466 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-10-26 06:26:33,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:33,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:26:33,478 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-10-26 06:26:33,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:26:33,484 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-10-26 06:26:33,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:26:33,491 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-10-26 06:26:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 33 not checked. [2024-10-26 06:26:33,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324810148] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:26:33,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:26:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 26] total 62 [2024-10-26 06:26:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028248485] [2024-10-26 06:26:33,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:26:33,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-26 06:26:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:26:33,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-26 06:26:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1978, Unknown=107, NotChecked=1620, Total=4032 [2024-10-26 06:26:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:26:33,584 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:26:33,584 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-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 06:26:33,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:26:42,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse25 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse24 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse35 (select .cse25 .cse24)) (.cse9 (select .cse8 .cse2))) (let ((.cse13 (* .cse9 4)) (.cse32 (* .cse35 4))) (let ((.cse26 (+ .cse32 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select |c_#length| |c_~#queue~0.base|)) (.cse27 (+ .cse13 |c_~#queue~0.offset|)) (.cse23 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse29 (+ .cse35 1)) (.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)) (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 ((.cse5 (let ((.cse6 (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_87|)) v_ArrVal_579))) (store (store .cse7 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse5 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (< .cse9 |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 ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ |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 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) 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)) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (<= (+ .cse13 |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_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse14 .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 ((.cse15 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse17 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse17 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ 1 (select .cse17 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse2) 4)) v_ArrVal_585)))) (store (store .cse15 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse15 .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 ((.cse18 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse18 .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 ((.cse19 (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse18 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse21 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ 1 (select .cse21 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)) v_ArrVal_585)))) (store (store .cse19 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse19 .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))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse22 (store .cse25 .cse26 v_ArrVal_585))) (store (store .cse22 .cse23 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse24 (+ (select .cse22 .cse24) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (<= 0 .cse27) (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 ((.cse28 (store .cse8 .cse27 v_ArrVal_585))) (store (store .cse28 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse28 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)) .cse4)) (<= 0 .cse26) (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 .cse25 .cse23 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse24 .cse29)) |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))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse30 (store .cse25 .cse26 v_ArrVal_585))) (store (store .cse30 .cse23 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse24 (+ (select .cse30 .cse24) 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))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse31 (store .cse8 .cse27 v_ArrVal_585))) (store (store .cse31 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse31 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))) (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 .cse25 .cse23 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse24 .cse29)) |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|))) (<= (+ .cse32 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 ((.cse33 (let ((.cse34 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse2) 4)) v_ArrVal_585)))) (store (store .cse33 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse33 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4))))))))) is different from false [2024-10-26 06:26:42,952 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-10-26 06:26:49,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse8 .cse7)) (.cse14 (select .cse13 .cse3))) (let ((.cse19 (* .cse14 4)) (.cse27 (* .cse9 4))) (let ((.cse21 (+ .cse27 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse22 (+ .cse19 |c_~#queue~0.offset|)) (.cse24 (+ .cse9 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse18 (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_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 ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse12 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) 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)) |c_~#queue~0.offset|))) (< .cse14 |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 ((.cse15 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse17 (store .cse13 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse17 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse17 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse15 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse15 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse18)) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (<= (+ .cse19 |c_~#queue~0.offset| 4) .cse18) (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 ((.cse20 (store .cse8 .cse21 v_ArrVal_585))) (store (store .cse20 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse20 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (<= 0 .cse22) (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 ((.cse23 (store .cse13 .cse22 v_ArrVal_585))) (store (store .cse23 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse23 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)) .cse18)) (<= 0 .cse21) (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 .cse8 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse24)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse18)) (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 ((.cse25 (store .cse8 .cse21 v_ArrVal_585))) (store (store .cse25 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse25 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse18)) (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 ((.cse26 (store .cse13 .cse22 v_ArrVal_585))) (store (store .cse26 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse26 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)))) (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 .cse8 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse24)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (<= (+ .cse27 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 ((.cse28 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse31 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse31 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse31 .cse7) 1)))))) (store .cse28 |c_~#queue~0.base| (let ((.cse29 (let ((.cse30 (select (store .cse28 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse29 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse29 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse18))))))))) is different from false [2024-10-26 06:26:49,413 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-10-26 06:26:49,440 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-10-26 06:26:51,501 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-10-26 06:26:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:26:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:26:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:26:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 06:26:51,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-26 06:26:52,083 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-10-26 06:26:52,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:26:52,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:26:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -542862263, now seen corresponding path program 3 times [2024-10-26 06:26:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:26:52,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257184313] [2024-10-26 06:26:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:26:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:26:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:26:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-26 06:26:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:26:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257184313] [2024-10-26 06:26:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257184313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:26:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807533133] [2024-10-26 06:26:52,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 06:26:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:26:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:26:52,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:26:52,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-26 06:26:53,517 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 06:26:53,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:26:53,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-26 06:26:53,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:26:53,953 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-10-26 06:26:53,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:53,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:26:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-26 06:26:54,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:26:54,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_693 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2024-10-26 06:26:54,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:26:54,160 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-10-26 06:26:54,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:26:54,169 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-10-26 06:26:54,186 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-10-26 06:26:54,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:26:54,193 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-10-26 06:26:54,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:26:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:54,200 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-10-26 06:26:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 8 not checked. [2024-10-26 06:26:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807533133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:26:54,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:26:54,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-10-26 06:26:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843229631] [2024-10-26 06:26:54,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:26:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 06:26:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:26:54,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 06:26:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=283, Unknown=1, NotChecked=34, Total=380 [2024-10-26 06:26:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:26:54,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:26:54,601 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-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 06:26:54,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:26:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:26:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:26:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 06:26:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 06:26:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:26:55,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-26 06:26:55,773 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-10-26 06:26:55,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:26:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:26:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash -589502187, now seen corresponding path program 4 times [2024-10-26 06:26:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:26:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060525456] [2024-10-26 06:26:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:26:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:26:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:26:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-26 06:26:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:26:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060525456] [2024-10-26 06:26:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060525456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:26:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414342241] [2024-10-26 06:26:57,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 06:26:57,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:26:57,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:26:57,600 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:26:57,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-26 06:26:58,186 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 06:26:58,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:26:58,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 2259 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-26 06:26:58,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:26:58,657 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-10-26 06:26:58,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:58,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:26:58,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:58,781 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-10-26 06:26:58,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:26:58,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-26 06:26:58,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:26:58,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:26:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-26 06:26:59,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:26:59,093 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-10-26 06:26:59,106 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-10-26 06:26:59,525 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_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)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.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|) .cse5) 4) |c_~#queue~0.offset| 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 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_814))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-10-26 06:27:04,069 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-10-26 06:27:04,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:27:04,105 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-10-26 06:27:04,154 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-10-26 06:27:04,154 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-10-26 06:27:04,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:27:04,183 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-10-26 06:27:04,190 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-10-26 06:27:04,210 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-10-26 06:27:04,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:27:04,245 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-10-26 06:27:04,265 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-10-26 06:27:04,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,270 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:27:04,273 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,274 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:27:04,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:27:04,280 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-10-26 06:27:04,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:27:04,289 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-10-26 06:27:04,293 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,294 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:27:04,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,299 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-10-26 06:27:04,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:27:04,308 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-10-26 06:27:04,313 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:27:04,314 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:27:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 28 not checked. [2024-10-26 06:27:04,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414342241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:27:04,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:27:04,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 33 [2024-10-26 06:27:04,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338534884] [2024-10-26 06:27:04,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:27:04,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 06:27:04,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:27:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 06:27:04,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=756, Unknown=30, NotChecked=244, Total=1190 [2024-10-26 06:27:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:27:04,714 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:27:04,714 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-10-26 06:27:04,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:27:04,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:27:04,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:27:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:27:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:27:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:27:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:27:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 06:27:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 06:27:08,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-26 06:27:09,094 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-10-26 06:27:09,095 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-26 06:27:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:27:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2122362731, now seen corresponding path program 5 times [2024-10-26 06:27:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:27:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560777594] [2024-10-26 06:27:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:27:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:27:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:27:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-26 06:27:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:27:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560777594] [2024-10-26 06:27:14,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560777594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:27:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533432610] [2024-10-26 06:27:14,578 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 06:27:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:27:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:27:14,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:27:14,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-26 06:27:36,473 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-10-26 06:27:36,473 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:27:36,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-10-26 06:27:36,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:27:36,565 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-10-26 06:27:36,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:36,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:36,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:36,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-26 06:27:37,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:27:37,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:27:37,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:37,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:37,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-26 06:27:37,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:27:37,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:27:37,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:37,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:37,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-26 06:27:37,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:27:37,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:27:37,848 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-26 06:27:37,848 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-10-26 06:27:37,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-26 06:27:38,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:27:38,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:27:38,187 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-10-26 06:27:38,188 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-10-26 06:27:38,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:27:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-26 06:27:38,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:27:38,577 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-10-26 06:27:38,593 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-10-26 06:27:38,642 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-10-26 06:27:38,698 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-10-26 06:27:38,727 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-10-26 06:27:43,032 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 ((.cse4 (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_986)))) (let ((.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1) 400)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_992) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_986) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|))))))) is different from false [2024-10-26 06:27:43,317 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-10-26 06:27:43,975 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-10-26 06:27:44,271 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-10-26 06:27:44,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse10 .cse11))) (or (= 400 .cse0) (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 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .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 ((.cse3 (* (select .cse9 .cse2) 4))) (let ((.cse1 (store .cse9 (+ .cse3 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#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 ((.cse4 (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 (< (+ (select .cse1 .cse2) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse3 |c_~#queue~0.offset| 4)) (not (= 400 (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_992) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|))))))))))))) is different from false [2024-10-26 06:27:45,288 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-10-26 06:27:45,362 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-10-26 06:27:45,972 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-10-26 06:27:46,370 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-10-26 06:27:51,160 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-10-26 06:27:51,360 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-10-26 06:27:51,471 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-10-26 06:28:00,913 INFO L349 Elim1Store]: treesize reduction 1097, result has 38.6 percent of original size [2024-10-26 06:28:00,915 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-10-26 06:28:01,377 INFO L349 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2024-10-26 06:28:01,377 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-10-26 06:28:02,096 INFO L349 Elim1Store]: treesize reduction 112, result has 22.8 percent of original size [2024-10-26 06:28:02,096 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-10-26 06:28:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:28:02,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:28:02,805 INFO L349 Elim1Store]: treesize reduction 122, result has 43.3 percent of original size [2024-10-26 06:28:02,806 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-10-26 06:28:03,250 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-10-26 06:28:03,437 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-10-26 06:28:03,625 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-10-26 06:28:03,887 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-10-26 06:28:04,576 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-10-26 06:28:04,820 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-10-26 06:28:05,282 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-10-26 06:28:12,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:28:12,837 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-10-26 06:28:25,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:28:25,141 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-10-26 06:28:31,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:28:31,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:34:11,677 WARN L286 SmtUtils]: Spent 5.67m 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-10-26 06:34:11,679 INFO L349 Elim1Store]: treesize reduction 1600, result has 91.3 percent of original size [2024-10-26 06:34:11,683 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