/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok.line519.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:50:58,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:50:58,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:50:58,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:50:58,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:50:58,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:50:58,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:50:58,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:50:58,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:50:58,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:50:58,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:50:58,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:50:58,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:50:58,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:50:58,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:50:58,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:50:58,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:50:58,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:50:58,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:50:58,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:50:58,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:50:58,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:50:58,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:50:58,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:50:58,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:50:58,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:50:58,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:50:58,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:50:58,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:50:58,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:50:58,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:50:58,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:50:58,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:50:58,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:50:58,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:50:58,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:50:58,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:50:58,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:50:58,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:50:58,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:50:58,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:50:58,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:50:58,642 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:50:58,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:50:58,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:50:58,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:50:58,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:50:58,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:50:58,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:50:58,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:50:58,645 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:50:58,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:50:58,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:50:58,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:50:58,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:50:58,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:50:58,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:50:58,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:50:58,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:50:58,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:50:58,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:50:58,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:50:58,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:50:58,648 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:50:58,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:50:58,649 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-04 00:50:58,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:50:58,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:50:58,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:50:58,859 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:50:58,860 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:50:58,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok.line519.bpl [2022-10-04 00:50:58,861 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok.line519.bpl' [2022-10-04 00:50:58,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:50:58,905 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:50:58,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:50:58,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:50:58,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:50:58,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:58,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:50:58,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:50:58,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:50:58,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:50:58,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/1) ... [2022-10-04 00:50:59,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:50:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:50:59,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-04 00:50:59,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-04 00:50:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:50:59,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:50:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:50:59,083 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:50:59,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:50:59,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:50:59,084 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:50:59,192 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:50:59,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:50:59,677 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:50:59,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:50:59,695 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:50:59,698 INFO L202 PluginConnector]: Adding new model queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:50:59 BoogieIcfgContainer [2022-10-04 00:50:59,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:50:59,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:50:59,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:50:59,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:50:59,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:58" (1/2) ... [2022-10-04 00:50:59,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5add310c and model type queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:50:59, skipping insertion in model container [2022-10-04 00:50:59,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:50:59" (2/2) ... [2022-10-04 00:50:59,711 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.line519.bpl [2022-10-04 00:50:59,717 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:50:59,727 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:50:59,727 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:50:59,727 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:50:59,880 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:50:59,943 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:50:59,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:50:59,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:50:59,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:50:59,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-04 00:50:59,974 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:50:59,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:50:59,985 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;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:50:59,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:51:00,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:51:00,057 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:51:00,059 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:51:00,083 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:51:00,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:51:00,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:00,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:51:00,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 00:51:00,093 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:51:00,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:51:00,094 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;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:51:00,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:51:00,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:51:00,448 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:51:00,450 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:51:00,460 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:51:00,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:51:00,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:00,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:51:00,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 00:51:00,501 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:51:00,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:51:00,502 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;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:51:00,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:51:00,502 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:51:00,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:51:00,502 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:51:00,503 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:51:00,507 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:51:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:51:00,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:00,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:51:00,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 00:51:00,522 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:51:00,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:51:00,523 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;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:51:00,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:51:00,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1694365332, now seen corresponding path program 1 times [2022-10-04 00:51:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519532895] [2022-10-04 00:51:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:00,975 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-04 00:51:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:00,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519532895] [2022-10-04 00:51:00,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519532895] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:51:00,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:51:00,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:51:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144118681] [2022-10-04 00:51:00,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:51:00,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:51:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:51:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:51:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:01,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:01,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:51:01,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1858318944, now seen corresponding path program 1 times [2022-10-04 00:51:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:01,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124158960] [2022-10-04 00:51:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:01,294 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-04 00:51:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:01,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124158960] [2022-10-04 00:51:01,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124158960] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:51:01,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:51:01,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:51:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221634893] [2022-10-04 00:51:01,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:51:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:51:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:01,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:51:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:51:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:01,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:01,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:51:01,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1962206620, now seen corresponding path program 1 times [2022-10-04 00:51:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:01,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49131938] [2022-10-04 00:51:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:01,447 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-04 00:51:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:01,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49131938] [2022-10-04 00:51:01,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49131938] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:51:01,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:51:01,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:51:01,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369379989] [2022-10-04 00:51:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:51:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:51:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:51:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:51:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:01,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:01,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:51:01,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:01,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash -308886063, now seen corresponding path program 1 times [2022-10-04 00:51:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:01,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722846525] [2022-10-04 00:51:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-04 00:51:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722846525] [2022-10-04 00:51:01,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722846525] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:51:01,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:51:01,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:51:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590728227] [2022-10-04 00:51:01,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:51:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:51:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:51:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:51:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:01,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:01,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:01,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 00:51:01,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1033126061, now seen corresponding path program 2 times [2022-10-04 00:51:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:01,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331948774] [2022-10-04 00:51:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:01,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331948774] [2022-10-04 00:51:01,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331948774] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:51:01,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087044411] [2022-10-04 00:51:01,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:51:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:01,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:01,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:51:01,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 00:51:02,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-04 00:51:02,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:51:02,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-04 00:51:02,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:51:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-04 00:51:02,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:51:02,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087044411] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:51:02,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:51:02,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-10-04 00:51:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779623197] [2022-10-04 00:51:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:51:02,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:51:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:51:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-04 00:51:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:02,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:02,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:02,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:02,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:02,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:02,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:02,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-04 00:51:02,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:02,510 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1374952097, now seen corresponding path program 1 times [2022-10-04 00:51:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:02,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229969164] [2022-10-04 00:51:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229969164] [2022-10-04 00:51:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229969164] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:51:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417313956] [2022-10-04 00:51:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:02,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:02,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:51:02,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 00:51:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:02,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-04 00:51:02,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:51:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:02,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:51:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417313956] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:51:02,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:51:02,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-04 00:51:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215828487] [2022-10-04 00:51:02,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:51:02,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-04 00:51:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-04 00:51:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-04 00:51:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:02,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:02,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.5) internal successors, (525), 10 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:02,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:02,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:02,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:02,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:02,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:02,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:03,096 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-04 00:51:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:03,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1814467147, now seen corresponding path program 2 times [2022-10-04 00:51:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:03,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862841656] [2022-10-04 00:51:03,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:03,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862841656] [2022-10-04 00:51:03,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862841656] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:51:03,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322860625] [2022-10-04 00:51:03,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:51:03,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:03,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:03,500 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-04 00:51:03,501 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-04 00:51:03,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:51:03,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:51:03,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-04 00:51:03,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:51:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:03,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:51:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:04,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322860625] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:51:04,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:51:04,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-10-04 00:51:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940518687] [2022-10-04 00:51:04,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:51:04,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-04 00:51:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-04 00:51:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-10-04 00:51:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:04,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:04,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 46.94444444444444) internal successors, (845), 18 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:04,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:04,492 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-04 00:51:04,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:04,686 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:04,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1840392607, now seen corresponding path program 3 times [2022-10-04 00:51:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:04,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384432236] [2022-10-04 00:51:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:04,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 0 proven. 1687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:05,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:05,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384432236] [2022-10-04 00:51:05,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384432236] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:51:05,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776682252] [2022-10-04 00:51:05,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-04 00:51:05,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:05,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:05,125 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-04 00:51:05,126 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-04 00:51:05,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-04 00:51:05,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:51:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-04 00:51:05,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:51:07,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:51:07,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:51:07,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:51:07,456 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:51:07,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:51:07,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:51:07,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:51:07,594 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-04 00:51:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 487 proven. 370 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2022-10-04 00:51:07,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:51:33,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-10-04 00:51:33,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-10-04 00:51:33,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-10-04 00:51:33,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:51:33,965 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-04 00:51:33,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:51:33,974 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-04 00:51:33,978 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 11 treesize of output 7 [2022-10-04 00:51:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 442 proven. 350 refuted. 0 times theorem prover too weak. 830 trivial. 65 not checked. [2022-10-04 00:51:34,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776682252] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:51:34,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:51:34,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 22] total 57 [2022-10-04 00:51:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526033779] [2022-10-04 00:51:34,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:51:34,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-04 00:51:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-04 00:51:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2597, Unknown=58, NotChecked=318, Total=3192 [2022-10-04 00:51:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:34,899 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 28.49122807017544) internal successors, (1624), 57 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:35,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:51:35,306 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:35,309 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork1_~i~0#1| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:36,049 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= .cse0 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:51:36,609 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (<= .cse0 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* .cse0 4))) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:38,044 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 1) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:51:38,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:51:38,363 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:38,367 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:39,233 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= .cse1 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (forall ((v_ArrVal_466 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_466)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:39,726 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (<= .cse0 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* .cse0 4))) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:41,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (<= |c_t1Thread1of1ForFork1_~i~0#1| 3) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 1) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:51:41,341 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:51:41,344 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:41,346 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:43,250 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 5) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= .cse1 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (forall ((v_ArrVal_466 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_466)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:43,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (<= .cse0 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 5) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* .cse0 4))) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:44,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 1) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_~i~0#1| 5) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:51:45,414 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6))) is different from false [2022-10-04 00:51:45,417 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6)) is different from false [2022-10-04 00:51:45,420 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_~i~0#1| 6)) is different from false [2022-10-04 00:51:47,759 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= .cse1 1) (<= |c_t1Thread1of1ForFork1_~i~0#1| 7) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (forall ((v_ArrVal_466 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_466)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:48,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) (<= .cse0 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* .cse0 4))) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:49,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 1) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:51:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-10-04 00:51:49,410 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-04 00:51:49,604 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,SelfDestructingSolverStorable7 [2022-10-04 00:51:49,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:49,605 INFO L85 PathProgramCache]: Analyzing trace with hash -82736524, now seen corresponding path program 1 times [2022-10-04 00:51:49,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:49,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516824716] [2022-10-04 00:51:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:49,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516824716] [2022-10-04 00:51:50,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516824716] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:51:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949096809] [2022-10-04 00:51:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:50,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:50,025 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-04 00:51:50,031 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-04 00:51:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:50,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-04 00:51:50,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:51:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:50,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:51:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:51,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949096809] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:51:51,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:51:51,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2022-10-04 00:51:51,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906224256] [2022-10-04 00:51:51,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:51:51,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-04 00:51:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:51,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-04 00:51:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2022-10-04 00:51:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:51,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:51,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 45.60526315789474) internal successors, (1733), 38 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2022-10-04 00:51:51,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:51,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:51:51,972 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int) (v_ArrVal_463 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:51,975 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_463 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_63| v_ArrVal_463) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:51:52,691 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 1) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| Int)) (or (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| v_ArrVal_466) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_52| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) (<= .cse1 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| .cse0) (forall ((v_ArrVal_466 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_466)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-10-04 00:51:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-04 00:51:53,081 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-04 00:51:53,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:53,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1150484001, now seen corresponding path program 2 times [2022-10-04 00:51:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312356198] [2022-10-04 00:51:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:51:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10557 backedges. 0 proven. 10557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:51:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312356198] [2022-10-04 00:51:54,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312356198] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:51:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419558723] [2022-10-04 00:51:54,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:51:54,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:51:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:51:54,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:51:54,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-04 00:51:55,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:51:55,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:51:55,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 3719 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-04 00:51:55,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:51:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10557 backedges. 0 proven. 10557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:56,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:51:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10557 backedges. 0 proven. 10557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:51:57,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419558723] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:51:57,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:51:57,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 43 [2022-10-04 00:51:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219792239] [2022-10-04 00:51:57,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:51:57,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-10-04 00:51:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:51:57,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-10-04 00:51:57,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-10-04 00:51:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:57,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:51:57,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 46.13953488372093) internal successors, (1984), 43 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:57,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2022-10-04 00:51:57,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-04 00:51:57,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-10-04 00:51:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-04 00:51:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:51:58,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-04 00:51:58,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-04 00:51:58,333 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:51:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:51:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -81021996, now seen corresponding path program 3 times [2022-10-04 00:51:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:51:58,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994324846] [2022-10-04 00:51:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:51:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:51:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:52:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14815 backedges. 6396 proven. 2262 refuted. 0 times theorem prover too weak. 6157 trivial. 0 not checked. [2022-10-04 00:52:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:52:03,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994324846] [2022-10-04 00:52:03,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994324846] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:52:03,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466668530] [2022-10-04 00:52:03,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-04 00:52:03,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:52:03,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:03,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:52:03,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-04 00:52:04,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-10-04 00:52:04,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:52:04,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 115 conjunts are in the unsatisfiable core [2022-10-04 00:52:04,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:52:08,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:52:08,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:52:08,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:52:08,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:52:08,473 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:52:08,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:52:08,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:52:08,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:52:08,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:52:08,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:52:08,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:52:08,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:52:08,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:52:09,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:52:09,177 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:52:09,177 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 31 treesize of output 27 [2022-10-04 00:52:09,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:52:09,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:52:09,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:52:09,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:52:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14815 backedges. 4236 proven. 1134 refuted. 0 times theorem prover too weak. 9445 trivial. 0 not checked. [2022-10-04 00:52:09,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:52:13,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-10-04 00:52:13,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1329 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-10-04 00:52:13,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-10-04 00:52:14,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:52:14,035 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-04 00:52:14,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:52:14,042 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-04 00:52:14,047 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 11 treesize of output 7 [2022-10-04 00:52:57,508 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1322 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| v_ArrVal_1322) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 19))))) is different from false [2022-10-04 00:52:57,520 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1322 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| v_ArrVal_1322) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 19)))) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) is different from false [2022-10-04 00:52:57,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:52:57,555 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 29 treesize of output 30 [2022-10-04 00:52:57,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:52:57,562 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 43 treesize of output 46 [2022-10-04 00:52:57,565 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 28 treesize of output 24 [2022-10-04 00:52:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14815 backedges. 3948 proven. 1058 refuted. 0 times theorem prover too weak. 9445 trivial. 364 not checked. [2022-10-04 00:52:59,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466668530] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:52:59,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:52:59,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 39, 39] total 115 [2022-10-04 00:52:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622067796] [2022-10-04 00:52:59,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:52:59,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-10-04 00:52:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:52:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-10-04 00:52:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=11210, Unknown=86, NotChecked=1100, Total=13110 [2022-10-04 00:52:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:59,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:52:59,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 15.278260869565218) internal successors, (1757), 115 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:52:59,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:00,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 84) 1) (= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1322 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| v_ArrVal_1322) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 19)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:00,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1322 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| v_ArrVal_1322) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 19)))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= (select .cse0 84) 1) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:00,394 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1322 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_200| v_ArrVal_1322) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 19)))) (= (select .cse0 84) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:02,708 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= (+ 76 (* |c_t1Thread1of1ForFork1_write~int_#value#1| 4)) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 1) (<= (select .cse0 .cse1) 2) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 2) (= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 1) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= (select .cse2 .cse1) 2) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= (select .cse0 84) 2) (<= (select .cse2 84) 2) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (< (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 19) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 4) 8) (forall ((v_ArrVal_1329 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= .cse1 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:02,711 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (<= (select .cse0 84) 2) (forall ((v_ArrVal_1329 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:02,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= (select .cse0 84) 2) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1329 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:03,539 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (<= (select .cse0 84) 2) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse1 .cse2) 2) (not (= (select .cse3 84) 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1322 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_1322) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 19)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (<= (select .cse4 .cse2) 2) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select .cse5 84) .cse6) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= (select .cse1 84) 2) (<= (select .cse5 .cse2) 2) (<= (select .cse4 84) 2) (<= (select .cse0 .cse2) 2) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (< (select .cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 19) (<= (select .cse3 .cse2) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|)) (< .cse6 19) (forall ((v_ArrVal_1325 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_1325)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (<= (* .cse6 4) 8) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:53:03,920 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (= (select .cse0 84) .cse1) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (<= (* .cse1 4) 8) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:53:04,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (= (select .cse0 84) |c_t1Thread1of1ForFork1_read~int_#value#1|) (<= (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 8) (= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:53:04,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 8) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_1325 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19)))) (= (select .cse0 84) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:53:05,003 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 8) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_1325 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19)))) (= (select .cse0 84) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:53:05,582 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (<= (select .cse0 84) 2) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (< (select .cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (= |c_~#queue~0.offset| 0) (<= (select .cse2 .cse3) 2) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 84) 2) (<= (select .cse0 .cse3) 2) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3) 2) (<= (* (select .cse1 84) 4) 8) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_188| Int)) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_188|)) (forall ((v_ArrVal_1325 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_188| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19)))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 84) 20)))) is different from false [2022-10-04 00:53:05,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= (select .cse0 84) 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_188| Int)) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_188|)) (forall ((v_ArrVal_1325 Int)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_188| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19)))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:53:06,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (<= (select .cse0 84) 2) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (<= (select .cse1 .cse2) 2) (= (select .cse3 84) .cse4) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| .cse5) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse3 .cse2) 2) (<= (select .cse1 84) 2) (<= (select .cse0 .cse2) 2) (<= .cse5 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 2) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< .cse4 19) (not (= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (forall ((v_ArrVal_1325 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_1325)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (<= (* .cse4 4) 8) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 84) 20)))) is different from false [2022-10-04 00:53:07,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|))) (let ((.cse0 (select .cse1 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 20)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< .cse0 19) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (not (= .cse0 20)) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 2)))) is different from false [2022-10-04 00:53:07,437 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 2) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 2) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 20)) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 19) (not (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:53:08,044 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| Int) (v_ArrVal_1325 Int)) (or (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189| v_ArrVal_1325) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 19) (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_189|))) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 20)) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (< .cse0 19) (not (= .cse0 20)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:08,527 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 19) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| 84) (< |c_t1Thread1of1ForFork1_write~int_#value#1| 20) (not (= (select .cse0 84) 20)) (< |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 19) (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 20) (< |c_t1Thread1of1ForFork1_read~int_#value#1| 19) (forall ((v_ArrVal_1329 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= .cse1 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (< (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:08,530 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1329 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:53:08,539 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1329 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_196| v_ArrVal_1329) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:53:10,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) 20) (forall ((v_ArrVal_1333 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1333) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) (not (= (select .cse0 84) 20)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:53:10,479 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 84) 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1333 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| Int)) (or (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184|)) (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_184| v_ArrVal_1333) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:53:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-04 00:53:11,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-04 00:53:11,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-04 00:53:11,773 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1663909793, now seen corresponding path program 4 times [2022-10-04 00:53:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194810752] [2022-10-04 00:53:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 10777 proven. 1067 refuted. 0 times theorem prover too weak. 3856 trivial. 0 not checked. [2022-10-04 00:53:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:15,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194810752] [2022-10-04 00:53:15,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194810752] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:53:15,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914009371] [2022-10-04 00:53:15,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-04 00:53:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:15,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:53:15,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2022-10-04 01:05:31,024 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-04 01:05:31,038 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:05:31,039 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-04 01:05:31,049 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-04 01:05:31,049 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-04 01:05:31,058 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:05:32,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-10-04 01:05:32,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-04 01:05:32,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-10-04 01:05:32,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-10-04 01:05:32,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-10-04 01:05:32,240 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-10-04 01:05:32,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2022-10-04 01:05:32,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-04 01:05:32,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-04 01:05:32,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2022-10-04 01:05:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590904912] [2022-10-04 01:05:32,342 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-04 01:05:32,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-04 01:05:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:05:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-04 01:05:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=4723, Unknown=0, NotChecked=0, Total=5256 [2022-10-04 01:05:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:05:32,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:05:32,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 13.027397260273972) internal successors, (951), 73 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 01:05:32,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:05:32,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:05:32,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-04 01:05:32,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:05:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-04 01:05:32,347 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-10-04 01:05:32,347 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 01:05:32,349 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1] [2022-10-04 01:05:32,349 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-10-04 01:05:32,351 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 01:05:32,351 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 01:05:32,353 INFO L202 PluginConnector]: Adding new model queue_ok.line519.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:05:32 BasicIcfg [2022-10-04 01:05:32,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 01:05:32,354 INFO L158 Benchmark]: Toolchain (without parser) took 873448.60ms. Allocated memory was 255.9MB in the beginning and 988.8MB in the end (delta: 733.0MB). Free memory was 209.4MB in the beginning and 315.9MB in the end (delta: -106.6MB). Peak memory consumption was 627.1MB. Max. memory is 8.0GB. [2022-10-04 01:05:32,354 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 255.9MB. Free memory is still 212.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 01:05:32,354 INFO L158 Benchmark]: Boogie Preprocessor took 84.13ms. Allocated memory is still 255.9MB. Free memory was 209.2MB in the beginning and 205.9MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-04 01:05:32,354 INFO L158 Benchmark]: RCFGBuilder took 702.25ms. Allocated memory is still 255.9MB. Free memory was 205.8MB in the beginning and 202.4MB in the end (delta: 3.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-04 01:05:32,354 INFO L158 Benchmark]: TraceAbstraction took 872654.00ms. Allocated memory was 255.9MB in the beginning and 988.8MB in the end (delta: 733.0MB). Free memory was 202.0MB in the beginning and 315.9MB in the end (delta: -113.9MB). Peak memory consumption was 618.7MB. Max. memory is 8.0GB. [2022-10-04 01:05:32,355 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 255.9MB. Free memory is still 212.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 84.13ms. Allocated memory is still 255.9MB. Free memory was 209.2MB in the beginning and 205.9MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 702.25ms. Allocated memory is still 255.9MB. Free memory was 205.8MB in the beginning and 202.4MB in the end (delta: 3.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 872654.00ms. Allocated memory was 255.9MB in the beginning and 988.8MB in the end (delta: 733.0MB). Free memory was 202.0MB in the beginning and 315.9MB in the end (delta: -113.9MB). Peak memory consumption was 618.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, 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: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1728, positive: 1647, positive conditional: 1647, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1728, positive: 1647, positive conditional: 1647, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1661, positive: 1647, positive conditional: 0, positive unconditional: 1647, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1625, positive: 1611, positive conditional: 0, positive unconditional: 1611, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1661, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1625, unknown conditional: 0, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 1625, Positive cache size: 1611, Positive conditional cache size: 0, Positive unconditional cache size: 1611, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 67, 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: 221, positive: 214, positive conditional: 214, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 216, positive: 211, positive conditional: 211, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 209, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 23, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 377, positive: 362, positive conditional: 362, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 443, Positive conditional cache size: 0, Positive unconditional cache size: 443, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1442, positive: 1426, positive conditional: 1426, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 682, Positive conditional cache size: 0, Positive unconditional cache size: 682, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 49, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1687, positive: 1670, positive conditional: 1670, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 925, Positive conditional cache size: 0, Positive unconditional cache size: 925, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 63, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2027, positive: 2002, positive conditional: 2002, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 931, Positive conditional cache size: 0, Positive unconditional cache size: 931, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 85, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2707, positive: 2666, positive conditional: 2666, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 931, Positive conditional cache size: 0, Positive unconditional cache size: 931, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 123, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2965, positive: 2920, positive conditional: 2920, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 165, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4583, positive: 4502, positive conditional: 4502, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 243, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5137, positive: 5044, positive conditional: 5044, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 333, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5247, positive: 5154, positive conditional: 5154, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1136, Positive conditional cache size: 0, Positive unconditional cache size: 1136, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 423, Statistics for Abstraction: - StatisticsResult: Independence relation #13 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: 26818, positive: 26367, positive conditional: 26367, positive unconditional: 0, negative: 451, negative conditional: 451, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26395, positive: 26367, positive conditional: 0, positive unconditional: 26367, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, positive: 1136, positive conditional: 0, positive unconditional: 1136, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26395, positive: 25231, positive conditional: 0, positive unconditional: 25231, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1136, Positive conditional cache size: 0, Positive unconditional cache size: 1136, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 423, Statistics for Abstraction: - TimeoutResultAtElement [Line: 519]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, 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: t2Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 871.8s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 29.4s, 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: 416, 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.6s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 98.5s InterpolantComputationTime, 16776 NumberOfCodeBlocks, 14928 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 23171 ConstructedInterpolants, 98 QuantifiedInterpolants, 96479 SizeOfPredicates, 175 NumberOfNonLiveVariables, 10663 ConjunctsInSsa, 240 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 56851/104122 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