/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/13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 13:03:00,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 13:03:00,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 13:03:00,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 13:03:00,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 13:03:00,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 13:03:00,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 13:03:00,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 13:03:00,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 13:03:00,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 13:03:00,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 13:03:00,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 13:03:00,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 13:03:00,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 13:03:00,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 13:03:00,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 13:03:00,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 13:03:00,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 13:03:00,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 13:03:00,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 13:03:00,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 13:03:00,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 13:03:00,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 13:03:00,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 13:03:00,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 13:03:00,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 13:03:00,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 13:03:00,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 13:03:00,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 13:03:00,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 13:03:00,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 13:03:00,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 13:03:00,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 13:03:00,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 13:03:00,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 13:03:00,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 13:03:00,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 13:03:00,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 13:03:00,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 13:03:00,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 13:03:00,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 13:03:00,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 13:03:00,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 13:03:00,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 13:03:00,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 13:03:00,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 13:03:00,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 13:03:00,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 13:03:00,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 13:03:00,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 13:03:00,429 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 13:03:00,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 13:03:00,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 13:03:00,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 13:03:00,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 13:03:00,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 13:03:00,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 13:03:00,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 13:03:00,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 13:03:00,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 13:03:00,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 13:03:00,432 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 13:03:00,433 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 13:03:00,433 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 13:03:00,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 13:03:00,433 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 13:03:00,433 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 13:03:00,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 13:03:00,434 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 13:03:00,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 13:03:00,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 13:03:00,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 13:03:00,676 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 13:03:00,678 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 13:03:00,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl [2022-10-03 13:03:00,680 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl' [2022-10-03 13:03:00,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 13:03:00,733 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 13:03:00,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 13:03:00,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 13:03:00,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 13:03:00,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 13:03:00,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 13:03:00,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 13:03:00,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 13:03:00,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/1) ... [2022-10-03 13:03:00,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 13:03:00,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:00,857 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 13:03:00,868 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 13:03:00,897 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-10-03 13:03:00,897 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-10-03 13:03:00,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 13:03:00,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 13:03:00,899 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 13:03:01,015 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 13:03:01,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 13:03:01,394 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 13:03:01,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 13:03:01,411 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-03 13:03:01,414 INFO L202 PluginConnector]: Adding new model 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:03:01 BoogieIcfgContainer [2022-10-03 13:03:01,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 13:03:01,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 13:03:01,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 13:03:01,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 13:03:01,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 01:03:00" (1/2) ... [2022-10-03 13:03:01,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d005b3 and model type 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 01:03:01, skipping insertion in model container [2022-10-03 13:03:01,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:03:01" (2/2) ... [2022-10-03 13:03:01,428 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl [2022-10-03 13:03:01,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 13:03:01,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 13:03:01,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 13:03:01,448 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 13:03:01,556 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-03 13:03:01,620 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 13:03:01,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 13:03:01,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:01,627 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 13:03:01,655 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 13:03:01,679 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 13:03:01,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-03 13:03:01,704 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;@3b281207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 13:03:01,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 13:03:01,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-03 13:03:01,761 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 13:03:01,763 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/3) [2022-10-03 13:03:01,771 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 13:03:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 13:03:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:01,776 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-03 13:03:01,782 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-03 13:03:01,788 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 13:03:01,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == workerErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 13:03:01,790 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;@3b281207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 13:03:01,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 13:03:01,790 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-03 13:03:01,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 13:03:01,791 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 13:03:01,792 INFO L307 ceAbstractionStarter]: Result for error location workerErr0ASSERT_VIOLATIONASSERT was SAFE (2/3) [2022-10-03 13:03:01,797 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 13:03:01,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 13:03:01,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:01,848 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-03 13:03:01,849 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-03 13:03:01,854 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 13:03:01,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == workerErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 13:03:01,856 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;@3b281207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 13:03:01,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 13:03:02,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1575963757, now seen corresponding path program 1 times [2022-10-03 13:03:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992577823] [2022-10-03 13:03:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:02,413 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 13:03:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992577823] [2022-10-03 13:03:02,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992577823] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:02,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:02,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 13:03:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850054641] [2022-10-03 13:03:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:02,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 13:03:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:02,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 13:03:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 13:03:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:02,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:02,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 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 13:03:02,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:02,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 13:03:02,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash -805870413, now seen corresponding path program 1 times [2022-10-03 13:03:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:02,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238679985] [2022-10-03 13:03:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:02,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:03,019 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 13:03:03,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:03,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238679985] [2022-10-03 13:03:03,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238679985] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:03,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:03,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-03 13:03:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705245161] [2022-10-03 13:03:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:03,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 13:03:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:03,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 13:03:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-10-03 13:03:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:03,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:03,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 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 13:03:03,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:03,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:03,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 13:03:03,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2004581018, now seen corresponding path program 1 times [2022-10-03 13:03:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738047289] [2022-10-03 13:03:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-10-03 13:03:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738047289] [2022-10-03 13:03:04,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738047289] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:04,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:04,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 13:03:04,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517793487] [2022-10-03 13:03:04,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:04,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 13:03:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 13:03:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-10-03 13:03:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:04,491 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.142857142857142) internal successors, (276), 21 states have internal predecessors, (276), 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 13:03:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-03 13:03:06,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 13:03:06,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:06,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -553646169, now seen corresponding path program 1 times [2022-10-03 13:03:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:06,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893047382] [2022-10-03 13:03:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-03 13:03:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:06,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893047382] [2022-10-03 13:03:06,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893047382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:06,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:06,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-03 13:03:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335256073] [2022-10-03 13:03:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:06,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-03 13:03:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:06,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-03 13:03:06,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-03 13:03:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:06,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:06,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 35.857142857142854) internal successors, (251), 8 states have internal predecessors, (251), 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 13:03:06,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:06,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:06,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-10-03 13:03:06,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 13:03:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:03:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 13:03:07,747 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 681404444, now seen corresponding path program 1 times [2022-10-03 13:03:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:07,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204941370] [2022-10-03 13:03:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 673 proven. 117 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-10-03 13:03:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204941370] [2022-10-03 13:03:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204941370] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903390292] [2022-10-03 13:03:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:08,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:03:08,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 13:03:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:09,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-03 13:03:09,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:03:09,725 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-03 13:03:10,145 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-10-03 13:03:10,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2022-10-03 13:03:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 375 proven. 9 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2022-10-03 13:03:10,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:03:10,807 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 20 treesize of output 14 [2022-10-03 13:03:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2022-10-03 13:03:11,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903390292] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:11,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 13:03:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [28, 13] total 48 [2022-10-03 13:03:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469456451] [2022-10-03 13:03:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-03 13:03:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-03 13:03:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2022-10-03 13:03:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:11,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:11,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 29.76923076923077) internal successors, (387), 13 states have internal predecessors, (387), 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 13:03:11,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:11,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:11,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 13:03:11,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:03:11,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 13:03:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:03:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:12,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-03 13:03:12,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:12,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -128225669, now seen corresponding path program 2 times [2022-10-03 13:03:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:12,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686016151] [2022-10-03 13:03:12,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 13:03:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:12,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686016151] [2022-10-03 13:03:12,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686016151] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 13:03:12,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 13:03:12,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-03 13:03:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857911030] [2022-10-03 13:03:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:03:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-03 13:03:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-03 13:03:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-10-03 13:03:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:12,894 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:12,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.5) internal successors, (259), 14 states have internal predecessors, (259), 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 13:03:12,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:12,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:12,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 13:03:12,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:03:12,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:03:12,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:03:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:03:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 13:03:14,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:03:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:03:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1267906468, now seen corresponding path program 1 times [2022-10-03 13:03:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:03:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258306658] [2022-10-03 13:03:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:03:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 326 proven. 33 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-10-03 13:03:14,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:03:14,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258306658] [2022-10-03 13:03:14,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258306658] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:03:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227096357] [2022-10-03 13:03:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:03:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:03:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:03:14,820 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-03 13:03:14,821 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-03 13:03:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:03:15,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 152 conjunts are in the unsatisfiable core [2022-10-03 13:03:15,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:03:17,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:03:18,087 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 9 [2022-10-03 13:03:18,903 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 17 treesize of output 9 [2022-10-03 13:03:20,424 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 27 treesize of output 15 [2022-10-03 13:03:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 94 proven. 421 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-03 13:03:20,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:03:22,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:03:22,066 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 20 treesize of output 16 [2022-10-03 13:03:22,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:03:22,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2022-10-03 13:03:23,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:03:23,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 97 [2022-10-03 13:03:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 94 proven. 421 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-03 13:03:23,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227096357] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:03:23,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:03:23,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 45, 38] total 99 [2022-10-03 13:03:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159979388] [2022-10-03 13:03:23,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:03:23,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-10-03 13:03:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:03:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-10-03 13:03:23,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=9147, Unknown=0, NotChecked=0, Total=9702 [2022-10-03 13:03:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:23,698 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:03:23,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 12.444444444444445) internal successors, (1232), 99 states have internal predecessors, (1232), 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 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:03:23,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:04:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:04:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:04:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2022-10-03 13:04:01,953 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-03 13:04:02,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:04:02,135 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:04:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:04:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash -894767568, now seen corresponding path program 2 times [2022-10-03 13:04:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:04:02,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873429796] [2022-10-03 13:04:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:04:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:04:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:04:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 149 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-10-03 13:04:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:04:02,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873429796] [2022-10-03 13:04:02,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873429796] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:04:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121757503] [2022-10-03 13:04:02,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 13:04:02,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:04:02,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:04:02,849 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-03 13:04:02,850 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-03 13:04:03,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 13:04:03,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:04:03,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-03 13:04:03,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:04:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 150 proven. 14 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-10-03 13:04:04,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:04:04,630 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-03 13:04:04,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-10-03 13:04:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-10-03 13:04:04,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121757503] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 13:04:04,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 13:04:04,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [22, 14] total 43 [2022-10-03 13:04:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009956340] [2022-10-03 13:04:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 13:04:04,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-03 13:04:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:04:04,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-03 13:04:04,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1664, Unknown=0, NotChecked=0, Total=1806 [2022-10-03 13:04:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:04,732 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:04:04,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 281 states. [2022-10-03 13:04:04,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2022-10-03 13:04:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:04:15,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-03 13:04:15,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:04:15,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:04:15,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:04:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1952094093, now seen corresponding path program 3 times [2022-10-03 13:04:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:04:15,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670800913] [2022-10-03 13:04:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:04:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:04:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:04:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 224 proven. 118 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-10-03 13:04:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:04:16,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670800913] [2022-10-03 13:04:16,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670800913] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:04:16,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52271419] [2022-10-03 13:04:16,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 13:04:16,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:04:16,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:04:16,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:04:16,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-03 13:04:17,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-03 13:04:17,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:04:17,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 84 conjunts are in the unsatisfiable core [2022-10-03 13:04:17,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:04:17,605 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 13:04:17,605 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-03 13:04:17,874 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 13:04:18,048 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 14 treesize of output 16 [2022-10-03 13:04:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 224 proven. 40 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-10-03 13:04:19,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:04:20,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) is different from false [2022-10-03 13:04:22,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int))) (< 0 (+ (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_419) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 1))) is different from false [2022-10-03 13:04:22,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int))) (< 0 (+ (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_419) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 1))) is different from false [2022-10-03 13:04:22,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_419) |c_~#pqb~0.base|) |c_~#pqb~0.offset|) 1))) is different from false [2022-10-03 13:04:22,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:04:22,733 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 20 treesize of output 21 [2022-10-03 13:04:22,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:04:22,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-10-03 13:04:22,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-03 13:04:23,013 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 13:04:23,013 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 13 treesize of output 12 [2022-10-03 13:04:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 224 proven. 28 refuted. 0 times theorem prover too weak. 272 trivial. 12 not checked. [2022-10-03 13:04:23,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52271419] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:04:23,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:04:23,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 29, 29] total 88 [2022-10-03 13:04:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792581585] [2022-10-03 13:04:23,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:04:23,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-10-03 13:04:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:04:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-10-03 13:04:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=6676, Unknown=4, NotChecked=668, Total=7656 [2022-10-03 13:04:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:23,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:04:23,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 9.25) internal successors, (814), 88 states have internal predecessors, (814), 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 13:04:23,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:23,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 336 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:04:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:04:34,280 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse1 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse1 |c_~#pqb~0.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse3 (select .cse7 |c_~#pqb~0.offset|)) (.cse2 (select .cse7 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse4 (select .cse1 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (<= 0 .cse3) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse5) (<= .cse5 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse5 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse3 0) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_read~int_#value#1| 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse4 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:04:37,452 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse1 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse1 |c_~#pqb~0.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse3 (select .cse7 |c_~#pqb~0.offset|)) (.cse2 (select .cse7 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse4 (select .cse1 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (<= 0 .cse3) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse5) (<= .cse5 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse5 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse3 0) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse4 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:04:39,138 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#pqb~0.base|)) (.cse1 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) 0))) (and (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= (select .cse0 0) 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse1 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:04:39,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#pqb~0.base|)) (.cse1 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) 0))) (and (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= (select .cse0 0) 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse1 1) |c_ULTIMATE.start_write~int_#value#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) is different from false [2022-10-03 13:04:41,095 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse1 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse1 |c_~#pqb~0.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (select .cse3 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse4 (select .cse1 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (<= 0 (select .cse3 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse5) (<= .cse5 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse5 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse4 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:04:43,249 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse1 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse1 |c_~#pqb~0.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (select .cse3 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse4 (select .cse1 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (<= 0 (select .cse3 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse5) (<= .cse5 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse5 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse4 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:04:44,496 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse2 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse2 |c_~#pqb~0.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse3 (select .cse4 0)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (.cse5 (select .cse2 0)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_~#pqb~0.offset|) (= .cse1 0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse2 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse3) (<= 0 (select .cse4 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (<= .cse5 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse6) (<= .cse6 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse6 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse7 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse3 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= 0 .cse8) (<= .cse5 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse7 |c_workerThread1of1ForFork0_read~int_#value#1|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse8 0) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse5 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|) (<= 0 .cse1) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:04:48,798 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse2 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse2 |c_~#pqb~0.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse4 (select .cse9 |c_~#pqb~0.offset|)) (.cse3 (select .cse9 0)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (.cse5 (select .cse2 0)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_~#pqb~0.offset|) (= .cse1 0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse2 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse3) (<= 0 .cse4) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (<= .cse5 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse6) (<= .cse6 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse6 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse4 0) (= .cse7 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse3 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= 0 .cse8) (<= .cse5 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse7 |c_workerThread1of1ForFork0_read~int_#value#1|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse8 0) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse5 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|) (<= 0 .cse1) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:04:51,406 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse1 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse1 |c_~#pqb~0.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse3 (select .cse7 |c_~#pqb~0.offset|)) (.cse2 (select .cse7 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse4 (select .cse1 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (<= 0 .cse3) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse5) (<= .cse5 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse5 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse3 0) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse4 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:05:12,362 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|))) (let ((.cse1 (select |c_#memory_int| |c_~#pqb~0.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse3 (= .cse4 0)) (.cse2 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (<= .cse0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse1 |c_~#pqb~0.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= .cse0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 (select .cse2 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (or .cse3 (= |c_workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (or (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (< 0 |c_workerThread1of1ForFork0_read~int_#value#1|)) (<= 0 .cse0) (<= .cse0 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (or .cse3 (= |c_workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= .cse4 |c_workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (forall ((v_ArrVal_420 Int)) (or (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)) (< 0 (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)))) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (<= 0 (select .cse2 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|)) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|) (forall ((v_ArrVal_420 Int)) (or (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)) (< 0 (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) |c_workerThread1of1ForFork0_read~int_#ptr#1.offset|))))))) is different from false [2022-10-03 13:05:17,669 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse2 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse2 |c_~#pqb~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse4 (select .cse7 |c_~#pqb~0.offset|)) (.cse3 (select .cse7 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse5 (select .cse2 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (<= .cse1 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse2 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse3) (<= 0 .cse4) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse5 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse1) (<= .cse1 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse1 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse4 0) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_read~int_#value#1| 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse3 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse5 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (<= 0 (select .cse7 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse5 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:05:19,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse1 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) 0)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse2 (select .cse0 0))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse2 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse3) (<= .cse3 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse3 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse4 0) (= |c_ULTIMATE.start_read~int_#value#1| 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse1 1) |c_ULTIMATE.start_write~int_#value#1|) (<= .cse2 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= .cse2 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:05:22,582 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse1 |c_~#pqb~0.offset|)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse3 (select .cse1 0))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse3 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse4) (<= .cse4 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse4 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse5 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= .cse3 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse5 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= .cse3 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:05:26,050 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse1 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) 0)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse2 (select .cse0 0))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse2 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse3) (<= .cse3 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse3 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse1 1) |c_ULTIMATE.start_write~int_#value#1|) (<= .cse2 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= .cse2 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:05:27,278 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (.cse3 (select .cse0 0)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_~#pqb~0.offset|) (= .cse1 0) (= (select |c_#valid| 3) 1) (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (<= .cse3 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse4) (<= .cse4 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse4 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse5 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= 0 .cse6) (<= .cse3 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= .cse5 |c_workerThread1of1ForFork0_read~int_#value#1|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= .cse6 0) (<= .cse3 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|) (<= 0 .cse1) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:05:33,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|))) (let ((.cse1 (select |c_#memory_int| |c_~#pqb~0.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (= .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse1 |c_~#pqb~0.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= .cse0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (or .cse2 (= |c_workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) (or (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (< 0 |c_workerThread1of1ForFork0_read~int_#value#1|)) (<= 0 .cse0) (<= .cse0 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (or .cse2 (= |c_workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= .cse3 |c_workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (forall ((v_ArrVal_420 Int)) (or (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)) (< 0 (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|) |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= .cse3 |c_workerThread1of1ForFork0_read~int_#value#1|) (= |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|)) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (forall ((v_ArrVal_420 Int)) (or (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)) (< 0 (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) |c_workerThread1of1ForFork0_read~int_#ptr#1.offset|))))))) is different from false [2022-10-03 13:05:36,500 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#pqb~0.base|)) (.cse5 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (select .cse5 0)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse3 (select .cse0 0))) (and (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 (select .cse0 |c_~#pqb~0.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= .cse1 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse0 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse3 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse1) (<= .cse1 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse1 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse4 0) (= |c_ULTIMATE.start_read~int_#value#1| 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= .cse3 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse5 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= .cse3 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:05:46,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse2 0)) (.cse1 (select (select |c_#memory_int| |c_~#pqb~0.base|) 0))) (and (forall ((v_ArrVal_420 Int)) (or (< v_ArrVal_420 (+ 1 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|)) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset| v_ArrVal_420)) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)))) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= (select |c_#valid| 3) 1) (<= 0 .cse0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse1 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= |c_ULTIMATE.start_pqueue_put_#t~post4#1| 0) (= |c_ULTIMATE.start_read~int_#value#1| 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse0 1) |c_ULTIMATE.start_write~int_#value#1|) (<= .cse1 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|) |c_workerThread1of1ForFork0_read~int_#value#1|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse2 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= .cse1 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 347 states. [2022-10-03 13:05:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:05:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 313 states. [2022-10-03 13:05:51,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-03 13:05:51,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:05:51,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:05:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:05:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash 334406659, now seen corresponding path program 4 times [2022-10-03 13:05:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:05:51,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092959371] [2022-10-03 13:05:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:05:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:05:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:05:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 459 proven. 105 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-10-03 13:05:52,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:05:52,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092959371] [2022-10-03 13:05:52,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092959371] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:05:52,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853356595] [2022-10-03 13:05:52,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-03 13:05:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:05:52,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:05:52,527 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:05:52,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-03 13:05:52,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-03 13:05:52,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:05:52,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 142 conjunts are in the unsatisfiable core [2022-10-03 13:05:52,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:05:58,149 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 13:05:58,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 13:05:58,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-10-03 13:05:59,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 13:05:59,605 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 13:05:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 629 proven. 456 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-10-03 13:05:59,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:06:00,209 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 28 treesize of output 24 [2022-10-03 13:06:01,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 13:06:01,094 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 20 treesize of output 16 [2022-10-03 13:06:02,818 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-03 13:06:02,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-10-03 13:06:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 505 proven. 556 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-10-03 13:06:04,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853356595] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:06:04,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:06:04,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37, 39] total 104 [2022-10-03 13:06:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087720987] [2022-10-03 13:06:04,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:06:04,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-10-03 13:06:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:06:04,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-10-03 13:06:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=10151, Unknown=0, NotChecked=0, Total=10712 [2022-10-03 13:06:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:06:04,391 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:06:04,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 12.932692307692308) internal successors, (1345), 104 states have internal predecessors, (1345), 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 13:06:04,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:06:04,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:06:04,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:06:04,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:06:04,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:06:04,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:06:04,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 347 states. [2022-10-03 13:06:04,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:06:04,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 313 states. [2022-10-03 13:06:04,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:07:49,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|)) (.cse2 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse0 (select .cse2 |c_~#pqb~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse3 (select .cse4 0)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse5 (select .cse2 0))) (and (= 3 |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) 1) (= |c_ULTIMATE.start_pqueue_init_~qp#1.offset| |c_~#pqb~0.offset|) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= 0 .cse0) (<= .cse1 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse2 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse3) (<= 0 (select .cse4 |c_~#pqb~0.offset|)) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse5 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse1) (<= .cse1 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse1 0) (not (= 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_#in~qp#1.base|) (<= |c_~#pqb~0.base| |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse6 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| 3) 1) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse3 1) |c_ULTIMATE.start_write~int_#value#1|) (<= |c_ULTIMATE.start_#Ultimate.allocInit_ptrBase#1| |c_~#pqb~0.base|) (<= .cse5 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (not (= |c_~#pqb~0.base| |c_ULTIMATE.start_main_~#tid~0#1.base|)) (= .cse6 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (not (= 3 |c_ULTIMATE.start_main_~#tid~0#1.base|)) (<= 0 (select .cse4 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |c_ULTIMATE.start_pqueue_init_#in~qp#1.offset| |c_~#pqb~0.offset|) (<= .cse5 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_pqueue_init_~qp#1.base|)))) is different from false [2022-10-03 13:08:36,222 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#pqb~0.base|)) (.cse5 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#pqb~0.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (.cse2 (select .cse5 0)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (.cse3 (select .cse1 0))) (and (<= .cse0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= 0 (select .cse1 |c_~#pqb~0.offset|)) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (<= .cse0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= (select |c_#valid| 3) 1) (<= 0 (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= 0 .cse2) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_~#pqb~0.base|) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= .cse3 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_~#pqb~0.offset|) (<= 0 .cse0) (<= .cse0 |c_ULTIMATE.start_read~int_#value#1|) (= |c_~#pqb~0.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse0 0) (forall ((v_ArrVal_420 Int)) (or (not (= (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_420)) |c_#memory_int|)) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_420)))) (= |c_ULTIMATE.start_pqueue_put_~qp#1.base| |c_workerThread1of1ForFork0_read~int_#ptr#1.base|) (= |c_~#pqb~0.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (= .cse4 0) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |c_workerThread1of1ForFork0_read~int_#ptr#1.offset| |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 0) (<= (+ .cse2 1) |c_ULTIMATE.start_write~int_#value#1|) (<= .cse3 |c_workerThread1of1ForFork0_pqueue_get_#t~mem6#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| |c_~#pqb~0.offset|) (= .cse4 |c_workerThread1of1ForFork0_read~int_#value#1|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_pqueue_put_~qp#1.base|) |c_ULTIMATE.start_pqueue_put_~qp#1.offset|) |c_ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 0 (select .cse5 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (<= .cse3 |c_workerThread1of1ForFork0_read~int_#value#1|) (not (= 0 |c_ULTIMATE.start_write~int_#value#1|)) (<= 0 |c_ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |c_ULTIMATE.start_pqueue_put_~qp#1.offset| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |c_~#pqb~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#pqb~0.base| 3) (= |c_~#pqb~0.base| |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|)))) is different from false [2022-10-03 13:09:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:09:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:09:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2022-10-03 13:09:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 827 states. [2022-10-03 13:09:35,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-03 13:09:35,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-03 13:09:35,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONASSERT === [workerErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 13:09:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 13:09:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 307001347, now seen corresponding path program 5 times [2022-10-03 13:09:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 13:09:35,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621388526] [2022-10-03 13:09:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 13:09:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 13:09:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 13:09:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 1641 proven. 585 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2022-10-03 13:09:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 13:09:38,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621388526] [2022-10-03 13:09:38,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621388526] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 13:09:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041953473] [2022-10-03 13:09:38,604 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-03 13:09:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:09:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 13:09:38,612 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 13:09:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-03 13:09:38,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-10-03 13:09:38,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 13:09:38,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 135 conjunts are in the unsatisfiable core [2022-10-03 13:09:38,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 13:09:40,060 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-10-03 13:09:40,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2022-10-03 13:09:43,833 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 13:09:43,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 54 [2022-10-03 13:09:44,209 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-03 13:09:44,932 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 13:09:44,932 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 23 treesize of output 22 [2022-10-03 13:09:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 1380 proven. 164 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2022-10-03 13:09:45,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 13:09:45,867 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 66 treesize of output 60 [2022-10-03 13:10:10,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:10:10,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 13:10:10,713 INFO L356 Elim1Store]: treesize reduction 4, result has 88.2 percent of original size [2022-10-03 13:10:10,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 69 [2022-10-03 13:10:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 1465 proven. 45 refuted. 34 times theorem prover too weak. 1116 trivial. 0 not checked. [2022-10-03 13:10:10,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041953473] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 13:10:10,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 13:10:10,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 45, 39] total 137 [2022-10-03 13:10:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301459729] [2022-10-03 13:10:10,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 13:10:10,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2022-10-03 13:10:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 13:10:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2022-10-03 13:10:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=969, Invalid=17649, Unknown=14, NotChecked=0, Total=18632 [2022-10-03 13:10:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:10:10,894 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 13:10:10,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 137 states have (on average 10.540145985401459) internal successors, (1444), 137 states have internal predecessors, (1444), 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 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 413 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-10-03 13:10:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2022-10-03 13:10:10,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 827 states. [2022-10-03 13:10:10,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 13:10:37,006 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 50 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:10:46,089 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 50 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:10:55,172 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 51 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:11:04,089 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 51 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:11:16,737 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 146 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:11:25,121 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 110 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:14:42,574 WARN L233 SmtUtils]: Spent 20.00s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 13:15:27,907 WARN L233 SmtUtils]: Spent 22.73s on a formula simplification. DAG size of input: 66 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-10-03 13:16:04,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:04,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:04,175 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:04,175 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:04,175 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 13:16:04,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-03 13:16:05,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 13:16:05,031 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 381 known predicates. [2022-10-03 13:16:05,031 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location workerErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 13:16:05,032 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2022-10-03 13:16:05,033 INFO L307 ceAbstractionStarter]: Result for error location workerErr0ASSERT_VIOLATIONASSERT was TIMEOUT (3/3) [2022-10-03 13:16:05,035 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 13:16:05,036 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 13:16:05,038 INFO L202 PluginConnector]: Adding new model 13-privatized_68-pfscan_protected_loop_minimal_interval_true.line331.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 01:16:05 BasicIcfg [2022-10-03 13:16:05,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 13:16:05,040 INFO L158 Benchmark]: Toolchain (without parser) took 784305.79ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.5MB in the beginning and 292.0MB in the end (delta: -169.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-03 13:16:05,041 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 13:16:05,042 INFO L158 Benchmark]: Boogie Preprocessor took 76.39ms. Allocated memory is still 172.0MB. Free memory was 122.5MB in the beginning and 119.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-03 13:16:05,043 INFO L158 Benchmark]: RCFGBuilder took 593.80ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 119.8MB in the beginning and 190.1MB in the end (delta: -70.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-10-03 13:16:05,045 INFO L158 Benchmark]: TraceAbstraction took 783622.41ms. Allocated memory was 230.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 189.5MB in the beginning and 292.0MB in the end (delta: -102.5MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-03 13:16:05,046 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 76.39ms. Allocated memory is still 172.0MB. Free memory was 122.5MB in the beginning and 119.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 593.80ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 119.8MB in the beginning and 190.1MB in the end (delta: -70.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * TraceAbstraction took 783622.41ms. Allocated memory was 230.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 189.5MB in the beginning and 292.0MB in the end (delta: -102.5MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 70, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 154, positive: 145, positive conditional: 145, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 15, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1107, positive: 1040, positive conditional: 1040, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 912, Positive conditional cache size: 0, Positive unconditional cache size: 912, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 79, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 996, positive: 940, positive conditional: 940, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1416, Positive conditional cache size: 0, Positive unconditional cache size: 1416, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 133, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8872, positive: 8473, positive conditional: 8473, positive unconditional: 0, negative: 399, negative conditional: 399, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 4228, Positive cache size: 4213, Positive conditional cache size: 0, Positive unconditional cache size: 4213, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Independence queries for same thread: 517, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7962, positive: 7634, positive conditional: 7634, positive unconditional: 0, negative: 328, negative conditional: 328, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 4599, Positive cache size: 4584, Positive conditional cache size: 0, Positive unconditional cache size: 4584, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Independence queries for same thread: 836, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11556, positive: 11032, positive conditional: 11032, positive unconditional: 0, negative: 524, negative conditional: 524, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 5518, Positive cache size: 5497, Positive conditional cache size: 0, Positive unconditional cache size: 5497, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Independence queries for same thread: 1339, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14544, positive: 13702, positive conditional: 13702, positive unconditional: 0, negative: 842, negative conditional: 842, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 7533, Positive cache size: 7511, Positive conditional cache size: 0, Positive unconditional cache size: 7511, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Independence queries for same thread: 2163, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 28451, positive: 27003, positive conditional: 27003, positive unconditional: 0, negative: 1448, negative conditional: 1448, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 8181, Positive cache size: 8158, Positive conditional cache size: 0, Positive unconditional cache size: 8158, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 3576, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32005, positive: 30644, positive conditional: 30644, positive unconditional: 0, negative: 1361, negative conditional: 1361, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 8353, Positive cache size: 8329, Positive conditional cache size: 0, Positive unconditional cache size: 8329, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Independence queries for same thread: 4905, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 72733, positive: 69636, positive conditional: 69636, positive unconditional: 0, negative: 3097, negative conditional: 3097, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 8360, Positive cache size: 8336, Positive conditional cache size: 0, Positive unconditional cache size: 8336, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Independence queries for same thread: 7943, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 28889, positive: 27937, positive conditional: 27937, positive unconditional: 0, negative: 952, negative conditional: 952, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 207339, positive: 198250, positive conditional: 198250, positive unconditional: 0, negative: 9089, negative conditional: 9089, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198461, positive: 198250, positive conditional: 0, positive unconditional: 198250, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8402, positive: 8377, positive conditional: 0, positive unconditional: 8377, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 198461, positive: 189873, positive conditional: 0, positive unconditional: 189873, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 8402, unknown conditional: 0, unknown unconditional: 8402] , Statistics on independence cache: Total cache size (in pairs): 8402, Positive cache size: 8377, Positive conditional cache size: 0, Positive unconditional cache size: 8377, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 8878, Statistics for Abstraction: - TimeoutResultAtElement [Line: 331]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 381 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 389 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: workerErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 389 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: workerErr0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 3 procedures, 389 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 783.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 709.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2080, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 69.1s InterpolantComputationTime, 9541 NumberOfCodeBlocks, 8955 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 13666 ConstructedInterpolants, 480 QuantifiedInterpolants, 104243 SizeOfPredicates, 319 NumberOfNonLiveVariables, 7152 ConjunctsInSsa, 590 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 16055/19241 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown