/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/divinefifo_1w1r.line1569.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m
[2022-10-03 15:39:36,254 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-10-03 15:39:36,256 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-10-03 15:39:36,298 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-10-03 15:39:36,298 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-10-03 15:39:36,301 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-10-03 15:39:36,303 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-10-03 15:39:36,306 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-10-03 15:39:36,307 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-10-03 15:39:36,311 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-10-03 15:39:36,312 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-10-03 15:39:36,313 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-10-03 15:39:36,313 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-10-03 15:39:36,315 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-10-03 15:39:36,316 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-10-03 15:39:36,319 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-10-03 15:39:36,319 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-10-03 15:39:36,320 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-10-03 15:39:36,322 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-10-03 15:39:36,327 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-10-03 15:39:36,327 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-10-03 15:39:36,328 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-10-03 15:39:36,330 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-10-03 15:39:36,331 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-10-03 15:39:36,337 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-10-03 15:39:36,338 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-10-03 15:39:36,338 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-10-03 15:39:36,339 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-10-03 15:39:36,339 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-10-03 15:39:36,340 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-10-03 15:39:36,340 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-10-03 15:39:36,341 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-10-03 15:39:36,342 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-10-03 15:39:36,343 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-10-03 15:39:36,344 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-10-03 15:39:36,344 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-10-03 15:39:36,344 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-10-03 15:39:36,345 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-10-03 15:39:36,345 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-10-03 15:39:36,345 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-10-03 15:39:36,346 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-10-03 15:39:36,347 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf
[2022-10-03 15:39:36,378 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-10-03 15:39:36,378 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-10-03 15:39:36,378 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-10-03 15:39:36,378 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-10-03 15:39:36,379 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-10-03 15:39:36,379 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-10-03 15:39:36,380 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-10-03 15:39:36,380 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-10-03 15:39:36,380 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-10-03 15:39:36,380 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-10-03 15:39:36,381 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-10-03 15:39:36,381 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-10-03 15:39:36,381 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-10-03 15:39:36,381 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-10-03 15:39:36,381 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-10-03 15:39:36,382 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-10-03 15:39:36,382 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-10-03 15:39:36,383 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-10-03 15:39:36,383 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-10-03 15:39:36,384 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-10-03 15:39:36,384 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-10-03 15:39:36,384 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-10-03 15:39:36,384 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-10-03 15:39:36,384 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-10-03 15:39:36,384 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-10-03 15:39:36,384 INFO  L138        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2022-10-03 15:39:36,385 INFO  L138        SettingsManager]:  * Abstraction used for commutativity in POR=VARIABLES_GLOBAL
[2022-10-03 15:39:36,385 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2022-10-03 15:39:36,385 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-10-03 15:39:36,385 INFO  L138        SettingsManager]:  * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION
[2022-10-03 15:39:36,385 INFO  L138        SettingsManager]:  * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2022-10-03 15:39:36,385 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2022-10-03 15:39:36,385 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-10-03 15:39:36,622 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-10-03 15:39:36,644 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-10-03 15:39:36,646 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-10-03 15:39:36,647 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2022-10-03 15:39:36,648 INFO  L275        PluginConnector]: Boogie PL CUP Parser initialized
[2022-10-03 15:39:36,649 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1569.bpl
[2022-10-03 15:39:36,649 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1569.bpl'
[2022-10-03 15:39:36,733 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-10-03 15:39:36,735 INFO  L131        ToolchainWalker]: Walking toolchain with 3 elements.
[2022-10-03 15:39:36,736 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-10-03 15:39:36,737 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-10-03 15:39:36,737 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-10-03 15:39:36,750 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,751 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,795 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,795 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,845 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,851 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,858 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,870 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-10-03 15:39:36,872 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-10-03 15:39:36,872 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-10-03 15:39:36,872 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-10-03 15:39:36,887 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/1) ...
[2022-10-03 15:39:36,893 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-10-03 15:39:36,901 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-03 15:39:36,917 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-10-03 15:39:36,950 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-10-03 15:39:36,998 INFO  L130     BoogieDeclarations]: Found specification of procedure pusher
[2022-10-03 15:39:36,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure pusher
[2022-10-03 15:39:36,998 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-10-03 15:39:36,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-10-03 15:39:37,000 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-10-03 15:39:37,264 INFO  L234             CfgBuilder]: Building ICFG
[2022-10-03 15:39:37,266 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-10-03 15:39:38,294 INFO  L275             CfgBuilder]: Performing block encoding
[2022-10-03 15:39:38,323 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-10-03 15:39:38,323 INFO  L299             CfgBuilder]: Removed 4 assume(true) statements.
[2022-10-03 15:39:38,327 INFO  L202        PluginConnector]: Adding new model divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:39:38 BoogieIcfgContainer
[2022-10-03 15:39:38,327 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-10-03 15:39:38,329 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-10-03 15:39:38,330 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-10-03 15:39:38,333 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-10-03 15:39:38,333 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:39:36" (1/2) ...
[2022-10-03 15:39:38,334 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c2e9e9 and model type divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:39:38, skipping insertion in model container
[2022-10-03 15:39:38,335 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1569.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:39:38" (2/2) ...
[2022-10-03 15:39:38,338 INFO  L112   eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1569.bpl
[2022-10-03 15:39:38,346 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-10-03 15:39:38,356 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-10-03 15:39:38,356 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-10-03 15:39:38,357 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-10-03 15:39:38,489 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2022-10-03 15:39:38,544 INFO  L100   denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2022-10-03 15:39:38,544 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-10-03 15:39:38,544 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-03 15:39:38,547 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-10-03 15:39:38,551 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-10-03 15:39:38,579 INFO  L158   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2022-10-03 15:39:38,585 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ========
[2022-10-03 15:39:38,591 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;@7ceaa075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-10-03 15:39:38,591 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-10-03 15:39:39,075 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-03 15:39:39,079 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-03 15:39:39,080 INFO  L85        PathProgramCache]: Analyzing trace with hash 1810932660, now seen corresponding path program 1 times
[2022-10-03 15:39:39,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-03 15:39:39,088 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000269703]
[2022-10-03 15:39:39,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-03 15:39:39,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-03 15:39:39,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-03 15:39:39,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-03 15:39:39,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-03 15:39:39,708 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000269703]
[2022-10-03 15:39:39,708 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000269703] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-03 15:39:39,709 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-03 15:39:39,709 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-10-03 15:39:39,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492656698]
[2022-10-03 15:39:39,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-03 15:39:39,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-10-03 15:39:39,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-03 15:39:39,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-10-03 15:39:39,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-10-03 15:39:39,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:39,745 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-03 15:39:39,747 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 359.0) internal successors, (718), 2 states have internal predecessors, (718), 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-10-03 15:39:39,748 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:40,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:40,011 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-10-03 15:39:40,011 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-03 15:39:40,012 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-03 15:39:40,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -196566543, now seen corresponding path program 1 times
[2022-10-03 15:39:40,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-03 15:39:40,013 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387518962]
[2022-10-03 15:39:40,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-03 15:39:40,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-03 15:39:40,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-03 15:39:40,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-03 15:39:40,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-03 15:39:40,503 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387518962]
[2022-10-03 15:39:40,503 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387518962] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-03 15:39:40,504 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-03 15:39:40,504 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-10-03 15:39:40,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225645287]
[2022-10-03 15:39:40,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-03 15:39:40,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-10-03 15:39:40,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-03 15:39:40,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-10-03 15:39:40,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-10-03 15:39:40,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:40,508 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-03 15:39:40,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 111.85714285714286) internal successors, (783), 8 states have internal predecessors, (783), 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-10-03 15:39:40,508 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:40,509 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:41,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:39:41,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-10-03 15:39:41,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-10-03 15:39:41,946 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-03 15:39:41,946 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-03 15:39:41,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 1235425339, now seen corresponding path program 1 times
[2022-10-03 15:39:41,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-03 15:39:41,947 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156609872]
[2022-10-03 15:39:41,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-03 15:39:41,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-03 15:39:44,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-03 15:39:51,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 13329 backedges. 4620 proven. 6915 refuted. 0 times theorem prover too weak. 1794 trivial. 0 not checked.
[2022-10-03 15:39:51,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-03 15:39:51,237 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156609872]
[2022-10-03 15:39:51,238 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156609872] provided 0 perfect and 1 imperfect interpolant sequences
[2022-10-03 15:39:51,238 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98718403]
[2022-10-03 15:39:51,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-03 15:39:51,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-03 15:39:51,239 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-03 15:39:51,244 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-10-03 15:39:51,246 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-10-03 15:39:53,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-03 15:39:53,368 INFO  L263         TraceCheckSpWp]: Trace formula consists of 9878 conjuncts, 186 conjunts are in the unsatisfiable core
[2022-10-03 15:39:53,453 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-10-03 15:40:04,930 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 11 treesize of output 7
[2022-10-03 15:40:07,592 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-10-03 15:40:07,593 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-10-03 15:40:12,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 13329 backedges. 7889 proven. 2794 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked.
[2022-10-03 15:40:12,735 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-10-03 15:40:12,778 WARN  L833   $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_906 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_906) |c_#memory_$Pointer$.base|))) (forall ((v_ArrVal_907 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_#memory_$Pointer$.offset|)))) is different from false
[2022-10-03 15:40:12,806 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-03 15:40:12,807 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 1 case distinctions, treesize of input 15 treesize of output 11
[2022-10-03 15:40:12,810 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-03 15:40:12,811 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 1 case distinctions, treesize of input 15 treesize of output 11
[2022-10-03 15:40:13,572 WARN  L833   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false
[2022-10-03 15:40:13,595 WARN  L833   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false
[2022-10-03 15:40:13,616 WARN  L833   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false
[2022-10-03 15:40:13,667 WARN  L833   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false
[2022-10-03 15:40:13,676 WARN  L833   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false
[2022-10-03 15:40:16,094 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 63
[2022-10-03 15:40:16,118 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 9 treesize of output 3
[2022-10-03 15:40:19,151 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-03 15:40:19,151 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 56 treesize of output 40
[2022-10-03 15:40:19,164 INFO  L356             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-03 15:40:19,165 INFO  L390             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 67 treesize of output 73
[2022-10-03 15:40:19,173 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 45 treesize of output 37
[2022-10-03 15:40:37,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 13329 backedges. 7877 proven. 2647 refuted. 53 times theorem prover too weak. 2621 trivial. 131 not checked.
[2022-10-03 15:40:37,573 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [98718403] provided 0 perfect and 2 imperfect interpolant sequences
[2022-10-03 15:40:37,573 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-10-03 15:40:37,575 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 55, 52] total 168
[2022-10-03 15:40:37,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118304726]
[2022-10-03 15:40:37,575 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-10-03 15:40:37,583 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 168 states
[2022-10-03 15:40:37,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-03 15:40:37,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants.
[2022-10-03 15:40:37,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=756, Invalid=25303, Unknown=47, NotChecked=1950, Total=28056
[2022-10-03 15:40:37,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:40:37,598 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-03 15:40:37,603 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 168 states, 168 states have (on average 39.095238095238095) internal successors, (6568), 168 states have internal predecessors, (6568), 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-10-03 15:40:37,603 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:40:37,603 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2022-10-03 15:40:37,603 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:40:49,880 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (@diff |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (or (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2))))))) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|)) (or (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_#memory_$Pointer$.base|)) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= (+ 2 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| (store |c_#memory_$Pointer$.base| .cse4 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4))) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false
[2022-10-03 15:40:49,957 WARN  L833   $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse0)) (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse0))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_#memory_$Pointer$.base|) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false
[2022-10-03 15:40:50,059 WARN  L833   $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse0)) (not (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse0))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_#memory_$Pointer$.base|) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false
[2022-10-03 15:41:23,008 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse26 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse10 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (.cse21 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (+ |c_#StackHeapBarrier| 1)) (.cse11 (select .cse16 .cse26)) (.cse14 (select .cse15 .cse26)) (.cse6 (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse24 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse24 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse25 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse25 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse0 (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (and (or .cse0 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) (<= .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (not (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4))))))) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (let ((.cse8 (+ 4 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))) (or .cse6 (not (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse7 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse7 .cse8)))) .cse0 (not (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse9 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse9 .cse8)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse10 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (or .cse6 .cse0 (not (= .cse11 .cse12)) (not (= .cse13 .cse14))) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_#StackHeapBarrier|) (or (not (= (select .cse15 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse14)) .cse6 .cse0 (not (= (select .cse16 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse11))) (or .cse6 .cse0 (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse11)) (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse14))) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse17 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse18)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse18))))))) (or .cse6 .cse0 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse13)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| .cse12))) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (or .cse6 .cse0 (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|)) (or (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse19 (select .cse20 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse19)))))) .cse0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse21 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (or .cse0 (and (or (and .cse10 (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset|) .cse21) (and (= (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse10 .cse21)) (not (< |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or .cse0 (not (= .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= .cse22 (select .cse23 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (<= .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (or .cse6 .cse0 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| .cse11)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse14))) (or (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|)) .cse6 .cse0 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|)))))) is different from false
[2022-10-03 15:41:23,247 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse0 (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (and (or .cse0 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (not (= (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse3))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_#StackHeapBarrier|) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse5 (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)))))) .cse0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or .cse0 (not (= .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= .cse7 (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) is different from false
[2022-10-03 15:41:23,346 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse0 (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse1)) (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1))))))) (let ((.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) .cse0 (not (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 .cse6)))) (not (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse7 .cse6) (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_#StackHeapBarrier|) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse9)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse9))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|))) is different from false
[2022-10-03 15:41:23,651 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse0 (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse1)) (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (or .cse0 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse6 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse5 (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or .cse0 (not (= .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= .cse7 (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|))) is different from false
[2022-10-03 15:41:24,484 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse24 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse8 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (.cse17 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse9 (select .cse14 .cse24)) (.cse12 (select .cse13 .cse24)) (.cse4 (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse22 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse23 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse23 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (.cse1 (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (or .cse1 (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2))))))) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (let ((.cse6 (+ 4 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))) (or .cse4 (not (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse5 .cse6)))) .cse1 (not (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse7 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse7 .cse6)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (or .cse4 .cse1 (not (= .cse9 .cse10)) (not (= .cse11 .cse12))) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (or (not (= (select .cse13 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse12)) .cse4 .cse1 (not (= (select .cse14 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse9))) (or .cse4 .cse1 (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse9)) (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse12))) (or .cse1 (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select .cse15 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse16)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse16))))))) (or .cse4 .cse1 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse11)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| .cse10))) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (or .cse4 .cse1 (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|)) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse17 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (or .cse1 (and (or (and .cse8 (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset|) .cse17) (and (= (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse8 .cse17)) (not (< |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse19 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or .cse1 (not (= .cse18 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= .cse18 (select .cse19 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (<= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (or (not (<= 0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (and (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse20 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse21 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (or .cse4 .cse1 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| .cse9)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse12))) (or (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|)) .cse4 .cse1 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|)))))) is different from false
[2022-10-03 15:42:21,765 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (@diff |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (or (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2))))))) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|)) (or (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_#memory_$Pointer$.base|)) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= (+ 2 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| (store |c_#memory_$Pointer$.base| .cse4 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4))) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false
[2022-10-03 15:42:22,362 WARN  L833   $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (@diff |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (or (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_899 (Array Int Int)) (|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_899) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2)) (not (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2))))))) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|)) (or (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse4)) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_#memory_$Pointer$.base|)) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= (+ 2 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| (store |c_#memory_$Pointer$.base| .cse4 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| .cse4))) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false
[2022-10-03 15:42:57,681 WARN  L833   $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (or (not (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse0 .cse1)))) (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (not (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse4 .cse1)))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) is different from false
[2022-10-03 15:42:58,010 WARN  L833   $PredicateComparison]: unable to prove that (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (let ((.cse2 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (or (and (forall ((v_ArrVal_901 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_900 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_900) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse2))) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse2)))))) is different from false
[2022-10-03 15:43:29,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-10-03 15:43:29,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-10-03 15:43:29,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 764 states. 
[2022-10-03 15:43:29,661 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-10-03 15:43:29,830 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-10-03 15:43:29,831 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-03 15:43:29,831 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-03 15:43:29,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 1316894131, now seen corresponding path program 1 times
[2022-10-03 15:43:29,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-03 15:43:29,834 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843386857]
[2022-10-03 15:43:29,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-03 15:43:29,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-03 15:43:36,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat