/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_longest.line555.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:45:22,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:45:22,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:45:22,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:45:22,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:45:22,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:45:22,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:45:22,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:45:22,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:45:22,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:45:22,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:45:22,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:45:22,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:45:22,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:45:22,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:45:22,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:45:22,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:45:22,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:45:22,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:45:22,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:45:22,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:45:22,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:45:22,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:45:22,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:45:22,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:45:22,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:45:22,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:45:22,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:45:22,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:45:22,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:45:22,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:45:22,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:45:22,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:45:22,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:45:22,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:45:22,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:45:22,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:45:22,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:45:22,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:45:22,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:45:22,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:45:22,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:45:22,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:45:22,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:45:22,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:45:22,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:45:22,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:45:22,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:45:22,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:45:22,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:45:22,311 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:45:22,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:45:22,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:45:22,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:45:22,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:45:22,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:45:22,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:45:22,315 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:45:22,315 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:45:22,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:45:22,315 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-04 00:45:22,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:45:22,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:45:22,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:45:22,503 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:45:22,504 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:45:22,505 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_longest.line555.bpl [2022-10-04 00:45:22,505 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longest.line555.bpl' [2022-10-04 00:45:22,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:45:22,556 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:45:22,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:45:22,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:45:22,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:45:22,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:45:22,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:45:22,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:45:22,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:45:22,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/1) ... [2022-10-04 00:45:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:45:22,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:22,675 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-04 00:45:22,693 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-04 00:45:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:45:22,712 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:45:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:45:22,712 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:45:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:45:22,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:45:22,713 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:45:22,821 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:45:22,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:45:23,358 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:45:23,379 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:45:23,379 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:45:23,381 INFO L202 PluginConnector]: Adding new model queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:45:23 BoogieIcfgContainer [2022-10-04 00:45:23,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:45:23,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:45:23,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:45:23,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:45:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:45:22" (1/2) ... [2022-10-04 00:45:23,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286915ca and model type queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:45:23, skipping insertion in model container [2022-10-04 00:45:23,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longest.line555.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:45:23" (2/2) ... [2022-10-04 00:45:23,391 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.line555.bpl [2022-10-04 00:45:23,396 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:45:23,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:45:23,402 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:45:23,402 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:45:23,521 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:45:23,565 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:45:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:45:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:23,569 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-04 00:45:23,570 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-04 00:45:23,599 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:45:23,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:45:23,614 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;@42908792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:45:23,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:45:23,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:45:23,672 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:45:23,673 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:45:23,680 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:45:23,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:45:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:23,682 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-10-04 00:45:23,683 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-10-04 00:45:23,686 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:45:23,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:45:23,687 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;@42908792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:45:23,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:45:24,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:45:24,045 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:45:24,048 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:45:24,055 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:45:24,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:45:24,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:24,092 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-10-04 00:45:24,093 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-10-04 00:45:24,096 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:45:24,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:45:24,097 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;@42908792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:45:24,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:45:24,097 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:45:24,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:45:24,098 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:45:24,098 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:45:24,101 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:45:24,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:45:24,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:24,103 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-10-04 00:45:24,104 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-10-04 00:45:24,108 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:45:24,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:45:24,108 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;@42908792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:45:24,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:45:24,420 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:45:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:45:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1625405332, now seen corresponding path program 1 times [2022-10-04 00:45:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:45:24,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769573468] [2022-10-04 00:45:24,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:24,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:45:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1827 trivial. 0 not checked. [2022-10-04 00:45:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:45:24,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769573468] [2022-10-04 00:45:24,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769573468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:45:24,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:45:24,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:45:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820274858] [2022-10-04 00:45:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:45:24,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:45:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:45:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:45:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:45:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:24,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:45:24,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 257.0) internal successors, (514), 2 states have internal predecessors, (514), 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-04 00:45:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:25,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:45:25,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:45:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:45:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1003813813, now seen corresponding path program 1 times [2022-10-04 00:45:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:45:25,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130276165] [2022-10-04 00:45:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:45:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1827 trivial. 0 not checked. [2022-10-04 00:45:25,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:45:25,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130276165] [2022-10-04 00:45:25,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130276165] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:45:25,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:45:25,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:45:25,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184890305] [2022-10-04 00:45:25,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:45:25,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:45:25,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:45:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:45:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:45:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:25,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:45:25,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-04 00:45:25,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:25,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:45:26,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:45:26,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:45:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:45:26,043 INFO L85 PathProgramCache]: Analyzing trace with hash 61927141, now seen corresponding path program 1 times [2022-10-04 00:45:26,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:45:26,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731556037] [2022-10-04 00:45:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:45:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2022-10-04 00:45:26,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:45:26,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731556037] [2022-10-04 00:45:26,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731556037] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:45:26,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:45:26,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:45:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350538918] [2022-10-04 00:45:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:45:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:45:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:45:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:45:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:45:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:26,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:45:26,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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-04 00:45:26,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:26,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:45:26,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:45:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:45:26,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:45:26,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:45:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:45:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash -768038846, now seen corresponding path program 1 times [2022-10-04 00:45:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:45:26,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716978956] [2022-10-04 00:45:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:45:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-04 00:45:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:45:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716978956] [2022-10-04 00:45:26,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716978956] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:45:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339704529] [2022-10-04 00:45:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:26,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:45:26,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:26,815 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-10-04 00:45:26,856 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-10-04 00:45:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:27,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 104 conjunts are in the unsatisfiable core [2022-10-04 00:45:27,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:45:27,283 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-10-04 00:45:27,335 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-10-04 00:45:27,438 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:45:27,438 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-10-04 00:45:27,488 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-10-04 00:45:27,796 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-10-04 00:45:27,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:45:27,937 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-10-04 00:45:28,588 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:45:28,588 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-10-04 00:45:28,603 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-10-04 00:45:28,970 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:45:28,970 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-10-04 00:45:29,268 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:45:29,269 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 34 treesize of output 27 [2022-10-04 00:45:29,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:45:29,515 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-10-04 00:45:29,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-04 00:45:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-10-04 00:45:29,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:45:29,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339704529] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:45:29,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:45:29,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [9] total 46 [2022-10-04 00:45:29,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40357029] [2022-10-04 00:45:29,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:45:29,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-04 00:45:29,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:45:29,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-04 00:45:29,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2022-10-04 00:45:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:29,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:45:29,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 11.552631578947368) internal successors, (439), 38 states have internal predecessors, (439), 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-04 00:45:29,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:29,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:45:29,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:45:29,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:45:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:45:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-10-04 00:45:34,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 00:45:34,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:45:34,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:45:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:45:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1423681173, now seen corresponding path program 1 times [2022-10-04 00:45:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:45:34,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354096502] [2022-10-04 00:45:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:45:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-04 00:45:34,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:45:34,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354096502] [2022-10-04 00:45:34,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354096502] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:45:34,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347478621] [2022-10-04 00:45:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:34,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:45:34,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:34,920 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-10-04 00:45:34,944 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-10-04 00:45:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:35,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 161 conjunts are in the unsatisfiable core [2022-10-04 00:45:35,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:45:35,517 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-10-04 00:45:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:45:35,640 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-10-04 00:45:36,013 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:45:36,013 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 16 treesize of output 22 [2022-10-04 00:45:36,021 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-10-04 00:45:36,416 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:45:36,417 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 25 treesize of output 30 [2022-10-04 00:45:36,633 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-04 00:45:37,040 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 0 case distinctions, treesize of input 21 treesize of output 11 [2022-10-04 00:45:37,134 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 6 treesize of output 5 [2022-10-04 00:45:37,710 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:45:37,710 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 25 treesize of output 30 [2022-10-04 00:45:37,849 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-04 00:45:37,925 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 7 treesize of output 3 [2022-10-04 00:45:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:45:38,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:46:07,048 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) is different from false [2022-10-04 00:46:07,079 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:46:07,099 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:46:07,202 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (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| |c_t1Thread1of1ForFork1_write~int_#value#1|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:46:07,247 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:46:07,271 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:46:07,285 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:46:07,309 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:46:07,324 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))))))) is different from false [2022-10-04 00:46:07,388 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800)))))) is different from false [2022-10-04 00:46:07,564 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int)) (let ((.cse0 (select (store (let ((.cse2 (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_554)))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800)))))) is different from false [2022-10-04 00:46:07,620 WARN L833 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (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_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)))))) is different from false [2022-10-04 00:46:07,654 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false [2022-10-04 00:46:07,767 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-04 00:46:07,768 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 12 treesize of output 11 [2022-10-04 00:46:07,855 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1)))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) is different from false [2022-10-04 00:46:07,923 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int)) (let ((.cse0 (select (store (let ((.cse2 (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_553)))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (store (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) is different from false [2022-10-04 00:46:08,002 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) is different from false [2022-10-04 00:46:08,048 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) is different from false [2022-10-04 00:46:08,099 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) is different from false [2022-10-04 00:46:08,125 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (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_73|) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|))))) is different from false [2022-10-04 00:46:08,206 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse2 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)))))) is different from false [2022-10-04 00:46:08,269 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_554 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (v_ArrVal_553 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_553) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_554))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| v_ArrVal_558) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_561) .cse1) 800)) (< (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_94| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)))))) is different from false [2022-10-04 00:46:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:46:08,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347478621] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:46:08,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:46:08,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 48, 40] total 91 [2022-10-04 00:46:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820937671] [2022-10-04 00:46:08,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:46:08,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-10-04 00:46:08,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:46:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-10-04 00:46:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=774, Invalid=4185, Unknown=95, NotChecked=3318, Total=8372 [2022-10-04 00:46:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:08,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:46:08,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 91 states have (on average 13.505494505494505) internal successors, (1229), 92 states have internal predecessors, (1229), 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-04 00:46:08,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:08,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:08,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:46:08,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-10-04 00:46:08,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.