/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line487.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 05:57:41,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 05:57:41,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 05:57:41,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 05:57:41,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 05:57:41,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 05:57:41,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 05:57:41,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 05:57:41,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 05:57:41,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 05:57:41,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 05:57:41,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 05:57:41,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 05:57:41,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 05:57:41,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 05:57:41,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 05:57:41,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 05:57:41,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 05:57:41,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 05:57:41,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 05:57:41,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 05:57:41,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 05:57:41,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 05:57:41,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 05:57:41,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 05:57:41,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 05:57:41,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 05:57:41,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 05:57:41,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 05:57:41,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 05:57:41,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 05:57:41,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 05:57:41,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 05:57:41,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 05:57:41,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 05:57:41,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 05:57:41,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 05:57:41,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 05:57:41,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 05:57:41,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 05:57:41,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 05:57:41,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 05:57:41,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 05:57:41,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 05:57:41,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 05:57:41,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 05:57:41,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 05:57:41,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 05:57:41,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 05:57:41,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 05:57:41,184 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 05:57:41,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 05:57:41,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 05:57:41,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 05:57:41,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 05:57:41,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 05:57:41,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 05:57:41,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 05:57:41,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 05:57:41,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 05:57:41,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 05:57:41,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 05:57:41,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 05:57:41,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 05:57:41,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 05:57:41,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 05:57:41,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 05:57:41,189 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 05:57:41,190 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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/UAutomizer-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 [2022-09-30 05:57:41,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 05:57:41,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 05:57:41,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 05:57:41,431 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 05:57:41,431 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 05:57:41,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line487.bpl [2022-09-30 05:57:41,433 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line487.bpl' [2022-09-30 05:57:41,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 05:57:41,500 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 05:57:41,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 05:57:41,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 05:57:41,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 05:57:41,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 05:57:41,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 05:57:41,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 05:57:41,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 05:57:41,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/1) ... [2022-09-30 05:57:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 05:57:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:57:41,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-30 05:57:41,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-30 05:57:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 05:57:41,686 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 05:57:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 05:57:41,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 05:57:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 05:57:41,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 05:57:41,688 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 05:57:41,813 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 05:57:41,814 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 05:57:42,453 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 05:57:42,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 05:57:42,474 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 05:57:42,478 INFO L202 PluginConnector]: Adding new model queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 05:57:42 BoogieIcfgContainer [2022-09-30 05:57:42,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 05:57:42,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 05:57:42,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 05:57:42,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 05:57:42,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 05:57:41" (1/2) ... [2022-09-30 05:57:42,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b75b54c and model type queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 05:57:42, skipping insertion in model container [2022-09-30 05:57:42,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 05:57:42" (2/2) ... [2022-09-30 05:57:42,494 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.line487.bpl [2022-09-30 05:57:42,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 05:57:42,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 05:57:42,510 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 05:57:42,510 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 05:57:42,686 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 05:57:42,763 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 05:57:42,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 05:57:42,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:57:42,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 05:57:42,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-30 05:57:42,820 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 05:57:42,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 05:57:42,838 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@22a8a53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 05:57:42,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 05:57:43,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 05:57:43,483 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 05:57:43,485 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 05:57:43,493 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 05:57:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 05:57:43,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:57:43,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 05:57:43,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-09-30 05:57:43,506 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 05:57:43,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 05:57:43,507 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@22a8a53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 05:57:43,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 05:57:43,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 05:57:43,531 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 05:57:43,532 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 05:57:43,541 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 05:57:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 05:57:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:57:43,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 05:57:43,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-09-30 05:57:43,594 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 05:57:43,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 05:57:43,596 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@22a8a53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 05:57:43,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 05:57:43,597 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 05:57:43,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 05:57:43,598 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 05:57:43,598 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 05:57:43,608 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 05:57:43,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 05:57:43,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:57:43,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 05:57:43,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-09-30 05:57:43,616 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 05:57:43,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 05:57:43,617 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@22a8a53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 05:57:43,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 05:57:43,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2066130039, now seen corresponding path program 1 times [2022-09-30 05:57:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:43,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237396297] [2022-09-30 05:57:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 05:57:44,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:44,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237396297] [2022-09-30 05:57:44,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237396297] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:57:44,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:57:44,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-30 05:57:44,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725581988] [2022-09-30 05:57:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:57:44,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-30 05:57:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:57:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-30 05:57:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-30 05:57:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:44,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:57:44,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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) [2022-09-30 05:57:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:45,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 05:57:45,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2131968224, now seen corresponding path program 1 times [2022-09-30 05:57:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569877731] [2022-09-30 05:57:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 05:57:46,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:46,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569877731] [2022-09-30 05:57:46,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569877731] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:57:46,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:57:46,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-09-30 05:57:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750810011] [2022-09-30 05:57:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:57:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-09-30 05:57:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:57:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-09-30 05:57:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-09-30 05:57:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:46,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:57:46,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 11.551724137931034) internal successors, (335), 30 states have internal predecessors, (335), 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) [2022-09-30 05:57:46,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:46,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-09-30 05:57:54,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 05:57:54,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1977838357, now seen corresponding path program 1 times [2022-09-30 05:57:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:54,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191867381] [2022-09-30 05:57:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-09-30 05:57:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191867381] [2022-09-30 05:57:54,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191867381] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:57:54,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:57:54,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-30 05:57:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448294447] [2022-09-30 05:57:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:57:54,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-30 05:57:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:57:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-30 05:57:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-30 05:57:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:54,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:57:54,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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) [2022-09-30 05:57:54,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:54,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-09-30 05:57:54,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-09-30 05:57:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:55,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-30 05:57:55,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash 971641964, now seen corresponding path program 1 times [2022-09-30 05:57:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:55,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656500350] [2022-09-30 05:57:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-09-30 05:57:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:55,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656500350] [2022-09-30 05:57:55,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656500350] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:57:55,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:57:55,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-30 05:57:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853924880] [2022-09-30 05:57:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:57:55,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-30 05:57:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:57:55,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-30 05:57:55,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-09-30 05:57:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:55,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:57:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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) [2022-09-30 05:57:55,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:55,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-09-30 05:57:55,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:55,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-09-30 05:57:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-30 05:57:55,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1144012605, now seen corresponding path program 2 times [2022-09-30 05:57:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:55,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146760100] [2022-09-30 05:57:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-09-30 05:57:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:55,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146760100] [2022-09-30 05:57:55,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146760100] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:57:55,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:57:55,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-30 05:57:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573324838] [2022-09-30 05:57:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:57:55,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-30 05:57:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:57:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-30 05:57:55,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-30 05:57:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:55,890 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:57:55,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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) [2022-09-30 05:57:55,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:55,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-09-30 05:57:55,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:55,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:55,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:57:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:56,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-30 05:57:56,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash -651489926, now seen corresponding path program 1 times [2022-09-30 05:57:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:56,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005503136] [2022-09-30 05:57:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2960 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-09-30 05:57:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:57,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005503136] [2022-09-30 05:57:57,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005503136] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:57:57,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:57:57,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-30 05:57:57,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650652249] [2022-09-30 05:57:57,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:57:57,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-30 05:57:57,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:57:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-30 05:57:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-30 05:57:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:57,106 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:57:57,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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) [2022-09-30 05:57:57,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:57,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:57:57,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:57,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:57,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:57,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:57:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:57:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:57:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:57:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:57:57,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-30 05:57:57,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:57:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:57:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash -389699591, now seen corresponding path program 1 times [2022-09-30 05:57:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:57:57,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972854076] [2022-09-30 05:57:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:57:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-30 05:57:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:57:58,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972854076] [2022-09-30 05:57:58,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972854076] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 05:57:58,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963834642] [2022-09-30 05:57:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:57:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 05:57:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:57:58,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 05:57:58,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-30 05:57:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:57:59,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 107 conjunts are in the unsatisfiable core [2022-09-30 05:57:59,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 05:57:59,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 05:57:59,477 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 05:57:59,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-09-30 05:58:00,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 05:58:00,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:00,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-09-30 05:58:01,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:01,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-09-30 05:58:02,379 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 05:58:02,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-09-30 05:58:02,576 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 05:58:02,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-09-30 05:58:02,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:02,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-09-30 05:58:03,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-09-30 05:58:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-09-30 05:58:03,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-30 05:58:03,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963834642] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:58:03,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-30 05:58:03,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [33] total 71 [2022-09-30 05:58:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023495190] [2022-09-30 05:58:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:58:03,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-09-30 05:58:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:58:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-09-30 05:58:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=4647, Unknown=0, NotChecked=0, Total=4970 [2022-09-30 05:58:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:58:03,140 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:58:03,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 13.256410256410257) internal successors, (517), 39 states have internal predecessors, (517), 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) [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:58:03,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:58:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:58:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:58:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-09-30 05:58:08,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-30 05:58:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 05:58:08,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:58:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:58:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -494269978, now seen corresponding path program 1 times [2022-09-30 05:58:08,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:58:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318351116] [2022-09-30 05:58:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:58:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:58:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:58:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 05:58:10,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:58:10,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318351116] [2022-09-30 05:58:10,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318351116] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:58:10,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 05:58:10,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-09-30 05:58:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355689986] [2022-09-30 05:58:10,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:58:10,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-30 05:58:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:58:10,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-30 05:58:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2679, Unknown=0, NotChecked=0, Total=2862 [2022-09-30 05:58:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:58:10,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:58:10,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 6.528301886792453) internal successors, (346), 54 states have internal predecessors, (346), 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) [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-09-30 05:58:10,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:58:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:58:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:58:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-09-30 05:58:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-30 05:58:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-30 05:58:21,271 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:58:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:58:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash -513412045, now seen corresponding path program 1 times [2022-09-30 05:58:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:58:21,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391465417] [2022-09-30 05:58:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:58:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:58:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:58:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-30 05:58:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:58:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391465417] [2022-09-30 05:58:22,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391465417] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 05:58:22,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255143097] [2022-09-30 05:58:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:58:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 05:58:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:58:22,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 05:58:22,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-30 05:58:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:58:22,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 165 conjunts are in the unsatisfiable core [2022-09-30 05:58:22,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 05:58:23,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 05:58:23,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 05:58:23,455 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 05:58:23,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 05:58:23,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 05:58:24,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 05:58:24,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:24,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-09-30 05:58:25,065 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 05:58:25,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-30 05:58:25,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 05:58:26,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:58:26,824 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 05:58:26,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 54 [2022-09-30 05:58:27,151 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 05:58:27,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2022-09-30 05:58:27,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:27,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-09-30 05:58:27,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:58:27,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 05:58:28,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 05:58:28,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:28,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-09-30 05:58:29,161 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 05:58:29,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 [2022-09-30 05:58:29,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:29,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-09-30 05:58:29,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-30 05:58:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-09-30 05:58:29,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-30 05:58:29,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255143097] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 05:58:29,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-30 05:58:29,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [37] total 94 [2022-09-30 05:58:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186135819] [2022-09-30 05:58:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 05:58:29,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-09-30 05:58:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:58:29,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-09-30 05:58:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=8300, Unknown=0, NotChecked=0, Total=8742 [2022-09-30 05:58:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:58:29,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:58:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 9.672413793103448) internal successors, (561), 58 states have internal predecessors, (561), 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) [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-30 05:58:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:58:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:58:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:58:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:58:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:58:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-09-30 05:58:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-30 05:58:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-09-30 05:58:41,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-30 05:58:41,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 05:58:41,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 05:58:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 05:58:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash -396402827, now seen corresponding path program 1 times [2022-09-30 05:58:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 05:58:41,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157852999] [2022-09-30 05:58:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:58:41,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 05:58:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:58:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-09-30 05:58:46,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 05:58:46,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157852999] [2022-09-30 05:58:46,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157852999] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 05:58:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817256207] [2022-09-30 05:58:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 05:58:46,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 05:58:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 05:58:46,131 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 05:58:46,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-30 05:58:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 05:58:46,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 218 conjunts are in the unsatisfiable core [2022-09-30 05:58:46,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 05:58:46,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 05:58:46,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 05:58:47,062 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 05:58:47,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 05:58:47,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 05:58:47,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 05:58:48,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-30 05:58:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:48,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:48,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-09-30 05:58:49,459 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 05:58:49,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 29 [2022-09-30 05:58:49,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-09-30 05:58:51,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:58:51,720 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-30 05:58:51,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 60 [2022-09-30 05:58:52,057 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-09-30 05:58:52,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 52 [2022-09-30 05:58:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:52,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:52,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-09-30 05:58:53,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-30 05:58:54,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:54,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-30 05:58:55,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:58:55,871 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-30 05:58:55,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-30 05:58:56,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:56,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:56,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-09-30 05:58:57,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:57,198 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 05:58:57,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-09-30 05:58:57,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:57,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 05:58:57,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-09-30 05:58:59,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 05:58:59,048 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-09-30 05:58:59,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 37 [2022-09-30 05:58:59,273 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-09-30 05:58:59,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-09-30 05:58:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-09-30 05:58:59,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 05:59:05,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-09-30 05:59:05,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-09-30 05:59:05,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (not (= 20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80))))) is different from false [2022-09-30 05:59:05,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-09-30 05:59:05,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,376 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_899)))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_897)))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:05,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 20 (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:06,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:06,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:06,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:06,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 05:59:06,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|))))) is different from false [2022-09-30 05:59:06,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 05:59:07,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 05:59:07,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse1 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse2 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:07,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 05:59:07,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:07,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= v_ArrVal_894 |c_t1Thread1of1ForFork1_write~int_#value#1|)) (< (+ (* 4 (select .cse2 .cse0)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:07,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_894) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ |c_~#queue~0.offset| (* (select .cse2 .cse0) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:08,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_894) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:08,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_894) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:08,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1) v_ArrVal_894) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:08,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) v_ArrVal_894) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:08,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_894) (< (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) is different from false [2022-09-30 05:59:08,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse5 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_892)))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))))) is different from false [2022-09-30 05:59:09,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse2 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_894) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) is different from false [2022-09-30 05:59:09,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse2 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) is different from false [2022-09-30 05:59:19,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,498 INFO L356 Elim1Store]: treesize reduction 41, result has 53.9 percent of original size [2022-09-30 05:59:19,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 387 treesize of output 202 [2022-09-30 05:59:19,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 05:59:19,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 516 treesize of output 530 [2022-09-30 05:59:19,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 418 treesize of output 406 [2022-09-30 05:59:19,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 366 treesize of output 334 [2022-09-30 05:59:19,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 334 treesize of output 318 [2022-09-30 05:59:19,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:19,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 402 treesize of output 386 [2022-09-30 05:59:19,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 05:59:20,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 05:59:20,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 45 [2022-09-30 05:59:20,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-30 05:59:20,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:20,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:20,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:20,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:20,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 05:59:20,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 211 treesize of output 237 [2022-09-30 05:59:34,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 138 [2022-09-30 05:59:34,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-09-30 05:59:34,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-09-30 05:59:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 05:59:34,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-09-30 05:59:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 36 not checked. [2022-09-30 05:59:35,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817256207] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 05:59:35,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 05:59:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 80, 79] total 230 [2022-09-30 05:59:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603610680] [2022-09-30 05:59:35,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 05:59:35,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 230 states [2022-09-30 05:59:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 05:59:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2022-09-30 05:59:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=36442, Unknown=133, NotChecked=14700, Total=52670 [2022-09-30 05:59:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:59:35,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 05:59:35,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 230 states, 230 states have (on average 6.604347826086957) internal successors, (1519), 230 states have internal predecessors, (1519), 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) [2022-09-30 05:59:35,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:59:35,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-09-30 05:59:35,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 05:59:53,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse17 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse10 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (.cse12 (+ |c_~#queue~0.offset| 80)) (.cse34 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|)) (.cse42 (select |c_#length| |c_~#queue~0.base|)) (.cse13 (select .cse43 .cse17)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse44 (+ |c_ULTIMATE.start_init_~q#1.offset| 84))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (select .cse36 .cse44)) (.cse8 (<= .cse13 0)) (.cse25 (< .cse42 (+ 92 |c_~#queue~0.offset|))) (.cse14 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (.cse3 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse35 (+ |c_ULTIMATE.start_init_~q#1.offset| 80)) (.cse5 (select .cse34 .cse44)) (.cse11 (select |c_#length| |c_ULTIMATE.start_init_~q#1.base|)) (.cse16 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (= (select .cse43 .cse12) 0)) (.cse6 (and (<= .cse42 4) .cse10)) (.cse7 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (and (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |ULTIMATE.start_write~int_#ptr#1.base|))))) (.cse1 (<= (select .cse0 .cse17) 0)) (.cse4 (= (select .cse0 .cse12) 0))) (and (= (select .cse0 80) 0) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse1 (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= (select .cse2 80) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse3 80) 0) .cse4 (= .cse5 0) (or .cse6 (and .cse7 .cse8 .cse9)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (or .cse10 (<= .cse11 91)) (<= (+ 4 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (= (select .cse2 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse3 .cse12) 0) (<= .cse13 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 0) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse14 84) 0) (<= .cse15 0) (= 0 .cse15) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4))) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (not .cse16) .cse8 (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse10 (<= (select .cse3 .cse17) 0) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_887 Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_890 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse24 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_887)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_888))) (let ((.cse21 (select .cse24 |c_~#queue~0.base|))) (let ((.cse23 (store (store .cse21 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_890) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse19 (+ 84 |c_~#queue~0.offset|))) (let ((.cse22 (store (store .cse24 |c_~#queue~0.base| (store .cse23 .cse19 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse18 (+ 88 |c_~#queue~0.offset|)) (.cse20 (select .cse22 |c_~#queue~0.base|))) (or (not (<= .cse18 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse19 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ |c_~#queue~0.offset| (* (select .cse20 .cse19) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (< (select |c_#length| |c_~#queue~0.base|) (+ |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| 4)) (not (<= .cse18 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (< (+ (* (select .cse21 .cse19) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= (select (select (store (store (store .cse22 |c_~#queue~0.base| (store (store (store .cse20 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)) (< (+ (select .cse23 .cse19) 1) v_ArrVal_894)))))))) .cse25) (or (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_18| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_887 Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_885 Int) (v_ArrVal_894 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_890 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse32 (store (let ((.cse33 (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_885)))) (store .cse33 |c_ULTIMATE.start_init_~q#1.base| (store (select .cse33 |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_18| v_ArrVal_887))) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_888))) (let ((.cse28 (select .cse32 |c_~#queue~0.base|))) (let ((.cse26 (store (store .cse28 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_890) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse27 (+ 84 |c_~#queue~0.offset|))) (let ((.cse30 (store (store .cse32 |c_~#queue~0.base| (store .cse26 .cse27 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse29 (+ 88 |c_~#queue~0.offset|)) (.cse31 (select .cse30 |c_~#queue~0.base|))) (or (< (+ (select .cse26 .cse27) 1) v_ArrVal_894) (< (+ (* (select .cse28 .cse27) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (<= v_ArrVal_885 |c_ULTIMATE.start_write~int_#value#1|)) (not (<= .cse29 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse27 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse30 |c_~#queue~0.base| (store (store (store .cse31 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (select |c_#length| |c_~#queue~0.base|) (+ |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| 4)) (not (<= .cse29 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_18|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse31 .cse27) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))))) .cse25) (= (select .cse14 80) 0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select .cse34 .cse35) 0) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= (select .cse3 84) 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select .cse36 .cse35) 0) (<= .cse5 0) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse40 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse41 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse38 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse40 .cse41 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse39 (select .cse38 |c_~#queue~0.base|)) (.cse37 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse37 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse38 |c_~#queue~0.base| (store (store (store .cse39 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse39 .cse37) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ (select .cse40 .cse41) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) (or (<= .cse11 4) .cse16 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (<= 4 |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) .cse9 (or .cse6 (and .cse7 .cse1 .cse4)))))) is different from false [2022-09-30 05:59:53,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select .cse1 80) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= (select .cse1 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (< (+ (select .cse5 .cse6) 1) v_ArrVal_894) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:53,687 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int))) (let ((.cse4 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_892)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_894)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_894) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse6 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))))) (= (select .cse0 80) 0) (<= |c_~#stored_elements~0.base| 6) (= (select .cse1 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-09-30 05:59:59,045 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse6 80)) (.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| 80)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| (+ (select .cse3 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) 1)) (= (select .cse4 .cse5) 0) (= (select .cse6 84) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (not (= 20 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 80))) (<= (select .cse3 .cse7) 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| (select .cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 20 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 80))) (= .cse8 0) (= .cse7 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select .cse4 .cse7) 1) (not (= .cse8 20)) (= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 0) (<= |c_~#stored_elements~0.base| 6) (= (select .cse3 .cse5) 0)))) is different from false [2022-09-30 05:59:59,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| v_ArrVal_895))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_92| |c_~#stored_elements~0.base|)))) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-09-30 05:59:59,075 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#stored_elements~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_895 (Array Int Int)) (v_ArrVal_897 Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_895))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-09-30 05:59:59,084 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,091 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.base| |c_~#queue~0.base|))) is different from false [2022-09-30 05:59:59,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_t1Thread1of1ForFork1_empty_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,108 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= (select .cse2 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,267 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (select .cse2 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse2 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,285 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) is different from false [2022-09-30 05:59:59,295 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| Int) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_897 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 20 (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_71| v_ArrVal_897) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-09-30 05:59:59,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= (select .cse2 .cse1) 0))) is different from false [2022-09-30 05:59:59,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int) (v_ArrVal_899 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:59,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 05:59:59,643 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (v_ArrVal_899 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_899) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-09-30 05:59:59,893 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6) (= (select .cse2 .cse1) 0))) is different from false [2022-09-30 05:59:59,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 05:59:59,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_900 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_900)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-09-30 06:00:00,127 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 80))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 0) (<= (select .cse1 .cse2) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= .cse2 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6) (= (select .cse1 .cse0) 0))) is different from false [2022-09-30 06:00:00,130 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:00:00,139 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| Int)) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| v_ArrVal_902) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_903) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_88| |c_~#stored_elements~0.base|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 0)) is different from false [2022-09-30 06:00:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-30 06:00:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-09-30 06:00:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-09-30 06:00:06,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-09-30 06:00:07,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:00:07,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:00:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:00:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1918603460, now seen corresponding path program 1 times [2022-09-30 06:00:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:00:07,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649505265] [2022-09-30 06:00:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:00:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:00:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:00:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-09-30 06:00:12,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:00:12,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649505265] [2022-09-30 06:00:12,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649505265] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:00:12,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911582990] [2022-09-30 06:00:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:00:12,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:00:12,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:00:12,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:00:12,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-30 06:00:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:00:12,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 215 conjunts are in the unsatisfiable core [2022-09-30 06:00:12,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:00:12,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:00:13,148 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:00:13,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-09-30 06:00:13,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:00:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:14,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-09-30 06:00:14,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:14,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-09-30 06:00:16,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:00:16,200 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:00:16,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-09-30 06:00:16,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:16,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-09-30 06:00:16,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:00:16,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:00:17,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:00:17,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:17,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-09-30 06:00:19,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:00:19,809 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:00:19,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-09-30 06:00:20,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:20,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-09-30 06:00:21,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:00:21,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-09-30 06:00:21,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:00:21,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:21,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 [2022-09-30 06:00:22,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:22,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 [2022-09-30 06:00:24,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:24,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-09-30 06:00:25,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:00:25,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 27 [2022-09-30 06:00:25,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-09-30 06:00:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-30 06:00:26,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:01:51,029 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 88) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (select (store |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store (select |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80))))))) (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 88) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (select (store |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store (select |c_t2Thread1of1ForFork0_write~int_old_#memory_int#1| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038)) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-09-30 06:02:41,478 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 (* (select (store (store (select |c_#memory_int| |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (store (store (select |c_#memory_int| |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-09-30 06:02:42,429 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4))))))))) is different from false [2022-09-30 06:02:42,498 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 |c_~#queue~0.offset| (* (select (store (store (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2022-09-30 06:02:42,537 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ 3 |c_~#queue~0.offset| (* (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|))))) is different from false [2022-09-30 06:02:42,878 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2022-09-30 06:02:42,980 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ (* 4 (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|))) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* 4 (select (store (store (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|))))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:02:43,042 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (< (+ (* (select (store (store (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| Int)) (or (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (not (<= (+ 88 |c_~#queue~0.offset|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25|)) (forall ((v_ArrVal_1036 Int) (|v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| Int)) (or (not (<= |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| (+ |c_~#queue~0.offset| 80))) (forall ((v_ArrVal_1038 Int)) (<= 0 (+ (* (select (store (store (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| v_ArrVal_1034) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1035) |c_~#queue~0.base|) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_1036) |v_t2Thread1of1ForFork0_write~int_#ptr#1.offset_24| v_ArrVal_1038) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|))))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_98| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:02:43,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:02:43,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-09-30 06:02:43,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:02:43,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 218 treesize of output 220 [2022-09-30 06:02:43,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 83 [2022-09-30 06:02:43,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 162 treesize of output 146 [2022-09-30 06:02:43,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-30 06:02:43,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:02:43,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 144 treesize of output 144 [2022-09-30 06:02:43,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:02:43,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 37 [2022-09-30 06:02:43,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 27 [2022-09-30 06:02:43,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:02:43,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 15 [2022-09-30 06:02:45,825 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|)) (forall ((v_ArrVal_1030 Int)) (<= 0 (+ (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (forall ((v_ArrVal_1030 Int)) (< (+ (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 7 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|))))) is different from false [2022-09-30 06:02:46,705 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (forall ((v_ArrVal_1030 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| Int)) (or (forall ((v_ArrVal_1030 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80| v_ArrVal_1030) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_80|))))) is different from false [2022-09-30 06:05:43,095 WARN L233 SmtUtils]: Spent 15.81s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:06:02,173 WARN L233 SmtUtils]: Spent 17.81s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:06:17,603 WARN L233 SmtUtils]: Spent 15.14s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:06:38,304 WARN L233 SmtUtils]: Spent 20.42s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:06:56,592 WARN L233 SmtUtils]: Spent 17.94s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:07:14,369 WARN L233 SmtUtils]: Spent 17.44s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:07:28,316 WARN L233 SmtUtils]: Spent 13.62s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:07:29,677 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((v_ArrVal_1027 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1027) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) 0)))) (and (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (<= 0 (+ (* (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse1) 4) |c_~#queue~0.offset| 4))))) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse2 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (< (+ 7 (* (select (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse3) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse4) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse4))) is different from false [2022-09-30 06:07:29,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)))))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (< (+ (* (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse1) 4) 7 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))))) (or .cse2 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse3 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (<= 0 (+ (* (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse4) 4) |c_~#queue~0.offset| 4)) (< (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)))))) (or .cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))))) is different from false [2022-09-30 06:07:29,875 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (< (+ (* 4 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)))))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (< (+ 7 (* (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse1) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)))) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse2) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse2) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1027 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| Int)) (let ((.cse3 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_102| v_ArrVal_1027) |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|)) (< (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81|) (<= 0 (+ (* (select (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_81| v_ArrVal_1030) .cse4) 4) |c_~#queue~0.offset| 4))))))))) is different from false [2022-09-30 06:07:30,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:07:30,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 191 treesize of output 152 [2022-09-30 06:07:30,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:07:30,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 264 treesize of output 258 [2022-09-30 06:07:30,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 264 treesize of output 256 [2022-09-30 06:07:30,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 252 [2022-09-30 06:07:30,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 271 treesize of output 263 [2022-09-30 06:07:30,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 263 treesize of output 259 [2022-09-30 06:07:30,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-30 06:07:30,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:07:30,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 197 treesize of output 177 [2022-09-30 06:07:49,858 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:08:20,113 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:08:29,169 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:08:43,137 WARN L233 SmtUtils]: Spent 11.33s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:08:57,957 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:03,341 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:09,508 WARN L233 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:19,987 WARN L233 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:33,886 WARN L233 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:42,523 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:49,753 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:09:52,092 INFO L356 Elim1Store]: treesize reduction 45, result has 63.7 percent of original size [2022-09-30 06:09:52,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 357 treesize of output 340 [2022-09-30 06:09:52,159 INFO L356 Elim1Store]: treesize reduction 95, result has 20.2 percent of original size [2022-09-30 06:09:52,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 294 treesize of output 307 [2022-09-30 06:09:52,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 242 treesize of output 234 [2022-09-30 06:09:52,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:09:52,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11758 treesize of output 11728 [2022-09-30 06:09:52,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12524 treesize of output 11500 [2022-09-30 06:09:52,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11540 treesize of output 11528 [2022-09-30 06:09:52,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 Received shutdown request... [2022-09-30 06:11:20,925 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-30 06:11:20,927 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:11:20,931 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:11:20,931 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:11:20,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-30 06:11:20,958 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:11:20,958 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:11:20,958 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:11:20,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:11:21,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-09-30 06:11:21,128 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 600 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 10ms.. [2022-09-30 06:11:21,129 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-30 06:11:21,130 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-09-30 06:11:21,132 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-30 06:11:21,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-30 06:11:21,135 INFO L202 PluginConnector]: Adding new model queue.line487.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 06:11:21 BasicIcfg [2022-09-30 06:11:21,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-30 06:11:21,136 INFO L158 Benchmark]: Toolchain (without parser) took 819635.78ms. Allocated memory was 172.0MB in the beginning and 895.5MB in the end (delta: 723.5MB). Free memory was 123.7MB in the beginning and 443.0MB in the end (delta: -319.4MB). Peak memory consumption was 634.5MB. Max. memory is 8.0GB. [2022-09-30 06:11:21,136 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-30 06:11:21,136 INFO L158 Benchmark]: Boogie Preprocessor took 103.19ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 120.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-30 06:11:21,136 INFO L158 Benchmark]: RCFGBuilder took 867.33ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 116.9MB in the end (delta: 3.1MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2022-09-30 06:11:21,137 INFO L158 Benchmark]: TraceAbstraction took 818655.46ms. Allocated memory was 172.0MB in the beginning and 895.5MB in the end (delta: 723.5MB). Free memory was 116.2MB in the beginning and 443.0MB in the end (delta: -326.8MB). Peak memory consumption was 625.7MB. Max. memory is 8.0GB. [2022-09-30 06:11:21,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 103.19ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 120.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 867.33ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 116.9MB in the end (delta: 3.1MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * TraceAbstraction took 818655.46ms. Allocated memory was 172.0MB in the beginning and 895.5MB in the end (delta: 723.5MB). Free memory was 116.2MB in the beginning and 443.0MB in the end (delta: -326.8MB). Peak memory consumption was 625.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3821, positive: 3660, positive conditional: 3660, positive unconditional: 0, negative: 161, negative conditional: 161, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3821, positive: 3660, positive conditional: 3660, positive unconditional: 0, negative: 161, negative conditional: 161, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3690, positive: 3660, positive conditional: 0, positive unconditional: 3660, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3614, positive: 3584, positive conditional: 0, positive unconditional: 3584, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3690, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3614, unknown conditional: 0, unknown unconditional: 3614] , Statistics on independence cache: Total cache size (in pairs): 3614, Positive cache size: 3584, Positive conditional cache size: 0, Positive unconditional cache size: 3584, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 131, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 171, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24174, positive: 23617, positive conditional: 23617, positive unconditional: 0, negative: 557, negative conditional: 557, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 2822, Positive cache size: 2819, Positive conditional cache size: 0, Positive unconditional cache size: 2819, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 540, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32828, positive: 31977, positive conditional: 31977, positive unconditional: 0, negative: 851, negative conditional: 851, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 7064, Positive cache size: 7043, Positive conditional cache size: 0, Positive unconditional cache size: 7043, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Independence queries for same thread: 1351, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8473, positive: 7834, positive conditional: 7834, positive unconditional: 0, negative: 639, negative conditional: 639, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 9126, Positive cache size: 9102, Positive conditional cache size: 0, Positive unconditional cache size: 9102, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Independence queries for same thread: 1985, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7861, positive: 7235, positive conditional: 7235, positive unconditional: 0, negative: 626, negative conditional: 626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 9498, Positive cache size: 9470, Positive conditional cache size: 0, Positive unconditional cache size: 9470, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Independence queries for same thread: 2598, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8074, positive: 7450, positive conditional: 7450, positive unconditional: 0, negative: 624, negative conditional: 624, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 10414, Positive cache size: 10381, Positive conditional cache size: 0, Positive unconditional cache size: 10381, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Independence queries for same thread: 3208, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5721, positive: 5258, positive conditional: 5258, positive unconditional: 0, negative: 463, negative conditional: 463, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 10789, Positive cache size: 10754, Positive conditional cache size: 0, Positive unconditional cache size: 10754, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 3666, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3153, positive: 2884, positive conditional: 2884, positive unconditional: 0, negative: 269, negative conditional: 269, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 10876, Positive cache size: 10841, Positive conditional cache size: 0, Positive unconditional cache size: 10841, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 3935, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5732, positive: 5269, positive conditional: 5269, positive unconditional: 0, negative: 463, negative conditional: 463, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 11092, Positive cache size: 11057, Positive conditional cache size: 0, Positive unconditional cache size: 11057, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 4393, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5743, positive: 5280, positive conditional: 5280, positive unconditional: 0, negative: 463, negative conditional: 463, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 11112, Positive cache size: 11077, Positive conditional cache size: 0, Positive unconditional cache size: 11077, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 4851, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5786, positive: 5319, positive conditional: 5319, positive unconditional: 0, negative: 467, negative conditional: 467, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 107716, positive: 102287, positive conditional: 102287, positive unconditional: 0, negative: 5429, negative conditional: 5429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102403, positive: 102287, positive conditional: 0, positive unconditional: 102287, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11446, positive: 11411, positive conditional: 0, positive unconditional: 11411, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 102403, positive: 90876, positive conditional: 0, positive unconditional: 90876, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 11446, unknown conditional: 0, unknown unconditional: 11446] , Statistics on independence cache: Total cache size (in pairs): 11446, Positive cache size: 11411, Positive conditional cache size: 0, Positive unconditional cache size: 11411, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 5313, Statistics for Abstraction: - TimeoutResultAtElement [Line: 487]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 600 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 1034 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 817.5s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 69.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 418, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 71.1s InterpolantComputationTime, 8539 NumberOfCodeBlocks, 8539 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 9113 ConstructedInterpolants, 435 QuantifiedInterpolants, 115452 SizeOfPredicates, 303 NumberOfNonLiveVariables, 3711 ConjunctsInSsa, 490 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 6723/6947 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown