/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1613.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 22:01:22,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 22:01:22,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 22:01:22,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 22:01:22,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 22:01:22,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 22:01:22,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 22:01:22,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 22:01:22,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 22:01:22,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 22:01:22,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 22:01:22,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 22:01:22,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 22:01:22,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 22:01:22,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 22:01:22,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 22:01:22,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 22:01:22,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 22:01:22,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 22:01:22,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 22:01:22,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 22:01:22,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 22:01:22,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 22:01:22,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 22:01:22,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 22:01:22,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 22:01:22,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 22:01:22,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 22:01:22,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 22:01:22,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 22:01:22,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 22:01:22,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 22:01:22,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 22:01:22,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 22:01:22,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 22:01:22,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 22:01:22,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 22:01:22,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 22:01:22,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 22:01:22,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 22:01:22,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 22:01:22,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 22:01:22,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 22:01:22,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 22:01:22,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 22:01:22,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 22:01:22,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 22:01:22,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 22:01:22,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 22:01:22,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 22:01:22,749 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 22:01:22,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 22:01:22,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 22:01:22,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 22:01:22,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 22:01:22,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 22:01:22,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 22:01:22,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 22:01:22,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 22:01:22,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 22:01:22,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:01:22,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 22:01:22,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 22:01:22,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 22:01:22,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 22:01:22,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 22:01:22,755 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 22:01:22,756 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 22:01:22,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 22:01:22,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 22:01:22,756 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 22:01:22,757 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 22:01:22,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 22:01:22,757 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-29 22:01:22,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 22:01:23,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 22:01:23,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 22:01:23,012 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 22:01:23,015 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 22:01:23,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1613.bpl [2022-09-29 22:01:23,017 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1613.bpl' [2022-09-29 22:01:23,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 22:01:23,096 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 22:01:23,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 22:01:23,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 22:01:23,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 22:01:23,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 22:01:23,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 22:01:23,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 22:01:23,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 22:01:23,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/1) ... [2022-09-29 22:01:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:01:23,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:01:23,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-29 22:01:23,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-29 22:01:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 22:01:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 22:01:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 22:01:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 22:01:23,317 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 22:01:23,461 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 22:01:23,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 22:01:24,514 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 22:01:24,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 22:01:24,531 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 22:01:24,534 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:01:24 BoogieIcfgContainer [2022-09-29 22:01:24,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 22:01:24,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 22:01:24,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 22:01:24,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 22:01:24,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:01:23" (1/2) ... [2022-09-29 22:01:24,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57095b92 and model type divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 10:01:24, skipping insertion in model container [2022-09-29 22:01:24,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:01:24" (2/2) ... [2022-09-29 22:01:24,544 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1613.bpl [2022-09-29 22:01:24,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 22:01:24,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 22:01:24,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 22:01:24,558 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 22:01:24,677 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 22:01:24,732 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:01:24,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:01:24,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:01:24,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 22:01:24,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-29 22:01:24,775 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:01:24,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 22:01:24,788 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;@64185ce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:01:24,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:01:25,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:01:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:01:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1169525397, now seen corresponding path program 1 times [2022-09-29 22:01:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:01:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751694251] [2022-09-29 22:01:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:01:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:01:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:01:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:01:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:01:25,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751694251] [2022-09-29 22:01:25,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751694251] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:01:25,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:01:25,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 22:01:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317775359] [2022-09-29 22:01:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:01:25,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 22:01:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:01:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 22:01:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 22:01:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:25,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:01:25,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 374.5) internal successors, (749), 2 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:01:25,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 22:01:26,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:01:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:01:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -503753295, now seen corresponding path program 1 times [2022-09-29 22:01:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:01:26,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377344510] [2022-09-29 22:01:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:01:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:01:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:01:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:01:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:01:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377344510] [2022-09-29 22:01:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377344510] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:01:26,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:01:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-29 22:01:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958443904] [2022-09-29 22:01:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:01:26,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-29 22:01:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:01:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-29 22:01:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-09-29 22:01:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:26,914 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:01:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 62.53846153846154) internal successors, (813), 14 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:01:26,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:26,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:01:29,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 22:01:29,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:01:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:01:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -263921835, now seen corresponding path program 1 times [2022-09-29 22:01:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:01:29,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849004301] [2022-09-29 22:01:29,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:01:29,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:01:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:01:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-09-29 22:01:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:01:33,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849004301] [2022-09-29 22:01:33,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849004301] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:01:33,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:01:33,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-09-29 22:01:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235306950] [2022-09-29 22:01:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:01:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-09-29 22:01:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:01:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-09-29 22:01:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4608, Unknown=0, NotChecked=0, Total=4830 [2022-09-29 22:01:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:33,755 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:01:33,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 14.028571428571428) internal successors, (982), 70 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:01:33,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:33,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:01:33,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:01:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:01:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-09-29 22:01:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-29 22:01:57,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:01:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:01:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash 312273957, now seen corresponding path program 2 times [2022-09-29 22:01:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:01:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962248302] [2022-09-29 22:01:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:01:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:01:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:02:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16910 backedges. 4153 proven. 3251 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2022-09-29 22:02:06,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:02:06,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962248302] [2022-09-29 22:02:06,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962248302] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:02:06,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683554962] [2022-09-29 22:02:06,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-29 22:02:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:02:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:02:06,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:02:06,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-29 22:02:07,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-29 22:02:07,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-29 22:02:07,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 241 conjunts are in the unsatisfiable core [2022-09-29 22:02:07,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:02:07,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:02:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 22:02:08,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:02:08,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-29 22:02:08,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:02:12,508 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-09-29 22:02:12,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-09-29 22:02:13,105 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-29 22:02:13,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2022-09-29 22:02:13,130 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 22:02:13,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 80 [2022-09-29 22:02:17,128 INFO L356 Elim1Store]: treesize reduction 214, result has 26.7 percent of original size [2022-09-29 22:02:17,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 134 treesize of output 141 [2022-09-29 22:02:17,172 INFO L356 Elim1Store]: treesize reduction 114, result has 23.0 percent of original size [2022-09-29 22:02:17,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 114 treesize of output 111 [2022-09-29 22:02:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16910 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16910 trivial. 0 not checked. [2022-09-29 22:02:17,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:02:17,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683554962] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:02:17,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:02:17,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [64] total 138 [2022-09-29 22:02:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105315188] [2022-09-29 22:02:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:02:17,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-09-29 22:02:17,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:02:17,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-09-29 22:02:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=18463, Unknown=0, NotChecked=0, Total=18906 [2022-09-29 22:02:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:02:17,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:02:17,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 12.58974358974359) internal successors, (982), 78 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:02:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:02:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:02:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-09-29 22:02:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:02:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:02:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:02:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-09-29 22:02:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-09-29 22:02:50,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-29 22:02:50,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-09-29 22:02:50,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:02:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:02:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2032683147, now seen corresponding path program 3 times [2022-09-29 22:02:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:02:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043455391] [2022-09-29 22:02:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:02:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:02:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:02:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 802 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:02:59,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:02:59,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043455391] [2022-09-29 22:02:59,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043455391] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:02:59,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696629497] [2022-09-29 22:02:59,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-29 22:02:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:02:59,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:02:59,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:02:59,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-29 22:02:59,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-09-29 22:02:59,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-29 22:02:59,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 216 conjunts are in the unsatisfiable core [2022-09-29 22:02:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:03:01,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-29 22:03:01,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-29 22:03:05,518 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:03:05,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-29 22:03:06,529 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 22:03:06,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 70 [2022-09-29 22:03:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:03:06,538 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-29 22:03:06,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2022-09-29 22:03:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2022-09-29 22:03:10,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:03:10,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696629497] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:03:10,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:03:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [111] total 173 [2022-09-29 22:03:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792120314] [2022-09-29 22:03:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:03:10,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-09-29 22:03:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:03:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-09-29 22:03:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=29099, Unknown=0, NotChecked=0, Total=29756 [2022-09-29 22:03:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:03:10,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:03:10,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 15.34375) internal successors, (982), 64 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:03:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:03:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:03:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-09-29 22:03:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-09-29 22:03:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:03:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:03:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:03:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-09-29 22:03:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-09-29 22:03:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-09-29 22:03:19,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-29 22:03:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:03:20,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:03:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:03:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1359737719, now seen corresponding path program 1 times [2022-09-29 22:03:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:03:20,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089769985] [2022-09-29 22:03:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:03:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:03:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:03:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 202 proven. 549 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:03:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:03:56,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089769985] [2022-09-29 22:03:56,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089769985] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:03:56,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395370387] [2022-09-29 22:03:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:03:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:03:56,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:03:56,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:03:56,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-29 22:03:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:03:57,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 4116 conjuncts, 308 conjunts are in the unsatisfiable core [2022-09-29 22:03:57,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:03:58,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:03:59,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:03:59,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-29 22:04:00,481 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:04:00,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-29 22:04:12,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:04:12,663 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-09-29 22:04:12,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 31 [2022-09-29 22:04:39,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-09-29 22:04:39,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:04:41,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-09-29 22:04:44,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-29 22:04:47,261 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:04:47,262 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-29 22:04:47,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-09-29 22:04:50,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-09-29 22:04:52,416 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-09-29 22:04:52,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 34 treesize of output 63 [2022-09-29 22:04:57,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2022-09-29 22:04:57,980 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-09-29 22:04:57,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 34 treesize of output 63 [2022-09-29 22:05:03,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2022-09-29 22:05:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 225 proven. 522 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-09-29 22:05:07,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:05:09,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|)))))) is different from false [2022-09-29 22:06:57,980 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|))))))) is different from false [2022-09-29 22:07:00,024 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|)))))) (forall ((|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= 1 (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) is different from false [2022-09-29 22:08:54,709 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1680 Int) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_1680)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|))))))) is different from false [2022-09-29 22:08:55,124 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:55,720 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|))))))) is different from false [2022-09-29 22:08:55,738 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:55,810 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:55,820 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|))))))) is different from false [2022-09-29 22:08:55,848 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (not (= |c_#length| (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| (select |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base|)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:55,984 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (not (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:56,006 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_fifo_empty_#t~mem7#1.base|) (+ 16 |c_ULTIMATE.start_fifo_empty_#t~mem7#1.offset|)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-09-29 22:08:56,713 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (+ 16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:59,716 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) 16))))) is different from false [2022-09-29 22:08:59,743 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (+ 16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:59,761 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) 16)))) (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) (+ |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 4))) 1)))) is different from false [2022-09-29 22:08:59,780 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1679 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) 1))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_DerPreprocessor_1 Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (+ 16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-09-29 22:09:06,526 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 52 treesize of output 37 [2022-09-29 22:09:07,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:09:07,691 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 81 treesize of output 84 [2022-09-29 22:09:07,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:09:07,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-09-29 22:09:07,866 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (.cse1 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (let ((.cse0 (and (or (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse2) .cse1))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (or .cse0 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) .cse1 (or (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2)))) is different from false [2022-09-29 22:09:08,104 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16))))))) (.cse2 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) (let ((.cse1 (and .cse0 (or (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse2)))) (and .cse0 (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse1) (or .cse2 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1)))) is different from false [2022-09-29 22:09:08,216 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) (.cse1 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) (let ((.cse2 (and .cse0 (or .cse1 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))))) (and .cse0 (or .cse1 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse2) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse2)))) is different from false [2022-09-29 22:09:09,397 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|))) (.cse0 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))))))) (let ((.cse1 (and (or .cse2 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) .cse0))) (and .cse0 (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse1) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) (or .cse2 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-09-29 22:09:09,553 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))) (.cse1 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))) (let ((.cse2 (and .cse0 (or .cse1 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))))) (and .cse0 (or .cse1 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse2) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse2)))) is different from false [2022-09-29 22:09:09,638 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))) (.cse0 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))) (let ((.cse1 (and .cse2 (or (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse0)))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse1) .cse2))) is different from false [2022-09-29 22:09:09,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store .cse6 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse6 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))))) (.cse2 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store .cse4 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_1675)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse4 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))))) (let ((.cse0 (and .cse1 (or .cse2 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))))) (and (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse0) .cse1 (or (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0) (or .cse2 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-09-29 22:09:10,137 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_1675)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) (.cse1 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|))) (= (select .cse3 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)))))))) (let ((.cse0 (and (or (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse2) .cse1))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|)) .cse1 (or (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) .cse0) (or .cse2 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-09-29 22:09:10,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_DerPreprocessor_1 Int)) (< (select (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_DerPreprocessor_1) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset| v_ArrVal_1675)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 16)))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_front_~self#1.offset| v_ArrVal_1675)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse5 |c_ULTIMATE.start_fifo_front_~self#1.offset|)))))) (.cse1 (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1675 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_front_~self#1.offset| v_ArrVal_1675)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1679)) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse3 |c_ULTIMATE.start_fifo_front_~self#1.offset|)))))) (and .cse0 (or (and .cse0 .cse1) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (or .cse1 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-09-29 22:09:18,708 INFO L356 Elim1Store]: treesize reduction 184, result has 56.0 percent of original size [2022-09-29 22:09:18,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 273 treesize of output 435 [2022-09-29 22:09:18,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:09:18,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 709 treesize of output 692 [2022-09-29 22:09:18,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:09:18,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 496 treesize of output 548 [2022-09-29 22:09:18,895 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 382 treesize of output 358 [2022-09-29 22:09:18,920 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 358 treesize of output 354 [2022-09-29 22:09:18,947 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 354 treesize of output 338 [2022-09-29 22:09:19,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:09:19,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 430 treesize of output 460 [2022-09-29 22:12:53,723 WARN L233 SmtUtils]: Spent 14.38s on a formula simplification. DAG size of input: 250 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-29 22:13:02,069 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_1674 Int) (v_subst_1 Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store (store |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_1674) v_subst_1 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#q~1#1.base|) 16)) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) is different from false [2022-09-29 22:13:04,988 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1674 Int) (v_subst_1 Int)) (or (forall ((v_DerPreprocessor_1 Int)) (< (select (store (store |c_#length| |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_1674) v_subst_1 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#q~1#1.base|) 16)) (not (< v_subst_1 |c_#StackHeapBarrier|)))))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) is different from false [2022-09-29 22:13:17,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((|pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| Int) (v_ArrVal_1673 Int) (v_ArrVal_1672 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_1674 Int) (v_subst_1 Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_1672) |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1673))) (or (< (select (store (store .cse0 |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_1674) v_subst_1 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#q~1#1.base|) 16) (not (< |pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (< (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (< 4 v_ArrVal_1673) (not (< v_subst_1 |c_#StackHeapBarrier|))))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)))) is different from false [2022-09-29 22:14:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 193 proven. 88 refuted. 0 times theorem prover too weak. 4 trivial. 466 not checked. [2022-09-29 22:14:01,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395370387] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-29 22:14:01,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-29 22:14:01,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 115, 93] total 361 [2022-09-29 22:14:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943061567] [2022-09-29 22:14:01,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-29 22:14:01,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 361 states [2022-09-29 22:14:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:14:01,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 361 interpolants. [2022-09-29 22:14:01,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1657, Invalid=108164, Unknown=187, NotChecked=19952, Total=129960 [2022-09-29 22:14:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:14:01,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:14:01,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 361 states, 361 states have (on average 12.454293628808864) internal successors, (4496), 361 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:14:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:14:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:14:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-09-29 22:14:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-09-29 22:14:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-09-29 22:14:01,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-09-29 22:14:47,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 22:14:47,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 22:14:47,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 22:14:48,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-29 22:14:48,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:14:48,213 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 418 known predicates. [2022-09-29 22:14:48,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 22:14:48,217 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-09-29 22:14:48,219 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-09-29 22:14:48,221 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-29 22:14:48,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-29 22:14:48,223 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1613.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.09 10:14:48 BasicIcfg [2022-09-29 22:14:48,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-29 22:14:48,224 INFO L158 Benchmark]: Toolchain (without parser) took 805128.41ms. Allocated memory was 196.1MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 143.9MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-29 22:14:48,224 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 196.1MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 22:14:48,224 INFO L158 Benchmark]: Boogie Preprocessor took 152.75ms. Allocated memory is still 196.1MB. Free memory was 143.9MB in the beginning and 165.8MB in the end (delta: -21.9MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-09-29 22:14:48,225 INFO L158 Benchmark]: RCFGBuilder took 1283.01ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 165.8MB in the beginning and 198.1MB in the end (delta: -32.3MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. [2022-09-29 22:14:48,225 INFO L158 Benchmark]: TraceAbstraction took 803687.64ms. Allocated memory was 255.9MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 197.6MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-29 22:14:48,226 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.15ms. Allocated memory is still 196.1MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 152.75ms. Allocated memory is still 196.1MB. Free memory was 143.9MB in the beginning and 165.8MB in the end (delta: -21.9MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1283.01ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 165.8MB in the beginning and 198.1MB in the end (delta: -32.3MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. * TraceAbstraction took 803687.64ms. Allocated memory was 255.9MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 197.6MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 551, positive: 532, positive conditional: 532, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 532, Positive conditional cache size: 0, Positive unconditional cache size: 532, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1736, positive: 1686, positive conditional: 1686, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 1686, Positive cache size: 1686, Positive conditional cache size: 0, Positive unconditional cache size: 1686, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 69, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4424, positive: 4297, positive conditional: 4297, positive unconditional: 0, negative: 127, negative conditional: 127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 4200, Positive cache size: 4196, Positive conditional cache size: 0, Positive unconditional cache size: 4196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 192, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 46159, positive: 44694, positive conditional: 44694, positive unconditional: 0, negative: 1465, negative conditional: 1465, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 39910, Positive cache size: 39807, Positive conditional cache size: 0, Positive unconditional cache size: 39807, Negative cache size: 103, Negative conditional cache size: 0, Negative unconditional cache size: 103, Independence queries for same thread: 1546, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9162, positive: 8885, positive conditional: 8885, positive unconditional: 0, negative: 277, negative conditional: 277, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 43029, Positive cache size: 42924, Positive conditional cache size: 0, Positive unconditional cache size: 42924, Negative cache size: 105, Negative conditional cache size: 0, Negative unconditional cache size: 105, Independence queries for same thread: 1814, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4609, positive: 4471, positive conditional: 4471, positive unconditional: 0, negative: 138, negative conditional: 138, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 43506, Positive cache size: 43399, Positive conditional cache size: 0, Positive unconditional cache size: 43399, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Independence queries for same thread: 1946, Statistics for Abstraction: - StatisticsResult: Independence relation #7 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: 66643, positive: 64565, positive conditional: 64565, positive unconditional: 0, negative: 2078, negative conditional: 2078, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64695, positive: 64565, positive conditional: 0, positive unconditional: 64565, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43506, positive: 43399, positive conditional: 0, positive unconditional: 43399, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64695, positive: 21166, positive conditional: 0, positive unconditional: 21166, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 43506, unknown conditional: 0, unknown unconditional: 43506] , Statistics on independence cache: Total cache size (in pairs): 43506, Positive cache size: 43399, Positive conditional cache size: 0, Positive unconditional cache size: 43399, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Independence queries for same thread: 1948, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1613]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 418 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1463 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 803.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 115.8s, 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: 400, 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.8s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 680.1s InterpolantComputationTime, 18204 NumberOfCodeBlocks, 13567 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 19818 ConstructedInterpolants, 2073 QuantifiedInterpolants, 302616 SizeOfPredicates, 445 NumberOfNonLiveVariables, 7217 ConjunctsInSsa, 765 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 34097/39319 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