/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.line1490.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:43:36,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:43:36,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:43:36,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:43:36,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:43:36,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:43:36,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:43:36,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:43:36,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:43:36,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:43:36,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:43:36,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:43:36,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:43:36,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:43:36,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:43:36,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:43:36,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:43:36,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:43:36,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:43:36,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:43:36,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:43:36,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:43:37,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:43:37,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:43:37,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:43:37,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:43:37,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:43:37,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:43:37,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:43:37,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:43:37,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:43:37,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:43:37,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:43:37,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:43:37,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:43:37,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:43:37,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:43:37,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:43:37,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:43:37,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:43:37,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:43:37,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:43:37,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:43:37,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:43:37,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:43:37,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:43:37,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:43:37,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:43:37,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:43:37,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:43:37,036 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:43:37,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:43:37,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:43:37,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:43:37,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:43:37,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:43:37,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:43:37,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:43:37,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:43:37,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:43:37,045 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:43:37,045 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:43:37,045 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:43:37,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:43:37,045 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:43:37,046 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:43:37,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:43:37,046 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:43:37,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:43:37,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:43:37,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:43:37,276 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:43:37,281 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:43:37,282 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.line1490.bpl [2022-10-03 14:43:37,283 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1490.bpl' [2022-10-03 14:43:37,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:43:37,367 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:43:37,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:43:37,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:43:37,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:43:37,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:43:37,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:43:37,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:43:37,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:43:37,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/1) ... [2022-10-03 14:43:37,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:43:37,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:37,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:43:37,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:43:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:43:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:43:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:43:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:43:37,589 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:43:37,761 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:43:37,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:43:38,640 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:43:38,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:43:38,652 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:43:38,654 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:38 BoogieIcfgContainer [2022-10-03 14:43:38,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:43:38,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:43:38,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:43:38,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:43:38,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:43:37" (1/2) ... [2022-10-03 14:43:38,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141265d2 and model type divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:43:38, skipping insertion in model container [2022-10-03 14:43:38,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1490.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:38" (2/2) ... [2022-10-03 14:43:38,665 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1490.bpl [2022-10-03 14:43:38,670 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:43:38,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:43:38,675 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:43:38,676 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:43:38,776 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:43:38,832 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:43:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:43:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:38,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:43:38,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:43:38,868 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:43:38,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:43:38,887 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;@76884aae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:43:38,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:43:39,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1145454237, now seen corresponding path program 1 times [2022-10-03 14:43:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:39,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470500274] [2022-10-03 14:43:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:43:39,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:39,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470500274] [2022-10-03 14:43:39,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470500274] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:43:39,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:43:39,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:43:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554379575] [2022-10-03 14:43:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:43:39,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:43:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:43:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:43:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:39,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 325.0) internal successors, (650), 2 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:43:39,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:40,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:43:40,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1626386178, now seen corresponding path program 1 times [2022-10-03 14:43:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:40,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424555675] [2022-10-03 14:43:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:43:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:41,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424555675] [2022-10-03 14:43:41,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424555675] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:43:41,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:43:41,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-10-03 14:43:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128445728] [2022-10-03 14:43:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:43:41,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-03 14:43:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:41,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-03 14:43:41,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2022-10-03 14:43:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:41,756 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:41,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 15.212765957446809) internal successors, (715), 48 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:43:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-03 14:43:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:43:52,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1851713534, now seen corresponding path program 1 times [2022-10-03 14:43:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:52,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940544536] [2022-10-03 14:43:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 106 proven. 95 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:43:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:54,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940544536] [2022-10-03 14:43:54,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940544536] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:43:54,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809896122] [2022-10-03 14:43:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:54,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:43:54,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:54,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:43:54,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:43:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:54,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 2538 conjuncts, 272 conjunts are in the unsatisfiable core [2022-10-03 14:43:54,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:43:55,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:43:56,098 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:43:56,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 14:43:56,353 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 20 treesize of output 20 [2022-10-03 14:43:58,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:43:58,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:43:58,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:58,518 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-10-03 14:43:58,884 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-10-03 14:44:00,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:44:00,440 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-03 14:44:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-10-03 14:44:00,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:44:00,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809896122] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:44:00,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:44:00,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [50] total 111 [2022-10-03 14:44:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586293437] [2022-10-03 14:44:00,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:44:00,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 14:44:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:44:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 14:44:00,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=11801, Unknown=0, NotChecked=0, Total=12210 [2022-10-03 14:44:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:00,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:44:00,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 13.790322580645162) internal successors, (855), 62 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:44:00,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:00,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-03 14:44:00,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-10-03 14:44:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-10-03 14:44:17,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:44:17,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 14:44:17,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:44:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:44:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1578265652, now seen corresponding path program 1 times [2022-10-03 14:44:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:44:17,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813489068] [2022-10-03 14:44:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:44:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:44:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:44:20,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813489068] [2022-10-03 14:44:20,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813489068] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:44:20,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:44:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-10-03 14:44:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361459126] [2022-10-03 14:44:20,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:44:20,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-03 14:44:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:44:20,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-03 14:44:20,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3963, Unknown=0, NotChecked=0, Total=4160 [2022-10-03 14:44:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:20,052 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:44:20,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 11.661538461538461) internal successors, (758), 65 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:44:20,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:20,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2022-10-03 14:44:20,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-10-03 14:44:20,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:44:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:44:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-10-03 14:44:45,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:44:45,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:44:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:44:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -965165312, now seen corresponding path program 1 times [2022-10-03 14:44:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:44:45,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270528776] [2022-10-03 14:44:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:44:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 106 proven. 95 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:44:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:44:47,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270528776] [2022-10-03 14:44:47,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270528776] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:44:47,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636655092] [2022-10-03 14:44:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:47,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:44:47,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:44:47,315 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-10-03 14:44:47,315 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-10-03 14:44:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:47,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 2388 conjuncts, 310 conjunts are in the unsatisfiable core [2022-10-03 14:44:47,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:44:47,942 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-03 14:44:48,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:44:48,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:44:50,716 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 14:44:50,717 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 20 treesize of output 22 [2022-10-03 14:44:51,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-03 14:44:51,189 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 29 treesize of output 27 [2022-10-03 14:44:52,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 14:44:53,311 INFO L356 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2022-10-03 14:44:53,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 35 [2022-10-03 14:44:54,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:44:54,225 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-03 14:44:54,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-10-03 14:44:54,479 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 10 treesize of output 9 [2022-10-03 14:44:56,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:44:56,382 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 37 treesize of output 28 [2022-10-03 14:44:56,822 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-10-03 14:44:56,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-10-03 14:44:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 153 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:44:58,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:45:06,844 INFO L356 Elim1Store]: treesize reduction 43, result has 8.5 percent of original size [2022-10-03 14:45:06,845 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 233 treesize of output 211 [2022-10-03 14:45:33,934 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:45:33,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 236 treesize of output 208 [2022-10-03 14:45:33,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:45:33,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 204 [2022-10-03 14:45:33,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:33,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:33,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:45:33,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 418 treesize of output 366 [2022-10-03 14:45:34,150 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 6 treesize of output 4 [2022-10-03 14:45:34,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:45:34,168 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 10 treesize of output 4 [2022-10-03 14:45:34,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:45:34,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 27 [2022-10-03 14:45:34,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:34,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:34,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:45:34,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 285 treesize of output 339 [2022-10-03 14:45:45,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:45:45,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 164 [2022-10-03 14:45:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 124 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:45:46,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636655092] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:45:46,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:45:46,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 104, 97] total 247 [2022-10-03 14:45:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670674450] [2022-10-03 14:45:46,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:45:46,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 247 states [2022-10-03 14:45:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:45:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 247 interpolants. [2022-10-03 14:45:46,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=58420, Unknown=665, NotChecked=0, Total=60762 [2022-10-03 14:45:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:46,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:45:46,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 247 states, 247 states have (on average 10.753036437246964) internal successors, (2656), 247 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:45:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:45:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:45:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-10-03 14:45:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:06,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse12 (+ .cse13 2))) (and (< |c_ULTIMATE.start_fifo_node_init_~self#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 .cse1))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (forall ((v_ArrVal_522 Int) (v_ArrVal_519 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse6 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse3 .cse2) (= (select .cse4 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) .cse2) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (= .cse3 (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (not (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 0)) (not (< |c_#StackHeapBarrier| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))) (<= (select |c_#length| |c_ULTIMATE.start_fifo_init_~self#1.base|) 8) (= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) 0) (forall ((v_ArrVal_522 Int) (v_ArrVal_519 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse11 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (store .cse11 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse8 (store .cse10 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse7 (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse9) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse7 .cse9) (= (select .cse10 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) .cse9) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|))))))) (<= .cse12 |c_ULTIMATE.start_main_~#p~0#1.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_init_~self#1.base|) 8) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 8) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 8) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (= .cse13 (select .cse14 .cse1)) (<= .cse12 |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_init_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (< |c_ULTIMATE.start_fifo_node_init_#in~self#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 8) (not (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|)) (= |c_ULTIMATE.start_fifo_node_init_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 0) (= |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.offset| 0) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (forall ((v_ArrVal_522 Int) (v_ArrVal_519 (Array Int Int)) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse19 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse18 (store .cse19 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse17 (store .cse18 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse15 .cse16) (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse16) (not (= .cse15 (select .cse17 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse18 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) .cse16) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|))))))))))) is different from false [2022-10-03 14:46:29,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (<= .cse0 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 8)) (<= .cse0 8) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse3 (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (select .cse3 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) 8) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 8) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_fifo_front_~self#1.base|) 8) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse7 (store .cse9 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse8 (store .cse7 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse5 .cse6) (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse6 (select .cse7 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse5 (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse12 (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse14 (store .cse12 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse11 (select .cse12 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse13 (select .cse14 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (= .cse13 .cse11) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse15)) (= (select .cse10 0) (select .cse10 4)) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (<= (select |c_#length| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) 8) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse16) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse0 (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse21 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse19 (store .cse21 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse20 (store .cse19 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse17 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse17 .cse18) (= .cse18 (select .cse19 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse17 (select .cse20 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| .cse15)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (select |c_#length| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) 8) (<= (select |c_#length| |c_ULTIMATE.start_main_~#q~1#1.base|) 8) (= .cse16 |c_ULTIMATE.start_fifo_pop_#t~mem43#1.offset|))) is different from false [2022-10-03 14:46:33,358 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse10 (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (<= .cse0 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 8)) (<= .cse0 8) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse3 (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (select .cse3 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse7 (store .cse9 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse8 (store .cse7 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse5 .cse6) (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse6 (select .cse7 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse5 (select .cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))))) (= .cse10 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse12 (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse14 (store .cse12 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse11 (select .cse12 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse13 (select .cse14 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (= .cse13 .cse11) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse15)) (= (select .cse16 0) (select .cse16 4)) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (<= .cse0 (+ |c_ULTIMATE.start_fifo_pop_#t~mem46#1.offset| 8)) (= .cse10 |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base|) (<= .cse0 (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse21 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse19 (store .cse21 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse20 (store .cse19 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse17 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse17 .cse18) (= .cse18 (select .cse19 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse17 (select .cse20 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| .cse15)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) is different from false [2022-10-03 14:47:24,111 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (.cse0 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (<= (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 8) (<= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (or .cse0 (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse3 (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select .cse3 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))))))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= (select .cse4 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (not .cse0) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (let ((.cse5 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 0) (select .cse5 4))))) is different from false [2022-10-03 14:47:32,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse3 (not (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (.cse5 (select (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|))) (and (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (forall ((v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| .cse1) (= (select .cse2 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (or (forall ((v_ArrVal_527 Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| v_ArrVal_527) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) .cse3) (= (select |c_#valid| (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) 0) (<= (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 8) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| .cse4) (= |c_ULTIMATE.start_fifo_drop_head_#t~mem36#1.base| .cse4) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= .cse5 |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (<= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (or (forall ((v_ArrVal_527 Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| v_ArrVal_527) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) 1) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| .cse5) 1) (<= 0 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (= (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (= (select |c_#valid| (select .cse6 4)) 0) (not (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-10-03 14:47:39,740 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) (.cse19 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse10 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse18)) (.cse2 (select .cse19 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse3 (select .cse1 4)) (.cse11 (select .cse19 .cse12))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (or (forall ((v_ArrVal_527 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| v_ArrVal_527) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) (not (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse2) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3)) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) 8) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 8) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= 1 (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base|)) (= (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) 1) (or (not (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_527 Int) (v_ArrVal_525 Int)) (let ((.cse5 (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_525)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (store |c_#valid| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| v_ArrVal_527) .cse4) 1)) (not (= .cse4 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse7 (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|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse9 (store .cse7 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse6 (select .cse7 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse8 (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (= .cse8 .cse6) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))))))) .cse10) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse11) (<= (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 8) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse12) (= (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| .cse3) 0) (not .cse10) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse2 .cse11) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (= (select |c_#valid| .cse3) 0) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse17 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse15 (store .cse17 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse16 (store .cse15 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse13 (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse13 .cse14) (= .cse14 (select .cse15 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse13 (select .cse16 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| .cse18)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse11)))) is different from false [2022-10-03 14:47:41,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select .cse5 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (<= (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 8) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse0)) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 8) (or (not (= (select |c_#valid| .cse1) 1)) (not (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_527 Int) (v_ArrVal_525 Int)) (let ((.cse3 (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_525)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (store |c_#valid| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| v_ArrVal_527) .cse2) 1)) (not (= .cse2 (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse1)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (= .cse4 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (= (select |c_#valid| .cse0) 0) (or (forall ((v_ArrVal_522 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| Int) (v_ArrVal_525 Int) (|v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| Int)) (let ((.cse10 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse8 (store .cse10 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_34| v_ArrVal_522))) (let ((.cse9 (store .cse8 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21| v_ArrVal_525))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< |c_ULTIMATE.start_fifo_pop_~self#1.offset| |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (= .cse6 .cse7) (= .cse7 (select .cse8 |v_ULTIMATE.start_fifo_drop_head_~self#1.offset_21|)) (not (= .cse6 (select .cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| .cse1)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) is different from false [2022-10-03 14:48:22,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 14:48:22,471 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-10-03 14:48:22,494 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-10-03 14:48:22,672 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-10-03 14:48:22,675 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 58 more [2022-10-03 14:48:22,678 INFO L158 Benchmark]: Toolchain (without parser) took 285311.16ms. Allocated memory was 179.3MB in the beginning and 607.1MB in the end (delta: 427.8MB). Free memory was 126.1MB in the beginning and 206.0MB in the end (delta: -79.9MB). Peak memory consumption was 348.5MB. Max. memory is 8.0GB. [2022-10-03 14:48:22,678 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:48:22,679 INFO L158 Benchmark]: Boogie Preprocessor took 124.31ms. Allocated memory is still 179.3MB. Free memory was 126.0MB in the beginning and 147.0MB in the end (delta: -21.0MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-10-03 14:48:22,679 INFO L158 Benchmark]: RCFGBuilder took 1152.36ms. Allocated memory was 179.3MB in the beginning and 243.3MB in the end (delta: 64.0MB). Free memory was 147.0MB in the beginning and 198.5MB in the end (delta: -51.5MB). Peak memory consumption was 65.4MB. Max. memory is 8.0GB. [2022-10-03 14:48:22,679 INFO L158 Benchmark]: TraceAbstraction took 284021.52ms. Allocated memory was 243.3MB in the beginning and 607.1MB in the end (delta: 363.9MB). Free memory was 197.5MB in the beginning and 206.0MB in the end (delta: -8.6MB). Peak memory consumption was 355.5MB. Max. memory is 8.0GB. [2022-10-03 14:48:22,680 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.12ms. Allocated memory is still 179.3MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 124.31ms. Allocated memory is still 179.3MB. Free memory was 126.0MB in the beginning and 147.0MB in the end (delta: -21.0MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * RCFGBuilder took 1152.36ms. Allocated memory was 179.3MB in the beginning and 243.3MB in the end (delta: 64.0MB). Free memory was 147.0MB in the beginning and 198.5MB in the end (delta: -51.5MB). Peak memory consumption was 65.4MB. Max. memory is 8.0GB. * TraceAbstraction took 284021.52ms. Allocated memory was 243.3MB in the beginning and 607.1MB in the end (delta: 363.9MB). Free memory was 197.5MB in the beginning and 206.0MB in the end (delta: -8.6MB). Peak memory consumption was 355.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 14:48:22,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...